Abstract
This paper reports the ongoing work of producing a state of the art part of speech tagger for unedited Swedish text. Rules eliminating faulty tags have been induced using Progol. In previously reported experiments, almost no linguistically motivated background knowledge was used [5,8]. Still, the result was rather promising (recall 97.7%, with a pending average ambiguity of 1.13 tags/word). Compared to the previous study, a much richer, more linguistically motivated, background knowledge has been supplied, consisting of examples of noun phrases, verb chains, auxiliary verbs, and sets of part of speech categories. The aim has been to create the background knowledge rapidly, without laborious hand-coding of linguistic knowledge. In addition to the new background knowledge, new, more expressive rule types have been induced for two part of speech categories and compared to the corresponding rules of the previous bottom-line experiment. The new rules perform considerably better, with a recall of 99.4% for the new rules, compared to 97.6% for the old rules. Precision was slightly better for the new rules.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Eric Brill. Some advances in transformation-based part of speech tagging. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), 1994.
Johan Carlberg and Viggo Kann. Implementing an efficient part-of-speech tagger. To appear. Available at http://www.nada.kth.se/theory/projects/granska/, 1999.
Kenneth Ward Church and Patrick Hanks. Word association norms, mutual information, and lexicography. In Proceedings from the 27th Meeting of the ACL, pages 76–83, 1989.
James Cussens. Part of speech tagging using Progol. In Proceedings of the 7th International Workshop on Inductive Logic Programming (ILP-97), pages 93–108, Prague, Czech Republic, September 1997.
Martin Eineborg and Nikolaj Lindberg. Induction of Constraint Grammar-rules using Progol. In Proceedings of The Eighth International Conference on Inductive Logic Programming (ILP’98), Madison, Wisconsin, 1998.
Eva Ejerhed, Gunnel Källgren, Wennstedt Ola, and Magnus Åström. The Linguistic Annotation System of the Stockholm-Umeá Project. Department of General Linguistics, University of Umeá, 1992.
Fred Karlsson, Atro Voutilainen, Juha Heikkilä, and Arto Anttila, editors. Constraint Grammar: A language-independent system for parsing unrestricted text. Mouton de Gruyter, Berlin and New York, 1995.
Nikolaj Lindberg and Martin Eineborg. Learning Constraint Grammar-style disambiguation rules using Inductive Logic Programming. In Proceedings of COLING/ACL’98, volume II, pages 775–779, Montreal, Canada, 1998.
Oliver Mason. QTAG—A portable probabilistic tagger. Corpus Research, The University of Birmingham, U.K., 1997.
Stephen Muggleton. Inverse entailment and Progol. New Generation Computing Journal, 13:245–286, 1995.
Daniel Ridings. SUC and the Brill tagger. GU-ISS-98-1 (Research Reports from the Department of Swedish, Göteborg University), 1998.
Christer Samuelsson, Pasi Tapanainen, and Atro Voutilainen. Inducing Constraint Grammars. In Miclet Laurent and de la Higuera Colin, editors, Grammatical Inference: Learning Syntax from Sentences, pages 146–155. Springer-Verlag, 1996.
Ashwin Srinivasan. P-Progol User and Reference Manual. http://www.comlab.ox.ac.uk/oucl/groups/machlearn/PProgol/, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lindberg, N., Eineborg, M. (1999). Improving Part of Speech Disambiguation Rules by Adding Linguistic Knowledge. In: Džeroski, S., Flach, P. (eds) Inductive Logic Programming. ILP 1999. Lecture Notes in Computer Science(), vol 1634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48751-4_18
Download citation
DOI: https://doi.org/10.1007/3-540-48751-4_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66109-2
Online ISBN: 978-3-540-48751-7
eBook Packages: Springer Book Archive