Abstract
This work presents some results on the application of a criterion used to compare the senses of a pair of words. A measure that involves the senses of words was used to reinforce hypothesis like hyponymy relationship between the words.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Davey, B. amp; Priestley, H.: Introduction to lattices and order, Cambridge Mathematical Textbooks, 1990.
Gelbukh, A.: Lazy query enrichment: a simple method of indexing large specialized document bases, Proc.DEXA-2000 11th Int. Conf. and Workshop on Databases and Expert Systems Applications, 2000.
Lavalle-Martínez, J.: Representación isoanalógica de objetos n-dimensionales, M.Sc. Thesis, CINVESTAV (México), 2000.
Mandala, R.; Tokunaga, T. amp; Tanaka, H.: Combining multiple evidence from different types of thesaurus, Proc. 22nd International Conference ACM-SIGIR, 191–197, 1999.
Salton, G.; Yang, C.S. amp; Yu, C.T.: A theory of term importance in automatic text analysis, Journal of American Society for Information Science, 26(1), 33–44, 1975.
Sanderson, M. amp; Croft, W.B.: Deriving concept hierarchies from text, Proc. 22nd International Conference ACM-SIGIR, 206–213, 1999.
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
Jiménez-Salazar, H. (2003). A Method of Automatic Detection of Lexical Relationships Using a Raw Corpus. 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_33
Download citation
DOI: https://doi.org/10.1007/3-540-36456-0_33
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