Elimination of lexical ambiguities by grammars

We present a new, intex-compatible formalism for the description of distributional constraints, ‘elag’ (Elimination of Lexical Ambiguities by Grammars). The constraints may be checked against text, and the lexical ambiguity of the text may thus be partly resolved. We describe and exemplify the main properties of elag with the aid of simple rules, formalizing exploitable constraints. We specify in detail the effect of applying an elag rule or grammar to a text. We examine the practical properties of the formalism from the point of view of a rule writer. We describe our separate, intex-compatible evaluation procedure for the lexical disambiguation results.