Sciweavers

135 search results - page 14 / 27
» A Deductive Approach to Dependency Parsing
Sort
View
ACL
2006
13 years 9 months ago
Trimming CFG Parse Trees for Sentence Compression Using Machine Learning Approaches
Sentence compression is a task of creating a short grammatical sentence by removing extraneous words or phrases from an original sentence while preserving its meaning. Existing me...
Yuya Unno, Takashi Ninomiya, Yusuke Miyao, Jun-ich...
ACL
2012
11 years 10 months ago
Exploiting Multiple Treebanks for Parsing with Quasi-synchronous Grammars
We present a simple and effective framework for exploiting multiple monolingual treebanks with different annotation guidelines for parsing. Several types of transformation pattern...
Zhenghua Li, Ting Liu, Wanxiang Che
JELIA
1990
Springer
13 years 11 months ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira
MT
2006
116views more  MT 2006»
13 years 7 months ago
Dependency treelet translation: the convergence of statistical and example-based machine-translation?
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...
Christopher Quirk, Arul Menezes
EMNLP
2008
13 years 9 months ago
Stacking Dependency Parsers
We explore a stacked framework for learning to predict dependency structures for natural language sentences. A typical approach in graph-based dependency parsing has been to assum...
André F. T. Martins, Dipanjan Das, Noah A. ...