Ambiguity resolution in a reductionistic parser

Details Ambiguity resolution in a reductionistic parser Ambiguity resolution in a reductionistic parser

1995-02-13

arxiv.org/abs/cmp-lg/9502013v1

Computer Science

Computation and Language

EACL93, .ps

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Ambiguity resolution in a reductionistic parser does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ambiguity resolution in a reductionistic parser, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ambiguity resolution in a reductionistic parser will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-531476