Báo cáo khoa học: "Immediate-Head Parsing for Language Models£" potx

... 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, ... be necessary for Ha itself to accept a formal language such as {(b n, c n) : n > 0}, where word a takes 2n de- pendents, but we know of no natural -language motivation for eve...

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

... contain the acoustic models, language model and lexicon, but the LM makes up for most of the size. The availability of data varies for the different languages, and therefore the FST sizes are not ... rates were 17.0 for En- glish, 18.7 for Spanish, and 22.5 for French. For English, we also created web mixture mod- els with KN smoothing. The error rates were 16.5, 15.9 and 15.7...

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

... completeness of parsing are proved. INTRODUCTION Our aim is twofold. First to provide a linguistical- ly well motivated categorial grammar for French (henceforth, FG) which accounts for word order ... precompiled before parsing and the number of rules increases rapidly or LP statements are checked on the fly during parsing thus slowing down proces- sing. 2. THE GRAMMAR The...

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

... translator is imagined to use in converting a sentence from one language (the input language) into a new language (the output language) . This process is assumed to consist of (1) transferring ... available for coding the incoming text for insertion into the machine and, after the translation process is completed, for decoding and printing the translation in the output lan...

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

... disambiguation. However, an uncom- pressed language model is usually too large for practical use since all realistic applications have memory constraints. Therefore, language model pruning techniques ... baseline method, we obtain models that achieve better performance for any model size. Correlation between language model perplexity and system performance is also discussed....

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

... attempt to develop a probabilistic full parsing model for Ger- man trained on a treebank (to our knowledge). Lexicalization can increase parsing performance dramatically for English (Carroll and Rooth, ... to contain more rules than for a fixed wordorder language. For tran- sitive verbs, for instance, we need the rules S → VNPNP,S→ NP V NP, and S → NP NP V to account for verb...

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

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

... 2006. c 2006 Association for Computational Linguistics Hybrid Parsing: Using Probabilistic Models as Predictors for a Symbolic Parser Kilian A. Foth, Wolfgang Menzel Department of Informatics Universit¨at ... based priorities for fur- ther improving them. We are able to show that the potential of WCDG for information fusion is strong enough to accomodate even rather unreli- able in...

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

... that using written language data for mod- elling spoken language can improve performance. We turn to three other bodies of text and investi- gate the use of these corpora for our task, disfluency detection. ... incorporate information from the external language models by defining a reranker feature for each external language model. The value of this feature is the log probability...

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

... April 2009. c 2009 Association for Computational Linguistics Unsupervised Methods for Head Assignments Federico Sangati, Willem Zuidema Institute for Logic, Language and Computation University ... 1999). With the increased popularity of dependency parsing, head annota- tions have also become a crucial level of syntac- tic information for transforming constituency tree- banks to de...

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