- Discontinuous-constituent phrase structure grammar
-
Discontinuous-constituent Phrase Structure Grammar (DCPSG) (distinct from Discontinuous Phrase Structure Grammar/DPSG) is a formalism for describing discontinuous phrase structures in natural language, such as verb phrases in VSO languages. The formalism was introduced in the slightly more constrained form of Discontinuous-constituent Phrase Structure Grammar with Subscripts and Deletes (DCPSGsd) in Harman (1963)[1]. DCPSGs describe a superset of the context-free languages, by means of rewrite rules that permit a limited amount of wrapping, similar to that found in Head grammar.
Contents
Description
Rewrite rules of a DCPSG are identical to those of a CFG, with the addition of a meta-symbol, denoted here as an underscore. DCPSG rules therefore have the general form where α is a string of terminal symbols and/or non-terminal symbols and at most one underscore.
The rewrite semantics of DCPSG are identical as those of a CFG when the rule being used does not contain an underscore: given a rule , an occurrence of X may be rewritten as α.
For rules with an underscore, the rewrite semantics are slightly different: given a rule , an occurrence of X can be rewritten as α, with β being inserted immediately after the next non-terminal that is introduced at the same time. Using strict left-most productions, β is simply inserted immediately after the non-terminal that follows X prior to the rewrite.
Example
We can characterize the gross sentence structure of a VSO language such as Irish with the following rules (substituting English words for Irish words, and using subscripts solely for demonstration of discontinuity):
A derivation for the sentence saw John Susan, where John is the subject, and Susan is the direct object forming a VP with saw is:
References
- ^ Harman, Gilbert H. 1963. Generative Grammars without Transformation Rules: A Defense of Phrase Structure. Language 39(4), 597-616.
Automata theory: formal languages and formal grammars Chomsky hierarchy Type-0—Type-1———Type-2——Type-3—Grammars (no common name)Linear context-free rewriting systems etc.Tree-adjoining etc.—Languages Minimal automaton Thread automataEach category of languages is a proper subset of the category directly above it. - Any automaton and any grammar in each category has an equivalent automaton or grammar in the category directly above it. Categories:- Formal languages
- Grammar frameworks
Wikimedia Foundation. 2010.