Paper: Morphological Disambiguation By Voting Constraints

ACL ID P97-1029
Title Morphological Disambiguation By Voting Constraints
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1997
Authors

We present a constraint-based morpholog- ical disambiguation system in which indi- vidual constraints vote on matching mor- phological 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 applica- tion paradigm makes the outcome of the disambiguation independent of the rule se- quence, and hence relieves the rule devel- oper from worrying about potentially con- flicting rule sequencing. Our results for disambiguating Turkish indicate that using about 500 constraint rules and some addi- tional simple statistics, we can attain a re- call of 95-96~ and a precision of 94-95~ with about 1.01 parses per token. Our sys- tem is implemented in Prolog and we are currently investigating an efficient impl...