77 search results - page 7 / 16 » Evaluation of Dependency Parsers on Unbounded Dependencies |
NAACL
2010
14 years 7 months ago
2010
In a supertagging task, sequence labeling models are commonly used. But their limited ability to model long-distance information presents a bottleneck to make further improvements...
MT
2006
14 years 9 months ago
2006
We describe a novel approach to machine translation that combines the strengths of the two leading corpus-based approaches: Phrasal SMT and EBMT. We use a syntactically informed d...
ACL
2011
14 years 1 months ago
2011
Most previous studies of morphological disambiguation and dependency parsing have been pursued independently. Morphological taggers operate on n-grams and do not take into account...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
EMNLP
2004
14 years 11 months ago
2004
We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, c...