Parsing Swedish

CG is a reductionistic constraint rule formalism whose input is lexically analysed ambiguous text and whose output is disambiguated text. Disambiguation is carried out by constraints on lemmas and tags that discard alternative analyses on the basis of contextual information, typically coded by a linguist. The ENGCG morphosyntactic tagger was introduced in 1992 (Voutilainen & al.) and compared with a state-of-the-art statistical tagger in 1997 (Samuelsson & Voutilainen). CG was successful in word-class tagging but not adequate for full-scale parsing. A considerable effort on finite-state parsing was made by Koskenniemi, Tapanainen and Voutilainen (see their articles in Roche & Schabes, eds., 1997). A more successful effort was made by Tapanainen and Järvinen, who extended CG into a functional dependency grammar formalism and interpreter/compiler capable of introducing explicit functional dependencies and of applying large grammars efficiently.