675 search results - page 6 / 135 » On Compression of Parse Trees |
124
click to vote
COLING
2010
14 years 11 months ago
2010
This paper proposes a dependency-driven scheme to dynamically determine the syntactic parse tree structure for tree kernel-based anaphoricity determination in coreference resoluti...
145
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Abstract. The talk focused on a grammar-based technique for identifying redundancy in program code and taking advantage of that redundancy to reduce the memory required to store an...
130
click to vote
COLING
2010
14 years 11 months ago
2010
Tree-based translation models, which exploit the linguistic syntax of source language, usually separate decoding into two steps: parsing and translation. Although this separation ...
136
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...
124
click to vote
MTPP
2010
15 years 2 months ago
2010
Abstract. The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be c...