dependency avoidance of commitment

Ngày tải lên: 31/03/2014, 20:20

... tag of the head IG in- 6 This choice is based on the observation that in the tree- bank, 85.6% of the dependency links land on the first (and possibly the only) IG of the head word, while 14.4% of ... average of about 8 words; 8 90% of the sentences had less than or equal to 15 words. In terms of IG s, the sentences comprised 2 to 55 IGs with an average of 10 IG s per sentence; 90% of the sentences ... word. 92 Statistical Dependency Parsing of Turkish G ¨ uls¸en Eryi ˇ git Department of Computer Engineering Istanbul Technical University Istanbul, 34469, Turkey gulsen@cs.itu.edu.tr Kemal Oflazer Faculty of Engineering...

Ngày tải lên: 22/02/2014, 02:20

Ngày tải lên: 17/03/2014, 04:20

Ngày tải lên: 17/03/2014, 22:20

Ngày tải lên: 23/03/2014, 06:20

Ngày tải lên: 19/06/2014, 22:20

... x. By relating the sum of the scores of all possible trees to counting the number of spanning trees in a graph, it can be shown that Z x is the determinant of the Kirchoff matrix K, which is ... marginal probability of a particular edge k → i (i.e. y i =k), the score of any edge k  → i such that k  = k is set to 0. The determinant of the resulting modi- fied Kirchoff matrix K k→i is then the sum of ... complex- ity of non-projective data-driven dependency parsing. In Proc. of IWPT, pages 121–132. Ryan McDonald, Koby Crammer, and Fernando Pereira. 2005. Online large-margin training of dependency parsers....

Ngày tải lên: 20/02/2014, 07:20

... semantics of MNs well, the MN clusters constructed by using dependency relations should serve as a good gazetteer. However, the high level of computa- tional cost has prevented the use of clustering for ... for storing only a part of classes C l , i.e., 1/|P | of the parame- ter matrix, where P is the number of cluster nodes. This data splitting enables linear scalability of mem- ory sizes. However, ... and, in terms of execution speed, may 4 Acknowledgements: This corpus was provided by Dr. Daisuke Kawahara of NICT. 5 To be precise, we need two copies of these. 6 Each node has a copy of the training...

Ngày tải lên: 20/02/2014, 09:20

... “resigns” is root of event. Figure 2: Types of dependency features. Example features are for e = ”Abdul Halim Khaddam resigns as Vice President of Syria” and s = ”The resignation of Khaddam was ... features obtained from the tran- sitive closure of dependency relations. The method yields a model capable of matching events with an F-measure of 66.5%. 1 Introduction Question answering systems ... using the transitive closure of the dependency relation, we believe that—especially in the face of a small data set—we have struck a balance between the represen- tative power of dependencies and the...

Ngày tải lên: 20/02/2014, 09:20

... accuracy of model (d) is comparable to that of our model, we can conclude that the con- sideration of the syntactic property of a verb does not necessarily improve dependency analysis. The accuracy of ... explanation of the dependency structure T: m(T ) : the number of verbs in T v i (T ) : the i-th verb in T c i (T ) : the number of case elements that mod- ify the i-th verb in T es i (T ) : the set of ... in terms of the coverage and consistency of the rules. The recent availability of larger-scale corpora an- notated with dependency information has thus re- sulted in more work on statistical dependency analysis...

Ngày tải lên: 20/02/2014, 12:20

... of parent node in dependency tree. c-word: word of child node. p-pos: POS of parent node. c-pos: POS of child node. p-pos+1: POS to the right of parent in sentence. p-pos-1: POS to the left of ... parent of x j . T = {(x t , y t )} T t=1 denotes the training data. We follow the edge based factorization method of Eisner (1996) and define the score of a dependency tree as the sum of the score of ... Linguistics Online Large-Margin Training of Dependency Parsers Ryan McDonald Koby Crammer Fernando Pereira Department of Computer and Information Science University of Pennsylvania Philadelphia, PA {ryantm,crammer,pereira}@cis.upenn.edu Abstract We...

Ngày tải lên: 20/02/2014, 15:20

