Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Unification Grammars

View through CrossRef
Grammars of natural languages can be expressed as mathematical objects, similar to computer programs. Such a formal presentation of grammars facilitates mathematical reasoning with grammars (and the languages they denote), as well as computational implementation of grammar processors. This book presents one of the most commonly used grammatical formalisms, Unification Grammars, which underlies contemporary linguistic theories such as Lexical-Functional Grammar (LFG) and Head-driven Phrase Structure Grammar (HPSG). The book provides a robust and rigorous exposition of the formalism that is both mathematically well-founded and linguistically motivated. While the material is presented formally, and much of the text is mathematically oriented, a core chapter of the book addresses linguistic applications and the implementation of several linguistic insights in unification grammars. Dozens of examples and numerous exercises (many with solutions) illustrate key points. Graduate students and researchers in both computer science and linguistics will find this book a valuable resource.
Cambridge University Press
Title: Unification Grammars
Description:
Grammars of natural languages can be expressed as mathematical objects, similar to computer programs.
Such a formal presentation of grammars facilitates mathematical reasoning with grammars (and the languages they denote), as well as computational implementation of grammar processors.
This book presents one of the most commonly used grammatical formalisms, Unification Grammars, which underlies contemporary linguistic theories such as Lexical-Functional Grammar (LFG) and Head-driven Phrase Structure Grammar (HPSG).
The book provides a robust and rigorous exposition of the formalism that is both mathematically well-founded and linguistically motivated.
While the material is presented formally, and much of the text is mathematically oriented, a core chapter of the book addresses linguistic applications and the implementation of several linguistic insights in unification grammars.
Dozens of examples and numerous exercises (many with solutions) illustrate key points.
Graduate students and researchers in both computer science and linguistics will find this book a valuable resource.

Related Results

Evolutionary Grammatical Inference
Evolutionary Grammatical Inference
Grammatical Inference (also known as grammar induction) is the problem of learning a grammar for a language from a set of examples. In a broad sense, some data is presented to the ...
ON A SUPERCLASS OF A-GRAMMARS
ON A SUPERCLASS OF A-GRAMMARS
In this paper we consider a superclass of automaton grammars that can be represented in terms of paths on graphs. With this approach, we assume that vertices of graph are labeled b...
Remote attribute grammars
Remote attribute grammars
Describing the static semantics of programming languages with attribute grammars is eased when the formalism allows direct dependencies to be induced between rules for nodes arbitr...
Chomsky, Noam (1928–)
Chomsky, Noam (1928–)
Fish swim, birds fly, people talk. The talents displayed by fish and birds rest on specific biological structures whose intricate detail is attributable to genetic endowment. Human...
Chomsky, Noam (1928–)
Chomsky, Noam (1928–)
Fish swim, birds fly, people talk. The talents displayed by fish and birds rest on specific biological structures whose intricate detail is attributable to genetic endowment. Human...
Descriptive Linguistics
Descriptive Linguistics
AbstractWhen people who are not linguists consult a grammar book, it is usually because they want to find out the correct way of expressing something. This is the kind of informati...
Noncanonical SLR(1) Grammars
Noncanonical SLR(1) Grammars
Two noncanonical extensions of the simple LR(1) (SLR(1)) method are presented, which reduce not only handles but also other phrases of sentential forms. A class of context-free gra...

Back to Top