Gloss Overlap Extensions for a Semantic Network Algorithm: Building a Better Semantic Distance Measure

Thimal Jayasooriya, Suresh Manandhar

Semantic similarity or inversely, semantic distance measures are useful in a variety of circumstances, from spell checking applications to a lightweight replacement for parsing within a natural language engine. Within this work, we examine the Jiang and Conrath's semantic distance algorithm; evaluated by Budanitsky as being the best performing, and subject the algorithm to a series of tests. We also propose a novel technique which corrects a crucial weakness of the original algorithm, and show that its application improves semantic distance measures for cases where the underlying linguistic network causes deficiencies

Subjects: 13. Natural Language Processing; 1.10 Information Retrieval

Submitted: Feb 7, 2006

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.