Tài liệu Báo cáo khoa học: "Incremental Parsing Models for Dialog Task Structure" doc

... spoken dialogs in a catalog ordering domain that has been annotated for dialog acts and task/ subtask information. We show that all these methods outperform a baseline method for recovering the dialog ... head- driven parsing method (described in (Collins, 2003)) to construct rhetorical structure trees for a spoken dialog corpus. However, their parser was 94 Dialog Task Top...

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

... new state-of-the-art semantic parsing model, propose a broader theory for tree transforma- tion based semantic parsing, and present a general inference algorithm for the tree transducer frame- work. ... a tree transformation based mapping, and (c) a tree trans- ducer that performs the mapping. volve tree transformations either between two trees or a tree and a string. The tree transduc...

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

... information are both critical for high performance. To avoid a trade- off between these two, we need to increase parsing speed, but without losing accuracy. Parsing with lexicalised grammar formalisms, such ... also used. The test data was excluded from training data for the supertagger for all of the newswire and Wikipedia models. For the biomedical models ten- 348 fold cross...

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

... June 19-24, 2011. c 2011 Association for Computational Linguistics Incremental Syntactic Language Models for Phrase-based Translation Lane Schwartz Air Force Research Laboratory Wright-Patterson ... syntactic language models score sen- tences in a similar left-to-right fashion, and are therefore a good mechanism for incorporat- ing syntax into phrase-based translation. We give a fo...

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

... dependency parsing. In Pro- ceedings of ACL. Mirella Lapata and Frank Keller. 2004. The Web as a baseline: Evaluating the performance of unsupervised Web-based models for a range of NLP tasks. In ... features into full-scale parsing systems. For dependency parsing, we augment the features in the second-order parser of McDonald and Pereira (2006). For con- stituent parsing, we rer...

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

... develop a framework for decisions made via in pipeline models, which addresses these difficulties, and presents and evaluates it in the context of bottom up dependency parsing for English. We show ... allows that use of future information in ad- dition to past information. The pipeline model nat- urally allows access to all the past information. Algorithm 3 Pseudo code for the look ah...

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

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

... We present O(n 4) parsing algorithms for two bilexical formalisms, improv- ing the prior upper bounds of O(n5). For a com- mon special case that was known to allow O(n 3) parsing (Eisner, ... having the form A + a, where A E VN, a E (VN U VT)*. If every production in P has the form A -+ BC or A + a, for A,B,C E VN,a E VT, then the grammar is said to be in Chomsky Normal Form...

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

... lexicon contains, for each word, a list of possible lexical categories, subcategorization information, and in a few cases, information on compound words. For example, the entry for round states ... the surface string (i.e., for transcripts, the orthographic string) before any syntactic proct i,~. For example, in (7), the underlined strings are expunged before parsing begins...

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

... things that might reasonably be said. Language is often too rich for the task being performed; for example it can be difficult to establish that two documents are d iscussing the same topic. Likewise no m ... creat- ing a need for techniques which compensate for this. Imagine we have a set of data stored as a matrix. Techniques based on eigen decomposi- tion allow such a matrix to be...

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