675 search results - page 43 / 135 » On Compression of Parse Trees |
ISPASS
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper we study the properties of a new packet trace compression method based on clustering of TCP flows. With our proposed method, the compression ratio that we achieve i...
NAACL
2010
13 years 6 months ago
2010
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
ACL
2009
13 years 6 months ago
2009
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
ISDA
2010
IEEE
13 years 6 months ago
2010
IEEE
Statistically-based parsers for large corpora, in particular the Penn Tree Bank (PTB), typically have not used all the linguistic information encoded in the annotated trees on whic...
EMNLP
2010
13 years 6 months ago
2010
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...