Abstract
Calculating similarity measures between schema concept terms has turned out to be an essential task in our requirements engineering research. The reason is that automatic integration of source texts and terms in the requirements engineering domain presupposes decisions about the similarity and the conflict potential of linguistic units, i.e. by default words. After shortly discussing several WordNet based similarity measures, we propose the Lesk algorithm as the most suitable choice for the integration task. Our test results show that both the Lesk algorithm and the underlying lexicon (i.e. WordNet) can be optimized for engineering purposes. We describe in detail how Lesk and WordNet can be applied for term conflict recognition and resolution during the engineering workflow.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bellström P, Vöhringer J (2009) Towards the automation of modeling language independent schema integration. In: International conference on information, process, and knowledge management, eKnow 2009, Cancun, Mexico, pp 110–115
Budanitsky A, Hirst G (2001) Semantic distance in WordNet: an experimental, application-oriented evaluation of five measures. In: Workshop on WordNet and other lexical resources, 2nd meeting of the North American chapter of the Association for Computational Linguistics, Pittsburgh
Banerjee S., Pederson T (2002) An adapted Lesk algorithm for word sense disambiguation using WordNet. In: Proceedings of the 3rd international conference on intelligent text processing and computational linguistics, Tokyo, Japan, pp 136–145
Fliedl G, Kop C, Vöhringer J (2008) Guideline based evaluation and verbalization of OWL class and property labels. Data Knowl Eng 69(4):331–342 (April 2010)
Hirst G, St-Onge D (1998) Lexical chains as representations of context for the detection and correction of malapropisms. In: WordNet: an electronic lexical database (Language, Speech, and Communication). MIT Press, Cambridge
Leacock C, Chodorow M (1998) Combining local context and WordNet similarity for word sense identification. In: Fellbaum. MIT Press, Cambridge, pp 265–283
Miller GA (1995) WordNet: a lexical database for English. Commun ACM, 38:39-41
Pederson T, Patwardhan S, Michelizzi J (2004) Wordnet::similarity—measuring the relatedness of concepts. In: Proceedings of the 19th national conference on artificial intelligence, San Jose, pp 1024–1025
Resnik P (1995) Using information content to evaluate semantic similarity in a taxonomy. In: Proceedings of international joint conference for artificial intelligence (IJCAI-95), Montreal, pp 448–453
Warin M, Oxhammar H, Volk M (2004) Enriching an ontology with WordNet based on similarity measures. In: MEANING-2005 Workshop, Trento
Willett P (2006) The Porter stemming algorithm: then and now. Electron Libr Inform Syst 40(3): 219–223, ISSN 0033-0337
Wu Z, Palmer M (1994) Verb semantics and lexical selection. In: Proceedings of the 32nd annual meeting of the association for computational linguistics, Las Cruces
Vöhringer J, Gälle D, Fliedl G, Kop C, Bazhenov M (2010) Using linguistic knowledge for fine-tuning ontologies in the context of requirements engineering.International Journal of Computational Linguistics and Applications, Vol. 1, No. 1-2 2010, in: chapter 5 Applications, ISSN 0976-0962, Bahri Publications
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this paper
Cite this paper
Vöhringer, J., Fliedl, G. (2011). Adapting the Lesk Algorithm for Calculating Term Similarity in the Context of Requirements Engineering. In: Pokorny, J., et al. Information Systems Development. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9790-6_63
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9790-6_63
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-9645-9
Online ISBN: 978-1-4419-9790-6
eBook Packages: Computer ScienceComputer Science (R0)