Head grammar explained

Head grammar (HG) is a grammar formalism introduced in Carl Pollard (1984)^[1] as an extension of the context-free grammar class of grammars. Head grammar is therefore a type of phrase structure grammar, as opposed to a dependency grammar. The class of head grammars is a subset of the linear context-free rewriting systems.

One typical way of defining head grammars is to replace the terminal strings of CFGs with indexed terminal strings, where the index denotes the "head" word of the string. Thus, for example, a CF rule such as

A \to abc might instead be A \to (abc, 0 ) , where the 0th terminal, the a, is the head of the resulting terminal string. For convenience of notation, such a rule could be written as just the terminal string, with the head terminal denoted by some sort of mark, as in A \to \widehat{a}bc .

Two fundamental operations are then added to all rewrite rules: wrapping and concatenation.

Operations on headed strings

Wrapping

Wrapping is an operation on two headed strings defined as follows:

Let

\alpha \widehat{x} \beta and \gamma \widehat{y} \delta be terminal strings headed by x and y, respectively.w(\alpha \widehat{x} \beta, \gamma \widehat{y} \delta) = \alpha x \gamma \widehat{y} \delta \beta

Concatenation

Concatenation is a family of operations on n > 0 headed strings, defined for n = 1, 2, 3 as follows:

Let

\alpha \widehat{x} \beta , \gamma \widehat{y} \delta , and \zeta \widehat{z} η be terminal strings headed by x, y, and z, respectively.c _{1,0} (\alpha \widehat{x} \beta) = \alpha \widehat{x} \beta c _{2,0} (\alpha \widehat{x} \beta, \gamma \widehat{y} \delta) = \alpha \widehat{x} \beta \gamma y \delta c _{2,1} (\alpha \widehat{x} \beta, \gamma \widehat{y} \delta) = \alpha x \beta \gamma \widehat{y} \delta c _{3,0} (\alpha \widehat{x} \beta, \gamma \widehat{y} \delta, \zeta \widehat{z} η ) = \alpha \widehat{x} \beta \gamma y \delta \zeta z η c _{3,1} (\alpha \widehat{x} \beta, \gamma \widehat{y} \delta, \zeta \widehat{z} η ) = \alpha x \beta \gamma \widehat{y} \delta \zeta z η c _{3,2} (\alpha \widehat{x} \beta, \gamma \widehat{y} \delta, \zeta \widehat{z} η ) = \alpha x \beta \gamma y \delta \zeta \widehat{z} η

And so on for

c _{m,n} : 0 \leq n < m . One can sum up the pattern here simply as "concatenate some number of terminal strings m, with the head of string n designated as the head of the resulting string".

Form of rules

Head grammar rules are defined in terms of these two operations, with rules taking either of the forms

X \to w(\alpha, \beta) X \to c _{m,n} (\alpha, \beta, ...)

where

\alpha , \beta , ... are each either a terminal string or a non-terminal symbol.

Example

Head grammars are capable of generating the language

\{ a ^{n} b ^{n} c ^{n} d ^{n} : n \geq 0 \} . We can define the grammar as follows:S \to c _{1,0} (\widehat{\epsilon}) S \to c _{3,1} (\widehat{a}, T, \widehat{d}) T \to w(S, \widehat{b}c)

The derivation for "abcd" is thus:

S c _{3,1} (\widehat{a}, T, \widehat{d}) c _{3,1} (\widehat{a}, w(S, \widehat{b}c), \widehat{d}) c _{3,1} (\widehat{a}, w(c _{1,0} (\widehat{\epsilon}), \widehat{b}c), \widehat{d}) c _{3,1} (\widehat{a}, w(\widehat{\epsilon}, \widehat{b}c), \widehat{d}) c _{3,1} (\widehat{a}, \widehat{b}c, \widehat{d}) a\widehat{b}cd

And for "":

S c _{3,1} (\widehat{a}, T, \widehat{d}) c _{3,1} (\widehat{a}, w(S, \widehat{b}c), \widehat{d}) c _{3,1} (\widehat{a}, w(c _{3,1} (\widehat{a}, T, \widehat{d}), \widehat{b}c), \widehat{d}) c _{3,1} (\widehat{a}, w(c _{3,1} (\widehat{a}, w(S, \widehat{b}c), \widehat{d}), \widehat{b}c), \widehat{d}) c _{3,1} (\widehat{a}, w(c _{3,1} (\widehat{a}, w(c _{1,0} (\widehat{\epsilon}), \widehat{b}c), \widehat{d}), \widehat{b}c), \widehat{d}) c _{3,1} (\widehat{a}, w(c _{3,1} (\widehat{a}, w(\widehat{\epsilon}, \widehat{b}c), \widehat{d}), \widehat{b}c), \widehat{d}) c _{3,1} (\widehat{a}, w(c _{3,1} (\widehat{a}, \widehat{b}c, \widehat{d}), \widehat{b}c), \widehat{d}) c _{3,1} (\widehat{a}, w(a\widehat{b}cd, \widehat{b}c), \widehat{d}) c _{3,1} (\widehat{a}, ab\widehat{b}ccd, \widehat{d}) aab\widehat{b}ccdd

Formal properties

Equivalencies

Vijay-Shanker and Weir (1994)^[2] demonstrate that linear indexed grammars, combinatory categorial grammar, tree-adjoining grammars, and head grammars are weakly equivalent formalisms, in that they all define the same string languages.

Notes and References

1. [Carl Pollard|Pollard, C.]
2. Vijay-Shanker, K. and Weir, David J. 1994. The Equivalence of Four Extensions of Context-Free Grammars. Mathematical Systems Theory 27(6): 511-546.