Báo cáo khoa học: "Repair Strategies for Lexicalized Tree Grammars" docx

... phenomena in the Gocad corpora 1.2 Exploiting Lexicalized Tree Grammars The choice of a LTG (Lexicalized Tree Grammar), more specifically a LTAG (Lexicalized Tree Adjo- ing Grammar), can be justified ... elementary trees (for example for unexpected ad- verbs which can modify predicative nouns) and a notation enrichment for the possible ellipsis occur- rences (Lopez, 19...

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

... That means that the most common rea- son for the speaker to interrupt is to ask for or give information that is crucial for the driving task (as opposed for the other and traffic domains, which are ... Association for Computational Linguistics, pages 798–805, Uppsala, Sweden, 11-16 July 2010. c 2010 Association for Computational Linguistics Now, where was I? Resumption strategies...

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

... descriptions for the novice tend to include more detail about functional reformation than descriptions for the expert. We have shown how formalization of the strategies allows for the development ... we have found that two different strategies were used in describing physical objects, depending on whether the description was for an adult or for a junior. For an adult, a...

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

... Offline Strategies for Online Question Answering: Answering Questions Before They Are Asked Michael Fleischman, Eduard Hovy, Abdessamad Echihabi USC Information Sciences Institute ... complete repository of useful information. Most newspaper texts, for example, do not remain accessible on the Web for more than a few weeks. Further, while Information Retrieval techniques ... i...

Ngày tải lên: 08/03/2014, 04:22

... improve performance. However, for grammar formalisms which use more fine-grained grammatical cate- gories, for example TAG and CCG, tagging accuracy is much lower. In fact, for these formalisms, ... the Penn Treebank training data (Ratnaparkhi, 1996; Toutanova et al., 2003). So why should we continue to work on the POS tagging problem? Here we give two reasons. First, for lexicalized...

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

... w j =before(w i ). It can be applied recursively, as w k = before(w j ) = before(before(w i )) to generate the entire sentence starting with an arbitrary word, usually the sentence Main. before() ... applied as a predicate, such as before(w i , w j ). Thus for each word w i in the sentence, inSentence(w i , s i ) ⇒ main(w m , s k ) ∧ (before(w i , w m ) ∨ before(w m , w i )). A con...

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

... 2009. c 2009 Association for Computational Linguistics EM Works for Pronoun Anaphora Resolution Eugene Charniak and Micha Elsner Brown Laboratory for Linguistic Information Processing (BLLIP) Brown ... 1998). The data annotated for the Ge research is used here for test- ing and development data. Also, there are many overlaps between their formulation of the problem and ours. For...

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

... bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of a peculiar characteristic of Lexicalized TAGs, i.e. that each elementary tree is associated ... perspective of linguistic information processing, because it em- ploys lexical information in a more direct way. 1. Introduction Tree Adjoining Grammars (TAGs) are a fo...

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

... derived tree (i.e. constituent tree) can be obtained. (Figure 1) 3 . Branches in a derivation tree are unordered. Moreover, linguistic constraints on the well- formedness of elementary trees ... derivation trees : 1. Prefer the derivation tree with the fewer number of nodes 2. Prefer to attach an m -tree low 6 3. Prefer the derivation tree with the fewer number of 13 -tree...

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

... induction of TSG derivations from parse trees. A derivation is information about how subtrees are combined to form parse trees. The probability distribution over initial trees is de- fined by using a Pitman-Yor ... substitution operator (shown in Fig. 1a) to combine subtrees. Subtrees for substitution are referred to as initial trees, and leaf nonterminals in initial trees are referred to as...

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