555 search results - page 6 / 111 » Decompositions of Grammar Constraints |
ACL
1997
13 years 8 months ago
1997
We introduce a typed feature logic system providing both universal implicational principles as well as definite clauses over feature terms. We show that such an architecture suppo...
ACL
2000
13 years 8 months ago
2000
We present a new approach to stochastic modeling of constraintbased grammars that is based on loglinear models and uses EM for estimation from unannotated data. The techniques are...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
We propose a parser for constraintlogic grammars implementing HPSG that combines the advantages of dynamic bottom-up and advanced topdown control. The parser allows the user to ap...
FOSSACS
2009
Springer
14 years 2 months 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...