621 search results - page 35 / 125 » Parsing As Tree Traversal |
152
click to vote
COLING
2010
15 years 22 days ago
2010
In this paper we present a novel phrase structure parsing approach with the help of dependency structure. Different with existing phrase parsers, in our approach the inference pro...
124
click to vote
ACL
2001
15 years 7 months ago
2001
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation langu...
149
click to vote
COLING
2000
15 years 7 months ago
2000
Common wisdom has it that tile bias of stochastic grammars in favor of shorter deriwttions of a sentence is hamfful and should be redressed. We show that the common wisdom is wron...
143
click to vote
EACL
1993
ACL Anthology
15 years 7 months ago
1993
ACL Anthology
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
136
click to vote
TSMC
1998
15 years 5 months ago
1998
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...