... 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 t
I
1
. Therefore, the
same techniques (translation models, decoder al-
gorithm, etc.) which have been developed for
SMT can be used in CAT.
Note that the statisticalmodels are defined at
word ... framework, real-time is re-
quired.
4 Phrase-based models
The usual statistical translation models can be
classified 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-assisted
translation
Jes
´
us Tom
´
as and Francisco Casacuberta
Instituto Tecnol
´
ogico de Inform
´
atica
Universidad...
... 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 of
the ... Spain
fcn@iti.upv.es
Abstract
Typically, the lexicon models used in
statistical machine translation systems
do not include any kind of linguistic
or contextual information, which often
leads to problems in performing a cor-
rect ... Refined Lexicon ModelsforStatistical Machine Translation using a
Maximum Entropy Approach
Ismael Garc
´
ıa Varea
Dpto. de Inform´atica
Univ. de Castilla-La Mancha
Campus...
... 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 improved
performance for any method. One utterance of
context is best for shift-reduce and start-join; three
is 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 the
connection path method, and 21.32 for the chunk-
based baseline. These performance differences are
statistically signicant at p ... information pertaining to
an order and information pertaining to a product.
Table 4 shows the parsing actions performed by
each 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 same
as the one used for other experiments reported in this
paper.
The results in Table 3 illustrate how the language
model performs reasonably well for ... Meeting of the ACL, pages 529–536,
Sydney, July 2006.
c
2006 Association for Computational Linguistics
Distortion ModelsForStatistical Machine Translation
Yaser Al-Onaizan and Kishore Papineni
IBM...
... 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 classical
techniques for constructing language models such as
-
gram models with ... representation of -gram lan-
guage models by WFAs whose size is practical for offline
use even in tasks with a vocabulary size of about 500,000
words 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 permission
to reuse the copyright material ... n these models are used for design
purposes, typically within a commercial simulation package. Applications in the oil and gas and chemical
sectors are emphasized but models suitable for polymers ... general thermodynamic models which can describe equally
successfully all types of phase equilibria at all conditions. Suitable modelsfor high- and low-pressure phase
equilibria for simple as well...
... unseen for a given domain s, we are already
performing an implicit form of smoothing (when
computing the expected counts), since each docu-
ment has a distribution over all topics, and therefore
we ... opposite
is true, with the LTM models achieving better per-
formance.
6
On the NIST corpus, LTM-10 again achieves the
best 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 document
level, while LTM models each sentence as a separate
document....
... 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.
c
2011 Association for Computational Linguistics
Incremental Syntactic Language Modelsfor Phrase-based ... 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 formal definition...