CSDL Home IEEE Transactions on Knowledge & Data Engineering 1999 vol.11 Issue No.05 - September/October
Issue No.05 - September/October (1999 vol.11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.806932
<p><b>Abstract</b>—Most current automatic hypertext generation systems rely on term repetition to calculate the relatedness of two documents. There are well-recognized problems with such approaches, most notably, a vulnerability to the effects of synonymy (many words for the same concept) and polysemy (many concepts for the same word). We propose a novel method for automatic hypertext generation that is based on a technique called <it>lexical chaining</it>, a method for discovering sequences of related words in a text. This method uses a more general notion of document relatedness, and attempts to take into account the effects of synonymy and polysemy. We also present the results of an empirical study designed to test this method in the context of a question answering task from a database of newspaper articles.</p>
Automatic hypertext generation, information retrieval, semantic relatedness, lexical semantics, lexical chaining.
Stephen J. Green, "Building Hypertext Links By Computing Semantic Similarity", IEEE Transactions on Knowledge & Data Engineering, vol.11, no. 5, pp. 713-730, September/October 1999, doi:10.1109/69.806932