Ambiguity resolution in a reductionistic parser

Simple item page
dc.creatorVoutilainen, Atro
dc.creatorTapanainen, Pasi
dc.date1995-02-13
dc.date.accessioned2026-07-07T09:09:42Z
dc.date.available2026-07-07T09:09:42Z
dc.descriptionWe 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.
dc.descriptionEACL93, .ps
dc.identifierhttps://arxiv.org/abs/cmp-lg/9502013
dc.identifierhttp://arxiv.org/abs/cmp-lg/9502013
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151130
dc.subjectComputation and Language
dc.titleAmbiguity resolution in a reductionistic parser
dc.typetext

Files

Collections

arXiv