675 search results - page 9 / 135 » On Compression of Parse Trees |
102
click to vote
WIA
2005
Springer
15 years 9 months ago
2005
Springer
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
129
Voted
ICITA
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper proposes the use of a crossbar-like tree structure to use with Dynamic Markov Compression (DMC) for the compression of Chinese text files. DMC had previously been found...
106
click to vote
ACL
2010
15 years 2 months ago
2010
Nivre's method was improved by enhancing deterministic dependency parsing through application of a tree-based model. The model considers all words necessary for selection of ...
135
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
137
click to vote
ANLP
1992
15 years 5 months ago
1992
The availability of large files of manuallyreviewed parse trees from the University of Pennsylvania "tree bank", along with a program for comparing system-generated pars...