Generalized phrase structure grammar
Generalized phrase structure grammar (GPSG) is a framework for describing the syntax and semantics of natural languages. It is a type of constraint-based phrase structure grammar. Constraint based grammars are based around defining certain syntactic processes as ungrammatical for a given language and assuming everything not thus dismissed is grammatical within that language. Phrase structure grammars base their framework on constituency relationships, seeing the words in a sentence as ranked, with some words dominating the others. For example, in the sentence "The dog runs", "runs" is seen as dominating "dog" since it is the main focus of the sentence. This view stands in contrast to dependency grammars, which base their assumed structure on the relationship between a single word in a sentence (the sentence head) and its dependents[1].
Contents
Origins[edit]
GPSG was initially developed in the late 1970s by Gerald Gazdar. Other contributors include Ewan Klein, Ivan Sag, and Geoffrey Pullum. Their book Generalized Phrase Structure Grammar, published in 1985, is the main monograph on GPSG, especially as it applies to English syntax. GPSG was in part a reaction against transformational theories of syntax. In fact, the notational extensions to context-free grammars (CFGs) developed in GPSG are claimed to make transformations redundant[2].
Goals[edit]
One of the chief goals of GPSG is to show that the syntax of natural languages can be described by CFGs (written as ID/LP grammars), with some suitable conventions intended to make writing such grammars easier for syntacticians. Among these conventions are a sophisticated feature structure system and so-called "meta-rules", which are rules generating the productions of a context-free grammar. GPSG further augments syntactic descriptions with semantic annotations that can be used to compute the compositional meaning of a sentence from its syntactic derivation tree.[3] However, it has been argued (for example by Robert Berwick) that these extensions require parsing algorithms of a higher order of computational complexity than those used for basic CFGs.
Methodology[edit]
There are several ways to represent a sentence in Generalized Phrase Structure Grammar. One such method is a Syntax tree, which represents all of the words in a sentence as leaf nodes in a parsing tree, as can be seen in the provided image. However, there are several other ways of representing sentences in GPSG. Certain constituents can be illustrated without drawing a full tree by placing the constituent in question inside of brackets like so:
Who did you say that [[Hilary was fond of ] and [Leslie despised ]].[4]
Counterarguments[edit]
Evidence soon emerged, however, that CFGs could not describe Swiss German[5], and Gazdar, along with most other syntacticians, accepted that natural languages cannot in fact be adequately described by CFGs.[6] As a result, Generalized Phrase Structure Grammar was soon abandoned as a framework for describing natural languages, although CFGs are still used in computing languages. Most of the syntactic innovations of GPSG were subsequently incorporated into head-driven phrase structure grammar.
See also[edit]
- Lexical functional grammar
- Phrase structure grammar
- Transformational grammar
- Head-driven phrase structure grammar
References[edit]
- ^ Gazdar, Gerald; Ewan H. Klein; Geoffrey K. Pullum; Ivan A. Sag (1985). Generalized Phrase Structure Grammar. Oxford: Blackwell, and Cambridge, MA: Harvard University Press. ISBN 0-674-34455-3.
- ^ Gazdar, Gerald; Ewan H. Klein; Geoffrey K. Pullum; Ivan A. Sag (1985). Generalized Phrase Structure Grammar. Oxford: Blackwell, and Cambridge, MA: Harvard University Press. ISBN 0-674-34455-3.
- ^ Ristad, Eric. "REVISED GENERALIZED PHRASE STRUCTURE GRAMMAR". aclweb.org. The Association for Computational Linguistics. Retrieved 16 December 2018.
- ^ Sag, Ivan A. (Spring 1982). "Coordination, Extraction, and Generalized Phrase Structure Grammar". Linguistic Inquiry. Vol. 13, No. 2: 329–336.
- ^ Shieber, S. M. (1985). "Evidence against the context-freeness of natural language". Linguistics and Philosophy. 8: 333–343.
- ^ Gazdar, Gerald (1988). "Applicability of Indexed Grammars to Natural Languages". doi:10.1007/978-94-009-1337-0_3.
