555 search results - page 7 / 111 » Decompositions of Grammar Constraints |
ACL
1998
13 years 8 months ago
1998
This paper reports a pilot study, in which Constraint Grammar inspiredruleswere learnt using the Progol machine-learning system. Rules discarding faulty readings of ambiguously ta...
CAD
2006
Springer
13 years 7 months ago
2006
Springer
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...
JSAI
2005
Springer
14 years 26 days ago
2005
Springer
This paper presents a proposal for the integration of information structure in a unification-based grammar of Danish. Three information structure features – topic, focus and bac...
COLING
2000
13 years 8 months ago
2000
We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...
GRAMMARS
2000
13 years 7 months ago
2000
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...