Báo cáo khoa học: "Multi-Tagging for Lexicalized-Grammar Parsing" pot

... state equal value and share half the value uni- formly among the negative examples for the ex- amples generated from that state and the other half uniformly among the positive examples. We parallelize ... English Penn Treebank (Taylor et al., 2003). We used sections 02–21 for training, section 22 for development, and section 23 for testing, pre- processed as per Table 1. We evaluated...

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

... node exactly once, for we use exactly one α 1 tree for each node literal. The edges which weren’t used in the cycle can be consumed in the edge eating mode. The main source for the combinatorics ... The nodes for “Peter” and “Mary” both require their incoming edge to be labelled with either subj or obj and neither require nor allow any outgoing edges. A well-formed dependency tree fo...

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

... utilize phrase categories, and thus relies on word information like parts of speech and lexicalized words. Therefore, we want to know the performance of dependency parsers that have minimal or ... the word’s lemma, the POS/chunk tag and the information of its child node(s). The lemma is obtained from the word form using a lemmatizer, except for numbers, which are replaced by “num”. The .....

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

... new tools for lexical semantics research: for sense discrimination tasks [Atldns 1987]; for constructing concept taxonomies [Amsler 1985, Atldns, Klavans and Boguraev, forthcoming]; for establishing ... (i) a. John forgot that he locked the door. b. John forgot to lock the door. Sentence (a) has a factive interpretation of "forget" that (b) does not carry. 5. Test for...

Ngày tải lên: 24/03/2014, 05:21

... own. For utilizing syntactical information the me- chanical dictionary must contain expressions for the word class of each entry; this will take the form of a number or series of numbers for ... course, be transformed into a unique linear sequence for dictionary purposes, rather in the way that the structural formulae of organic compounds can be given linear codes for purpose...

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

... Parsing for Machine Translation Michel Galley Computer Science Department Stanford University Stanford, CA 94305-9020 mgalley@cs.stanford.edu Christopher D. Manning Computer Science Department Stanford ... for each modifier x j can easily be applied left-to-right during phrase-based decoding, which proceeds in the same order. For each hypothesis expansion, our decoder generates the follo...

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

... performance, with an LF of around 88.5%, in the settings of parsing time less than 500ms/sentence for Section 22. For comparison with previous studies using the packed parse forest, the performances ... of a packed parse forest for efficient and ac- curate parsing. However, they have sev- eral inherent problems deriving from the restriction of locality in the packed parse forest....

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

... entry for a next state, while constructing a constituent structure by instantiating it. No search for unifiable categories is involved during parsing. procedure CLOSURE(I); begin repeat for ... search for GOTO table entries during parsing. 1 Introduction The LR method is known to be a very efficient parsing algorithm that involves no searching or backtracking. However, recen...

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

... the ba- sis for language modeling, " means that in- formation about the probability of a rule apply- ing at a particular point in a parse derivation is lost" (1993). For this reason ... did not work well. The amount of informa- tion carried in PROFER's token's (to allow for bracketing and heuristic scoring of the seman- tic hypotheses) requires structures that...

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

... derivation, but a bottom-up parser has to consider 11 possible analyses for the word junge, 6 for the phrase junge Frau, 4 for die and 2 for die junge Frau. This example shows that even irk a pure categorial ... wholly on the syntactic information en- coded in the syntactic rules. For CUG, this is an akward situation, as most syntactic information which could be relevant for...

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