Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Bochmann (1976)
Semantic evaluation from left to rightCommun. ACM, 19
P. Deransart, J. Maluszynski (1985)
Relating Logic Programs and Attribute GrammarsJ. Log. Program., 2
L. Chirica, David Martin (1979)
An order-algebraic definition of knuthian semanticsMathematical systems theory, 13
U. Kastens, Brigitte Hutt, Erich Zimmermann (1982)
GAG: A Practical Compiler Generator, 141
Noam Chomsky (1981)
Lectures on Government and Binding
D. Yellin (1988)
Generalized attributed parsing
Fernando Pereira, D. Warren (1983)
Parsing as Deduction
G. Smolka, H. Aït-Kaci (1989)
Inheritance Hierarchies: Semantics and UnificationJ. Symb. Comput., 7
U. Kastens (1980)
Ordered attributed grammarsActa Informatica, 13
J.A. Goguen, J.W. Thatcher, E. Wagner, J. Wright (1978)
Current Trends in Programming Methodology
G. Smolka, W. Nutt, J. Goguen, J. Meseguer (1989)
Order-Sorted Equational Computation
N. Chomsky (1965)
Aspects of the Theory of Syntax
Kenneth Church, R. Patil (1982)
Coping with Syntactic Ambiguity or How to Put the Block in the Box on the TableAm. J. Comput. Linguistics, 8
C. Pollard, I. Sag (1987)
Information-Based Syntax and Semantics: Volume 1, Fundamentals
J. Stoy (1981)
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
C. Pollard, I. Sag (1987)
Information-based syntax and semantics
E. Stabler (1992)
The logical approach to syntax : foundations, specifications, and implementations of theories of government and binding
S. Shieber (1986)
An Introduction to Unification-Based Approaches to Grammar, 4
John Carroll, B. Boguraev, Claire Grover, Ted Briscoe (1988)
A development environment for large natural language grammars
M. Tomita (1987)
An Efficient Augmented-Context-Free Parsing AlgorithmComput. Linguistics, 13
Bob Carpenter (1991)
The Generative Power of Categorial Grammars and Head-Driven Phrase Structure Grammars with Lexical RulesComput. Linguistics, 17
N. Correa (1991)
An Extension of Earley’s Algorithm for S-Attributed Grammars
M. Kay (1986)
Parsing in functional unification grammar
R. Kaplan, A. Zaenen (1987)
Alternative Conceptions of Phrase Structure
Fernando Pereira, S. Shieber (1984)
The Semantics of Grammar Formalisms Seen as Computer Languages
J. Goguen, J. Thatcher, E. Wagner, J. Wright (1977)
Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM (JACM), 24
N. Correa (1987)
An Attribute-Grammar Implementation of Government-binding Theory
E. Williams (1981)
Argument Structure and Morphology, 1
W. Waite, G. Goos (1984)
Compiler Construction
Steven Abney, A. Gardiwal (1991)
In Principle Based Parsing
M. Kay (1985)
Natural Language Parsing
L. Karttunen (1984)
Features and Values
J. Siekmann (1986)
Unification theoryDecis. Support Syst., 6
J. Earley (1970)
An efficient context-free parsing algorithmCommun. ACM, 26
D. Knuth (1968)
Semantics of context-free languagesMathematical systems theory, 2
M. Jazayeri, W. Ogden, W. Rounds (1975)
The intrinsically exponential complexity of the circularity problem for attribute grammarsCommun. ACM, 18
George Heidorn (1975)
Augmented Phrase Structure Grammars
N. Correa (1988)
Syntactic analysis of english with respect to government-binding grammar
Noam Chomsky (1986)
Knowledge of Language
G. Gazdar, Ewan Klein, G. Pullum, I. Sag (1985)
Generalized Phrase Structure Grammar
(1986)
The Mental Representation of Grammatical Relations
R. Kasper (1986)
A Logical Semantics for Feature Structures
Attribute and unification grammar are syntax-directed grammatical formalisms that bear an important resemblance to each other and, especially in the case of unification grammar, enjoy certain currency as tools for linguistic description. A systematic study and comparison of the two formalisms, however, has not been reported to date. This paper reviews and compares the two formalisms, both from the point of view of their notations and expressive capabilities, and from that of their underlying algebraic semantics. The key to the semantic comparison is an algebraic formulation of the semantics of unification and the algebraic semantics of attribute grammar developed by Chirica and Martin [6]. The main result is that, from the point of view of their definitions and semantics, attribute grammar is more general than unification grammar, since it rests on a richer semantic algebra. This greater generality has important implications regarding the expressive power of the formalism and the possibility of efficient computational implementations for it. Also regarding their semantics, it is revealed that attribute grammar, unlike unification grammar, does not restrict attribute values to their basic term interpretation. This is a double-edged sword which, on the one hand, makes attribute grammar expressive and computationally efficient and, on the other, makes it computationally difficult to implement, because of the so-called “attribute evaluation problem”. For unification grammar, the noted restriction on term interpretations is at the heart of the difficulties encountered in implementing such linguistically motivated extensions to the basic formalism as negation and disjunction. The conclusion of this study is that attribute grammar is a better suited and more highly developed grammatical formalism for the description of natural and artificial languages, due to its greater generality, expressive power and, also importantly, more efficient computational implementations.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jun 23, 2006
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.