Sense and deduction: the power of peewees applied to the Senseval-2 Swedish lexical sample task

Authors:
Torbjörn Lager;Natalia Zinovjeva
Affiliations:
Uppsala University;Hapax Information Systems AB, Stockholm
Venue:
SENSEVAL '01 The Proceedings of the Second International Workshop on Evaluating Word Sense Disambiguation Systems
Year:
2001

Citing 4
Cited 0

Transformation-based error-driven learning and natural language processing: a case study in part-of-speech tagging

Computational Linguistics
Part of Speech Tagging from a Logical Point of View

LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Introduction to the special issue on word sense disambiguation: the state of the art

Computational Linguistics - Special issue on word sense disambiguation
Parsing as deduction

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes our use of Prolog Word Experts (PWEs) in the Senseval-2 competition. We explain how we specify our PWEs as sequences of transformation rules and how they can be trained on sense tagged corpus data. We give a semantics of PWEs by translating them into first order predicate logic, and we describe how PWEs can be compiled into Prolog procedures. We finally present our results for the Swedish lexical sample task: 63% (fine-grained score) for our best PWE, and a second place in the ranking.