The integration of multiword expressions in a parsing procedure has been shown to improve accuracy in an artiļ¬cial context where such expressions have been perfectly pre-identiļ...
Matthieu Constant, Anthony Sigogne, Patrick Watrin
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
Context-free grammars cannot be identiļ¬ed in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...
Tim Oates, Tom Armstrong, Justin Harris, Mark Nejm...
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...