675 search results - page 37 / 135 » On Compression of Parse Trees |
EACL
1993
ACL Anthology
13 years 10 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...
TSMC
1998
13 years 8 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...
COLING
2008
13 years 10 months ago
2008
The originality of this work leads in tackling text compression using an unsupervised method, based on a deep linguistic analysis, and without resorting on a learning corpus. This...
ACL
2001
13 years 10 months ago
2001
The standard pipeline approach to semantic processing, in which sentences are morphologically and syntactically resolved to a single tree before they are interpreted, is a poor fi...
ACL
2009
13 years 6 months ago
2009
Current tree-to-tree models suffer from parsing errors as they usually use only 1best parses for rule extraction and decoding. We instead propose a forest-based tree-to-tree model...