Constraint grammar

<p>Constraint grammar (CG) is a methodological paradigm for <a href="/facts/Natural_language_processing/1hjMKsSN">natural language processing</a> (NLP). Linguist-written, <a href="/facts/Context_(language_use)/eJM44o7x">context</a>-dependent rules are compiled into a grammar that assigns grammatical tags ("readings") to words or other tokens in running text. Typical tags address <a href="/facts/Lemmatisation/eGz6L9yE">lemmatisation</a> (<a href="/facts/Lexeme/CtHGorv4">lexeme</a> or <a href="/facts/Base_form/VwkvmJxn">base form</a>), <a href="/facts/Inflexion/mhXSXpmJ">inflexion</a>, <a href="/facts/Derivation_(linguistics)/1ED86Ao8">derivation</a>, <a href="/facts/Syntactic_function/VTrrPrVs">syntactic function</a>, dependency, <a href="/facts/Valency_(linguistics)/YzPnRwVz">valency</a>, <a href="/facts/Case_role/3oz17WKH">case roles</a>, <a href="/facts/Semantic/1L4WwLAP">semantic</a> 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.
</p><p>The CG concept was launched by <a href="/facts/Fred_Karlsson/kW8jtzSs">Fred Karlsson</a> 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 <a href="/facts/Part_of_speech/WbQ89MHX">part of speech</a> (word class) of over 99%. 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 <a href="/facts/Phrase_structure_grammar/SbzQXRFM">phrase structure grammars</a> or <a href="/facts/Dependency_grammar/cWnwcCM0">dependency grammars</a>, and a number of <a href="/facts/Treebank/7UNxE8Uw">Treebank</a> projects have used CG for automatic annotation. CG methodology has also been used in a number of language technology applications, such as <a href="/facts/Spell_checker/Dg3GUjUd">spell checkers</a> and <a href="/facts/Machine_translation/DGF3NwuI">machine translation</a> systems.
</p>

Constraint grammar open-in-new

Constraint grammar