Constraint Grammar

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Constraint Grammar (CG) is a methodological paradigm for natural language processing (NLP). Linguist-written, context dependent rules are compiled into a grammar that assigns grammatical tags ("readings") to words or other tokens in running text. Typical tags address lemmatisation (lexeme or base form), inflexion, derivation, syntactic function, dependency, valency, case roles, semantic type etc. Each rule either adds, removes, selects or replaces a tag or a set of grammatical tags in a given sentence context. Context conditions can be linked to any tag or tag set of any word anywhere in the sentence, either locally (defined distances) or globally (undefined distances). Context conditions in the same rule may be linked, i.e. conditioned upon each other, negated, or blocked by interfering words or tags. Typical CGs consist of thousands of rules, that are applied set-wise in progressive steps, covering ever more advanced levels of analysis. Within each level, safe rules are used before heuristic rules, and no rule is allowed to remove the last reading of a given kind, thus providing a high degree of robustness.

The Constraint Grammar concept was launched by Fred Karlsson in 1990 (Karlsson 1990; Karlsson et al., eds, 1995), and CG taggers and parsers have since been written for a large variety of languages, routinely achieving accuracy F-scores for part of speech (word class) of over 99%.[1] A number of syntactic CG systems have reported F-scores of around 95% for syntactic function labels. CG systems can be used to create full syntactic trees in other formalisms by adding small, non-terminal based phrase structure grammars or dependency grammars, and a number of Treebank projects have used Constraint Grammar for automatic annotation. CG methodology has also been used in a number of language technology applications, such as spell checkers and machine translation systems.

Implementations[edit]

The first CG implementation was CGP by Fred Karlsson. It was purely LISP-based, and the syntax was based on LISP s-expressions (Karlsson 1990). Pasi Tapanainen's CG-2 implementation mdis[2] removed some of the parentheses in the grammar format and was implemented in C++, interpreting the grammar as a finite state transducer for speed.

CG-2 was later reimplemented by the VISL group at Syddansk Universitet as the open source VISL CG [1]. This project later turned into VISL CG-3, which brought further changes and additions to the grammar format, e.g. named relations and variable-setting. Unlike the Tapanainen implementation, the VISL implementations do not use finite state transducers (rules are ordered within sections, at the cost of slower parsing).

List of Constraint Grammar systems[edit]

Free software
Non-free software

External links[edit]

References[edit]

  1. ^ For English, see for example Tapanainen and Voutilainen 1994.
  2. ^ Tapanainen, Pasi 1996: The Constraint Grammar Parser CG-2. University of Helsinki Publications No. 27.