Grammars play an important role in many Natural Language Processing (NLP) applications. The traditional approach to creating grammars manually, besides being labor-intensive, has ...
— The aim of the present work is to present a characterization of the Gentzen System G by means of a regulated grammar, according to the Formal Languages Theory. Given a proposit...
Ruben Monjaraz Hernandez-Imbert, Jose de Jesus Lav...
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
Filip Ginter, Sampo Pyysalo, Jorma Boberg, Tapio S...
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 ...
Tim Oates, Tom Armstrong, Justin Harris, Mark Nejm...