Sciweavers

621 search results - page 7 / 125
» Parsing As Tree Traversal
Sort
View
ECML
2007
Springer
14 years 2 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
COLING
2010
13 years 3 months ago
Comparing the performance of two TAG-based surface realisers using controlled grammar traversal
We present GENSEM, a tool for generating input semantic representations for two sentence generators based on the same reversible Tree Adjoining Grammar. We then show how GENSEM ca...
Claire Gardent, Benjamin Gottesman, Laura Perez-Be...
GRAPHICSINTERFACE
2000
13 years 10 months ago
Dynamic Plane Shifting BSP Traversal
Interactive 3D applications require fast detection of objects colliding with the environment. One popular method for fast collision detection is to offset the geometry of the envi...
Stan Melax
MTPP
2010
13 years 6 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
EACL
1993
ACL Anthology
13 years 10 months ago
The Use of Shared Forests in Tree Adjoining Grammar Parsing
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...
K. Vijay-Shanker