4 search results - page 1 / 1 » Bidirectional Automata for Tree Adjoining Grammars |
139
click to vote
IWPT
2001
15 years 2 months ago
2001
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
LATA
2009
Springer
15 years 7 months ago
2009
Springer
112
Voted
GRAMMARS
2000
15 years 23 days ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
104
click to vote
LRE
2008
15 years 28 days ago
2008
Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Un...