640 search results - page 4 / 128 » Growing Semantic Grammars |
EACL
2003
ACL Anthology
13 years 9 months ago
2003
ACL Anthology
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
ECML
2003
Springer
14 years 28 days ago
2003
Springer
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...
ICTAI
2007
IEEE
14 years 2 months ago
2007
IEEE
Context-sensitive graph grammar construction tools have been used to develop and study interesting languages. However, the high dimensionality of graph grammars result in costly e...
MPC
2010
Springer
14 years 14 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...
DLT
2003
13 years 9 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...