675 search results - page 5 / 135 » On Compression of Parse Trees |
NAACL
2001
13 years 8 months ago
2001
We propose a novel Co-Training method for statistical parsing. The algorithm takes as input a small corpus (9695 sentences) annotated with parse trees, a dictionary of possible le...
DCC
1999
IEEE
13 years 11 months ago
1999
IEEE
We report on the performance evaluation of greedy parsing with a single step lookahead, denoted as flexible parsing. We also introduce a new fingerprint based data structure which...
COLING
2008
13 years 9 months ago
2008
Most data-driven dependency parsing approaches assume that sentence structure is represented as trees. Although trees have several desirable properties from both computational and...
ACL
1996
13 years 8 months ago
1996
This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modi cations to the inp...
KAIS
2006
13 years 7 months ago
2006
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...