We describe a practical parser for unrestricted dependencies. The parser creates links between words and names the links according to their syntactic functions. We first describe the older Constraint Grammar parser where many of the ideas come from. Then we proceed to describe the central ideas of our new parser. Finally, the parser is evaluated.

No abstract

Is it possible to specify a grammatical representation (descriptors and their application guidelines) to such a degree that it can be consistently applied by di erent grammarians e.g. for producing a benchmark corpus for parser evaluation? Arguments for and against have been given, but very little empirical evidence. In this article 1 we report on a double-blind experiment with a surface-oriented morphosyntactic grammatical representation used in a large-scale English parser. We argue that a consistently applicable representation for morphology and also shallow syntax can be speci ed. A grammatical representation with a near-100% coverage of running text can be speci ed with a reasonable e ort, especially if the representation is based on structural distinctions (i.e. it is structurally resolvable).

No abstract

No abstract