Discontinuous grammars1,2
Verónica Dahl · Computational Intelligence · 1989
Abstract This article ties together previously scattered research on discontinuous grammars—logic grammars in which non‐explicit sequences of symbols can be alluded to in the rules and sometimes repositioned by them. After an introduction, we define them formally, present their background, and provide intuitive insight into their use. Next, we examine several motivating arguments, from both formal and natural language processing viewpoints, and we discuss the static discontinuity family of these grammars, in which (a) the nonexplicit strings are not allowed to move and (b) linguistic constraints specifically designed to suit, in particular, Government and Binding theory can be defined modularly and statically in terms of node domination in parse trees and are enforced dynamically. Finally, we discuss implementation issues, related work, and extensions.