Statistical machine translation
A Lopez - ACM Computing Surveys (CSUR), 2008 - dl.acm.org
Statistical machine translation (SMT) treats the translation of natural language as a machine
learning problem. By examining many samples of human-produced translation, SMT …
learning problem. By examining many samples of human-produced translation, SMT …
Moses: Open source toolkit for statistical machine translation
We describe an open-source toolkit for statistical machine translation whose novel
contributions are (a) support for linguistically motivated factors,(b) confusion network …
contributions are (a) support for linguistically motivated factors,(b) confusion network …
Expectation-based syntactic comprehension
R Levy - Cognition, 2008 - Elsevier
This paper investigates the role of resource allocation as a source of processing difficulty in
human sentence comprehension. The paper proposes a simple information-theoretic …
human sentence comprehension. The paper proposes a simple information-theoretic …
Head-driven statistical models for natural language parsing
M Collins - Computational linguistics, 2003 - direct.mit.edu
This article describes three statistical models for natural language parsing. The models
extend methods from probabilistic context-free grammars to lexicalized grammars, leading to …
extend methods from probabilistic context-free grammars to lexicalized grammars, leading to …
[PDF][PDF] CoNLL-X shared task on multilingual dependency parsing
S Buchholz, E Marsi - Proceedings of the tenth conference on …, 2006 - aclanthology.org
Each year the Conference on Computational Natural Language Learning (CoNLL) 1
features a shared task, in which participants train and test their systems on exactly the same …
features a shared task, in which participants train and test their systems on exactly the same …
An efficient algorithm for projective dependency parsing
J Nivre - Proceedings of the eighth international conference on …, 2003 - aclanthology.org
This paper presents a deterministic parsing algorithm for projective dependency grammar.
The running time of the algorithm is linear in the length of the input string, and the …
The running time of the algorithm is linear in the length of the input string, and the …
[PDF][PDF] Non-projective dependency parsing using spanning tree algorithms
R McDonald, F Pereira, K Ribarov… - Proceedings of human …, 2005 - aclanthology.org
We formalize weighted dependency parsing as searching for maximum spanning trees
(MSTs) in directed graphs. Using this representation, the parsing algorithm of Eisner (1996) …
(MSTs) in directed graphs. Using this representation, the parsing algorithm of Eisner (1996) …
MaltParser: A language-independent system for data-driven dependency parsing
Parsing unrestricted text is useful for many language technology applications but requires
parsing methods that are both robust and efficient. MaltParser is a language-independent …
parsing methods that are both robust and efficient. MaltParser is a language-independent …
[PDF][PDF] Online large-margin training of dependency parsers
We present an effective training algorithm for linearly-scored dependency parsers that
implements online largemargin multi-class training (Crammer and Singer, 2003; Crammer et …
implements online largemargin multi-class training (Crammer and Singer, 2003; Crammer et …
[PDF][PDF] Multi-source transfer of delexicalized dependency parsers
We present a simple method for transferring dependency parsers from source languages
with labeled training data to target languages without labeled training data. We first …
with labeled training data to target languages without labeled training data. We first …