Abstract
Assigning a category to a given word (tagging) depends on the particular word and on the categories (tags) of neighboring words. A theory that is able to assign tags to a given text can naturally be viewed as a recursive logic program. This article describes how iterative induction, a technique that has been proven powerful in the synthesis of recursive logic programs, has been applied to the task of part-of-speech tagging. The main strategy consists of inducing a succession T1, T2, ..., Tn of theories, using in the induction of theory Ti all the previously induced theories. Each theory in the sequence may have lexical rules, context rules and hybrid ones. This iterative strategy is, to a large extent, independent of the inductive algorithm underneath. Here we consider one particular relational learning algorithm, CSC(RC), and we induce first order theories from positive examples and background knowledge that are able to successfully tag a relatively large corpus in Portuguese.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Inkeri Verkamo, A. Fast Discovery of Association Rules. Advances in Knowledge Discovery and Data Mining: 307–328. 1996.
Cussens, J.. Part of Speech Tagging Using Progol. In Inductive Logic Programming. Proceedings of the 7th International Workshop (ILP-97). LNAI 1297, p 93–108, Springer, 1997.
Cussens, J.; Dzeroski, S.; Erjavec, T.: Morphosyntatic Tagging of Slovene Using Progol. Proceedings of the 9th Int. Workshop on Inductive Logic Programming (ILP-99). Dzeroski, S. and Flach, P. (Eds). LNAI 1634, 1999.
Dehaspe, L. De Raedt, L. Mining Association Rules in Multiple Relations. Proceedings of the 7th International Workshop (ILP-97). LNAI 1297: 125–132. 1997.
Horváth, T.; Alexin, Z.; Gyimóthy, T.; Wrobel, S.: Application of Different Learning Methods to Hungarian Part-of-Speech Tagging. Proceedings of the 9th Int. Workshop on Inductive Logic Programming (ILP-99). Dzeroski, S. and Flach, P. (Eds). LNAI 1634, 1999.
Jorge, A. Iterative Induction of Logic Programs: an approach to logic program synthesis from incomplete specifications. Ph.D. thesis. University of Porto, 1998.
Jorge, A., Brazdil, P. Architecture for Iterative Learning of Recursive Definitions. Advances in Inductive Logic Programming, De Raedt, L. (Ed), IOS Press, 1996.
Lindberg, N; Eineborg, M: Improving Part-of-Speech Disambiguation Rules by Adding Linguistic Knowledge. Proceedings of the 9th Int. Workshop on Inductive Logic Programming (ILP-99). Dzeroski, S. and Flach, P. (Eds). LNAI 1634, 1999.
Liu, B., Hsu, W., Ma, Y. Integrating Classification and Association Rule Mining. In Proceedings of KDD 1998: 80–86. 1998.
Lopes, A., Brazdil, P. Redundant Covering with Global Evaluation in the RC1 Inductive Learner. Advances in Artificial Intelligence, 14th Brazilian Symposium on Artificial Intelligence, SBIA ’98. LNAI 1515, Springer Verlag, 1998.
Lopes, A. Using Inductive Learning in Case-Based Reasoning (in Portuguese). Proceedings of Brazilian Symposium on Artificial Intelligence-SBIA 96(student session), 1996.
Mooney, R. J. Induction of First-order Decision Lists: Results on Learning the Past Tense of English Verbs. Journal of Artificial Intelligence Research 3, pp. 1–24, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jorge, A., de Andrade Lopes, A. (2000). Iterative Part-of-Speech Tagging. In: Cussens, J., Džeroski, S. (eds) Learning Language in Logic. LLL 1999. Lecture Notes in Computer Science(), vol 1925. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40030-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-40030-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41145-1
Online ISBN: 978-3-540-40030-1
eBook Packages: Springer Book Archive