Ambiguity resolution in a reductionistic parser

We are concerned with dependencyoriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurallyunresolvable distinctionsin order to optimise on the accuracy of the parser, it also is beneficial for the grammarian to have as expressive a structural representation available as possible. In a reductionistic parsing system this policy may result in considerable ambiguity in the input; however, even massive ambiguity can be tackled efficiently with an accurate parsing description and effective parsing technology.

• Type: Conference
• Year: 1993
• Where: EACL
• Authors: Atro Voutilainen, Pasi Tapanainen
• Keywords: Dependencyoriented Morphosyntactic Parsing, EACL 1993, Natural Language Processing, Parsing, Parsing Grammar