... framework for dependency gram- mar which supports the modular decomposition of immediate dependency and linear precedence. Duchier (1999) formulated a constraint-based ax- iomatization of dependency ... the limitations of Reape’s (1994) popular theory of ‘word order domains’. In Section 3 we introduce the concept of topological dependency tree. In Section 4 we outline the formal framework for our theory of ... lieben 3 Topological Dependency Trees Our approach is based on dependency grammar. We also propose to distinguish two structures: (a) a tree ofsyntactic dependencies, (b) a tree of topo- logical...

Ngày tải lên: 20/02/2014, 18:20

... pro- vide state -of- the-art performance across multiple languages. However, the parsing algorithms re- quire that the score of a dependency tree factors as a sum of the scores of its edges. This ... the second-order MST has a score of m. Proof: First we observe that no tr ee can have a score greater than m since that would require more than m pairs of edges of t he form (x i , y j , z k ). ... O(n 3 ) extension of the Eisner algorithm to second-order dependency parsing. This figure shows how h 1 creates a dependency to h 3 with the second-order knowledge that the last dependent of h 1 was...

Ngày tải lên: 22/02/2014, 02:20

Ngày tải lên: 06/03/2014, 21:20

... Because of this output of MST has higher number of instances of multiple subjects/objects than Malt. Total Instances Malt 39 MST + MAXENT 51 Table 1: Number of instances of multiple ... Comparison of NA and PA with previous best results for Hindi Improvement in case of MST+MAXENT is greater than that of Malt. One reason is because of more number of instances of multiple ... seen a surge in the development of dependency based tree- banks. Due to the availability of dependency tree- banks, there are several recent attempts at build- ing dependency parsers. Two CoNLL...

Ngày tải lên: 07/03/2014, 22:20

... found. The overall number of errors thus seems to be over 1% of the total size of a corpus, which is expected to be of a very high quality. A fact that one has to be aware of when working with ... Automatic Correction of Errors In this section we propose our algorithm for auto- matic correction of errors, which consists out of the following steps: 1. Automatic detection of error candidates, ... gold-standard. 2. Substitution of the annotation of the error candidates by the annotation proposed by one of the parsers (in our case MSTParser). 3. Parse of the modified corpus with a third...

Ngày tải lên: 07/03/2014, 22:20

... discov- ered. Recently, however, a number of dependency parsers have been developed that have very differ- ent theories of a correct model of dependencies. Dependency parsers define syntactic relations between ... system of conversion makes the assumption that the governor of a typed dependency will al- ready have been assigned a position in a diagram. This is due to the largely tree-like structure of dependency ... of the root dependency. The dependent is added to the diagram data structure based on its relation to the governor. Before analysis of dependency graphs begins, our algorithm takes in a set of...

Ngày tải lên: 08/03/2014, 01:20

... paths of each pair is calculated by employing Dynamic Time Warping algorithm. The input of the cal- culation is correlations between dependency re- lations, which are estimated from a set of train- ing ... it is the most important phrase of the question. Con- straint are the other phrases of the question ex- cept topic, such as ”1983” and ”1996”. Verb is the main verb of the question, such as ”lead”. ... to further enhance state -of- the-art QA systems even if they have a good NER. In addition, we evaluate component contribu- tions of our method based on the main idea of relation path correlation....

Ngày tải lên: 08/03/2014, 02:21

... inf n 1 n log M n (s). Proof. We pro c ee d as in the last half of the proof of the operator bounds, Lemma 2.7. Through a small modification, notably replacing δ f by ∆, and making use of mixing, condition ... the properties of our conformal maps. The diameter of K is finite within U. Given two points y and z in K, choose a geodesic between them of length not greater than the diameter of K. By taking ... roles of y and w we see that P b f (ξ) is independent of the choices made (up to a permutation of J). In the following we will denote by (6.38) D b f = {v ∈ P b f (ξ) : ξ ∈  K ∆ } the set of all...

Ngày tải lên: 15/03/2014, 09:20

... adaptation of dependency parsers. 3 Experiments 3.1 Data point selection The key idea in our experiments is that we can use a simple form of instance weighting, similar to what is often used ... Corpus- based induction of syntactic structure: models of de- pendency and constituency. In ACL. Ryan McDonald, Koby Crammer, and Fernando Pereira. 2005. Online large-margin training of dependency parsers. ... part -of- speech tags are enough to do reasonably well, and languages are rel- atively similar at this level of abstraction. Of course annotations differ, but nouns are likely to be depen- dents of...

Ngày tải lên: 17/03/2014, 00:20