Sciweavers

ACL
2009
13 years 9 months ago
Quadratic-Time Dependency Parsing for Machine Translation
Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
Michel Galley, Christopher D. Manning
ACL
2009
13 years 9 months ago
Topological Field Parsing of German
Freer-word-order languages such as German exhibit linguistic phenomena that present unique challenges to traditional CFG parsing. Such phenomena produce discontinuous constituents...
Jackie Chi Kit Cheung, Gerald Penn
ACL
2009
13 years 9 months ago
Exploiting Heterogeneous Treebanks for Parsing
We address the issue of using heterogeneous treebanks for parsing by breaking it down into two sub-problems, converting grammar formalisms of the treebanks to the same one, and pa...
Zheng-Yu Niu, Haifeng Wang, Hua Wu
ACL
2009
13 years 9 months ago
K-Best A* Parsing
A parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing kbest extraction methods can efficiently search for top derivations, but only after an exhau...
Adam Pauls, Dan Klein
NAACL
2010
13 years 9 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
NAACL
2010
13 years 9 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
NAACL
2010
13 years 9 months ago
Joint Parsing and Alignment with Weakly Synchronized Grammars
Syntactic machine translation systems extract rules from bilingual, word-aligned, syntactically parsed text, but current systems for parsing and word alignment are at best cascade...
David Burkett, John Blitzer, Dan Klein
MTPP
2010
13 years 9 months ago
A Fast General Parser for Automatic Code Generation
Abstract. The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be c...
Wuu Yang
ISDA
2010
IEEE
13 years 9 months ago
Improving statistical parsing by linguistic regularization
Statistically-based parsers for large corpora, in particular the Penn Tree Bank (PTB), typically have not used all the linguistic information encoded in the annotated trees on whic...
Igor Malioutov, Robert C. Berwick
EMNLP
2010
13 years 9 months ago
It Depends on the Translation: Unsupervised Dependency Parsing via Word Alignment
We reveal a previously unnoticed connection between dependency parsing and statistical machine translation (SMT), by formulating the dependency parsing task as a problem of word a...
Samuel Brody