675 search results - page 41 / 135 » On Compression of Parse Trees |
ACL
1996
13 years 10 months ago
1996
Many different metrics exist for evaluating parsing results, including Viterbi, Crossing Brackets Rate, Zero Crossing Brackets Rate, and several others. However, most parsing algo...
ACL
1989
13 years 10 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
ACL
2004
13 years 10 months ago
2004
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...
AUIC
2006
IEEE
14 years 2 months ago
2006
IEEE
• This paper describes techniques for visualising pairs of similar trees. Our aim is to develop ways of presenting the information so as to highlight both the common structure of...
ICDAR
2003
IEEE
14 years 2 months ago
2003
IEEE
DjVu is a document codec that uses a truncated embedded significance tree to achieve both resolution and image quality scalability. In this paper, the probability model for the t...