Local Grammar Graph (LGG)

Local grammar Graph (LGG) formalism is one kind of formal grammars proposed by Maurice Gross (1997). There are various phenomena of shapes which are best treated by Finite-State Automata (FSA) and represented by Directed Acyclic Graphs (DAGs). Local grammar Graphs do not just catch some rare linguistic phenomena. Jargon, idioms or clichés lead to common syntactic constraints that can be described locally without resorting to more powerful syntactic formalism. A local grammar may describe a set of forbidden or unavoidable sequences as well. In both cases, it can be represented by a finite-state automaton (FSA) or a finite-state transducer (FST).

A collection of local grammars can be combined and represented by more complex finite automaton by taking the union of the simpler local grammar automata. Novel linguistic studies keep increasing the number of local grammars.

   ● Gross, M. 1997. The Construction of Local grammars. Finite-Sate Language Processing. The MIT Press.

   ● Silberztein, M. 1997. The Lexical Analysis of Natural Languages. Finite-Sate Language Processing. The MIT Press.