144 search results - page 2 / 29 » Solving Regular Tree Grammar Based Constraints |
ACL
2001
13 years 6 months ago
2001
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutua...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
COLING
2010
13 years 10 days ago
2010
Surface realisation with grammars integrating flat semantics is known to be NP complete. In this paper, we present a new algorithm for surface realisation based on Feature Based T...
FOSSACS
2009
Springer
14 years 4 days ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
ACL
2001
13 years 6 months ago
2001
While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures o...