Journal of Logic, Language and Information 4 (1):61-79 (1995)
AbstractWe present a rendering of some common grammatical formalisms in terms of evolving algebras. Though our main concern in this paper is on constraint-based formalisms, we also discuss the more basic case of context-free grammars. Our aim throughout is to highlight the use of evolving algebras as a specification tool to obtain grammar formalisms.
Similar books and articles
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars.Stephan Kepser & Jim Rogers - 2011 - Journal of Logic, Language and Information 20 (3):361-384.
Mild context-sensitivity and tuple-based generalizations of context-grammar.Annius V. Groenink - 1997 - Linguistics and Philosophy 20 (6):607-636.
Associative grammar combination operators for tree-based grammars.Yael Sygal & Shuly Wintner - 2009 - Journal of Logic, Language and Information 18 (3):293-316.
A modal perspective on the computational complexity of attribute value grammar.Patrick Blackburn & Edith Spaan - 1993 - Journal of Logic, Language and Information 2 (2):129-169.
Second-order abstract categorial grammars as hyperedge replacement grammars.Makoto Kanazawa - 2010 - Journal of Logic, Language and Information 19 (2):137-161.
Modal Logic, Transition Systems and Processes.Johan van Benthem, Jan van Eijck & Vera Stebletsova - unknown
Added to PP
Historical graph of downloads
Citations of this work
No citations found.
References found in this work
Grammar formalisms viewed as evolving algebras.David E. Johnson & Lawrence S. Moss - 1994 - Linguistics and Philosophy 17 (6):537 - 560.
Feature logics.William C. Rounds - 1997 - In Benthem & Meulen (eds.), Handbook of Logic and Language. MIT Press. pp. 475--533.
Feature Logics, Infinitary Descriptions and Grammar.William R. Keller - 1993 - School of Cognitive and Computing Sciences, University of Sussex.