Learning Constraint Grammar-style disambiguation rules using inductive logic programming

  • Authors:
  • Nikolaj Lindberg;Martin Eineborg

  • Affiliations:
  • Centre for Speech Technology, Royal Institute of Technology, Stockholm, Sweden;Telia Research AB, Spoken Language Processing, Haninge, Sweden

  • Venue:
  • COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper reports a pilot study, in which Constraint Grammar inspired rules were learnt using the Progol machine-learning system. Rules discarding faulty readings of ambiguously tagged words were learnt for the part of speech tags of the Stockholm-Umeå Corpus. Several thousand disambiguation rules were induced. When tested on unseen data, 98% of the words retained the correct reading after tagging. However, there were ambiguities pending after tagging, on an average 1.13 tags per word. The results suggest that the Progol system can be useful for learning tagging rules of good quality.