Recommended Citation
Postprint version. Published in IEEE Internatioanl Conference on Semantic Computing Proceedings: June 16, 2014, Newport Beach, CA, June 16, 2014.
NOTE: At the time of publication, the author Lubomir Stanchev was not yet affiliated with Cal Poly.
Abstract
The paper addresses the problem of modeling the relationship between phrases in English using a similarity graph. The mathematical model stores data about the strength of the relationship between phrases expressed as a decimal number. Both structured data from Wikipedia, such as that the Wikipedia page with title “Dog” belongs to theWikipedia category “Domesticated animals”, and textual descriptions, such as that the Wikipedia page with title “Dog” contains the word “wolf” thirty one times are used in creating the graph. The quality of the graph data is validated by comparing the similarity of pairs of phrases using our software that uses the graph with results of studies that were performed with human subjects. To the best of our knowledge, our software produces better correlation with the results of both the Miller and Charles study and the WordSimilarity-353 study than any other published research.
Disciplines
Computer Sciences
Copyright
2014 IEEE.
Publisher statement
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Included in
URL: https://digitalcommons.calpoly.edu/csse_fac/247