Abstract
The task of disambiguation is to determine which of the senses of an ambiguous word is invoked in a particular use of the word [5],[8]. It is known that the statistical methods produce high accuracy results for semantically tagged corpora [2]. Also, Word Net is a good source of information for WSD [3],[4]. Since for Romanian language does not exist neither a corpus nor something similar with WordNet, we propose an algorithm for WSD which requires only information that can be extracted from untagged corpus. Our algorithm preserves the advantage of principles of Yarowsky [9],[7],[10] and adds the known high performance of a NBC algorithms. It learns to make predictions based on local context with only a few labeled contexts and many unlabeled ones.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Blum, T. Mitchell: Combining Labeled and Unlabeled Data with C-Training. Proceedings of the 11th Annual Conference on Computational Learning Theory (1998) 92–100
G. Escudero, L. Marquez, G. Rigau: Boosting applied to WSD. ACML, Barcelona, Spain (2000)
R. Mihalcea, D. Moldovan: An iterative Approach to WSD. Proceedings of FLAIRS (2000)
R. Mihalcea, D. Moldovan: A method for WSD of unrestricted text. Proceedings of the 37th Annual Meeting of the ACL, Maryland, NY(1999)
C. Manning, H. Schutze: Foundation of statistical natural language processing. MIT (1999)
T. Pedersen, R. Bruce: Knowledge Lean WSD. Proceedings of the Fifteenth National Conference on AI. Madison, WI (1998)
P. Resnik, D. Yarowsky: Distinguishing Systems and Distinguishing sense: new evaluation methods fot WSD. Natural Language Engineering, 1 (1998)
G. Serban, D. Tatar: A new algorithm for WSD. Studia Univ. Babes-Bolyai, Informatica. 2 (2001) 99–108
D. Yarowsky: Hierarchical Decision Lists for WSD. Kluwer Academic Publishers (1999)
David Yarowsky: Unsupervised Word Sense Disambiguation Rivaling Supervised Methods. Proceedings of ACL’95 189–196
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Şerban, G., TĂtar, D. (2003). Word Sense Disambiguation for Untagged Corpus: Application to Romanian Language. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2003. Lecture Notes in Computer Science, vol 2588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36456-0_26
Download citation
DOI: https://doi.org/10.1007/3-540-36456-0_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00532-2
Online ISBN: 978-3-540-36456-6
eBook Packages: Springer Book Archive