Equivalence (formal languages)

In formal language theory, weak equivalence of two grammars means they generate the same set of strings, i.e. that the formal language they generate is the same. In compiler theory, where only context-free grammars are considered, weak equivalence is distinguished from strong (or structural) equivalence, which additionally means that the two parse trees are reasonably similar in that the same semantic interpretation can be assigned to both.

Two grammar formalisims are weakly equivalent if they define the same set of string languages. This notion is an instance of weak equivalence in homotopy theory. Vijay-Shanker and Weir (1994) demonstrated that linear indexed grammars, combinatory categorial grammars, tree-adjoining grammars, and head grammars are weakly equivalent formalisms in that meaning.

On the other hand, if two grammars generate the same set of derivation trees (or more generally, the same set of abstract syntactic objects), then the two grammars are strongly equivalent. Chomsky (1963) introduces the notion of strong equivalence, and argues that only strong equivalence is relevant when comparing grammar formalisms. Kornai and Pullum (1990) and Miller (1994) offer a refined notion of strong equivalence that allows for isomorphic relationships between the syntactic analyses given by different formalisms. Yoshinaga, Miyao, and Tsujii (2002) offers a proof that for any LTAG formalism, there is a strongly equivalent HPSG one.