39 search results - page 4 / 8 » Two Equivalent Regularizations for Tree Adjoining Grammars |
111
click to vote
ACL
2008
15 years 3 months ago
2008
We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel a...
131
click to vote
ACL
1992
15 years 3 months ago
1992
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
118
click to vote
ACL
1994
15 years 3 months ago
1994
This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multisetvalued feature structures in u...
SAS
2001
Springer
15 years 6 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
114
click to vote
LRE
2008
15 years 1 months 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...