Ambiguity resolution in a reductionistic parser

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We are concerned with dependency-oriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurally unresolvable distinctions in 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.
EACL93, .ps

Keywords

Computation and Language

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/151130

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cmp-lg/9502013
 http://arxiv.org/abs/cmp-lg/9502013

Collections

arXiv