Morphological Disambiguation by Voting Constraints

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, Latex source. To appear in Proceedings of ACL/EACL'97 Compressed postscript also available as ftp://ftp.cs.bilkent.

Scientific paper

We present a constraint-based morphological disambiguation system in which individual constraints vote on matching morphological parses, and disambiguation of all the tokens in a sentence is performed at the end by selecting parses that receive the highest votes. This constraint application paradigm makes the outcome of the disambiguation independent of the rule sequence, and hence relieves the rule developer from worrying about potentially conflicting rule sequencing. Our results for disambiguating Turkish indicate that using about 500 constraint rules and some additional simple statistics, we can attain a recall of 95-96% and a precision of 94-95% with about 1.01 parses per token. Our system is implemented in Prolog and we are currently investigating an efficient implementation based on finite state transducers.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Morphological Disambiguation by Voting Constraints 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 Morphological Disambiguation by Voting Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Morphological Disambiguation by Voting Constraints will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-679160

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.