1242 search results - page 5 / 249 » The Theory of Grammar Constraints |
ACL
1998
13 years 8 months ago
1998
This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification gramma...
DLT
2003
13 years 8 months ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
IJCNLP
2005
Springer
14 years 25 days ago
2005
Springer
This paper proposes a variation of synchronous grammar based on the formalism of context-free grammar by generalizing the first component of productions that models the source text...
ICGI
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first ...
MPC
2010
Springer
14 years 3 days ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...