Sciweavers

675 search results - page 6 / 135
» On Compression of Parse Trees
Sort
View
COLING
2010
13 years 2 months ago
Dependency-driven Anaphoricity Determination for Coreference Resolution
This paper proposes a dependency-driven scheme to dynamically determine the syntactic parse tree structure for tree kernel-based anaphoricity determination in coreference resoluti...
Fang Kong, Guodong Zhou, Longhua Qian, Qiaoming Zh...
DAGSTUHL
2006
13 years 8 months ago
Program Compression
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...
William S. Evans
COLING
2010
13 years 2 months ago
Joint Parsing and Translation
Tree-based translation models, which exploit the linguistic syntax of source language, usually separate decoding into two steps: parsing and translation. Although this separation ...
Yang Liu, Qun Liu
ECML
2007
Springer
14 years 1 months ago
Probabilistic Models for Action-Based Chinese Dependency Parsing
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...
Xiangyu Duan, Jun Zhao, Bo Xu
MTPP
2010
13 years 5 months ago
A Fast General Parser for Automatic Code Generation
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...
Wuu Yang