... Language Pars- ing as Statistical Pattern Recognition. Doctoral dissertation. Stanford University, Stanford, Cali- fornia. 283 Statistical Decision-Tree Modelsfor Parsing* David M. Magerman ... and in some cases long-distance structural information is also needed. Statisticalmodelsfor 282 root - the node is the root of the tree. For an n word sentence, a parse tree has n leaf ... questions. For more discussion of the use of binary decision-tree questions, see (Magerman, 1994). 3 SPATTER Parsing The SPATTER parsing algorithm is based on inter- preting parsing as a statistical...
... sentences tI1. Therefore, thesame techniques (translation models, decoder al-gorithm, etc.) which have been developed for SMT can be used in CAT.Note that the statisticalmodels are defined atword ... framework, real-time is re-quired.4 Phrase-based models The usual statistical translation models can beclassified as single-word based alignment models. Models of this kind assume that an input word ... Association for Computational Linguistics Statistical phrase-based modelsfor interactive computer-assistedtranslationJes´us Tom´as and Francisco CasacubertaInstituto Tecnol´ogico de Inform´aticaUniversidad...
... language.Those lexicon models lack from context infor-mation that can be extracted from the same paral-lel corpus. This additional information could be:Simple context information: information ofthe ... Spainfcn@iti.upv.esAbstractTypically, the lexicon models used in statistical machine translation systemsdo not include any kind of linguisticor contextual information, which oftenleads to problems in performing a cor-rect ... Refined Lexicon ModelsforStatistical Machine Translation using aMaximum Entropy ApproachIsmael Garc´ıa VareaDpto. de Inform´aticaUniv. de Castilla-La ManchaCampus...
... describe a technique for estimat- ing the parameters for this model using decision trees. The history-based grammar model provides a mechanism for taking advantage of contextual information from ... h Grammar and parse tree for aabb. dexed the non-terminal (NT) nodes of the tree with this leftmost order. We denote by ~- the sen- tential form obtained just before we expand node i. Hence, ... rewriting the non- terminal AT/. 32 Towards History-based Grammars: Using Richer Modelsfor Probabilistic Parsing* Ezra Black Fred Jelinek John Lafferty David M. Magerman Robert Mercer Salim...
... to improvedperformance for any method. One utterance ofcontext is best for shift-reduce and start-join; threeis best for the connection path method. The shift-reduce method performs the best. ... 47.86, as com-pared with 34.91 for start-complete, 25.13 for theconnection path method, and 21.32 for the chunk-based baseline. These performance differences arestatistically signicant at p ... information pertaining toan order and information pertaining to a product.Table 4 shows the parsing actions performed byeach of our methods on the dialog snippet pre-sented in Figure 4. For...
... May 27 – June 1. Association for Computational Linguistics.Philipp Koehn. 2004. Pharaoh: a Beam Search De-coder for Phrase-Based Statistical Machine Trans-lation Models. In Proceedings of the ... for the experiments reported here is the sameas the one used for other experiments reported in thispaper.The results in Table 3 illustrate how the languagemodel performs reasonably well for ... Meeting of the ACL, pages 529–536,Sydney, July 2006.c2006 Association for Computational LinguisticsDistortion ModelsForStatistical Machine TranslationYaser Al-Onaizan and Kishore PapineniIBM...
... finding all for a given is . Therefore,the total cost is . For all non-empty , we create a new state and for all we set . We create a transition, and for all such that ,we set . For all such ... with other in-formation sources to rank alternative hypotheses by as-signing them some probabilities. There are classicaltechniques for constructing language models such as-gram models with ... representation of -gram lan-guage models by WFAs whose size is practical for offlineuse even in tasks with a vocabulary size of about 500,000words and for .Class-based models. In many applications,...
... of models should be based on the 3D thermo-hydrodynamical modelsfor each particular environment that contains interested matter. Development of system of hydrodynamic-environmental modelsfor ... need to build a system of modelsfor each environment which is related to each other through the boundary conditions. In this case, we can introduce the system of modelsfor oil slick, oil-in-water ... (2003). 3. Model for suspended particulate matter transport and bottom bathymetry evolution The model for SPM and bottom bathymetry evolution includes 2 sub -models: 3D SPM Model for water column...
... Chichester, West Sussex, PO19 8SQ, United Kingdom For details of our global editorial offices, for customer services and for information about how to apply for permissionto reuse the copyright material ... n these models are used for designpurposes, typically within a commercial simulation package. Applications in the oil and gas and chemicalsectors are emphasized but models suitable for polymers ... general thermodynamic models which can describe equallysuccessfully all types of phase equilibria at all conditions. Suitable modelsfor high- and low-pressure phaseequilibria for simple as well...
... unseen for a given domain s, we are alreadyperforming an implicit form of smoothing (whencomputing the expected counts), since each docu-ment has a distribution over all topics, and thereforewe ... oppositeis true, with the LTM models achieving better per-formance.6On the NIST corpus, LTM-10 again achieves thebest gain of approximately 1 BLEU and up to 3 TER.LTM performs on par with or better ... consistent within a document.Results Results for both settings are shown in Ta-ble 2. GTM models the latent topics at the documentlevel, while LTM models each sentence as a separatedocument....
... Yamada.2003. Syntax-based language modelsfor statistical machine translation. In Proceedings of the Ninth Ma-chine Translation Summit of the International Associ-ation for Machine Translation.Ciprian ... Association for Computational Linguistics, pages 620–631,Portland, Oregon, June 19-24, 2011.c2011 Association for Computational LinguisticsIncremental Syntactic Language Modelsfor Phrase-based ... syntactic language models score sen-tences in a similar left-to-right fashion, and aretherefore a good mechanism for incorporat-ing syntax into phrase-based translation. Wegive a formal definition...