675 search results - page 49 / 135 » On Compression of Parse Trees |
ACL
2009
13 years 6 months ago
2009
Tree substitution grammars (TSGs) offer many advantages over context-free grammars (CFGs), but are hard to learn. Past approaches have resorted to heuristics. In this paper, we le...
ICIAR
2005
Springer
14 years 2 months ago
2005
Springer
Concavity trees have been known for quite some time as structural descriptors of 2-D shape; however, they haven’t been explored further until recently. This paper shows how 2-D s...
EMNLP
2007
13 years 10 months ago
2007
This paper presents a tree-to-tree transduction method for text rewriting. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of...
ACL
2010
13 years 6 months ago
2010
This paper proposes a method of correcting annotation errors in a treebank. By using a synchronous grammar, the method transforms parse trees containing annotation errors into the...
CSL
2003
Springer
14 years 2 months ago
2003
Springer
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...