Sciweavers

656 search results - page 45 / 132
» Marrying Words and Trees
Sort
View
EMNLP
2011
13 years 11 months ago
Quasi-Synchronous Phrase Dependency Grammars for Machine Translation
We present a quasi-synchronous dependency grammar (Smith and Eisner, 2006) for machine translation in which the leaves of the tree are phrases rather than words as in previous wor...
Kevin Gimpel, Noah A. Smith
ACL
2004
15 years 1 months ago
Deep Dependencies from Context-Free Statistical Parsers: Correcting the Surface Dependency Approximation
We present a linguistically-motivated algorithm for reconstructing nonlocal dependency in broad-coverage context-free parse trees derived from treebanks. We use an algorithm based...
Roger Levy, Christopher D. Manning
CAD
2008
Springer
14 years 12 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
IANDC
2007
126views more  IANDC 2007»
14 years 11 months ago
Alternating two-way AC-tree automata
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
Kumar Neeraj Verma, Jean Goubault-Larrecq
JCB
2007
92views more  JCB 2007»
14 years 11 months ago
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances
Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical consider...
Ilan Gronau, Shlomo Moran