AAAI Publications, Twenty-Fourth International FLAIRS Conference

Font Size: 
Using Centrality Algorithms on Directed Graphs for Synonym Expansion
Ravi Som Sinha, Rada Flavia Mihalcea

Last modified: 2011-03-20


This paper presents our explorations in using graph centrality measures to solve the synonym expansion problem. In particular, we use the concept of directional similarity to derive directed graphs on which we apply centrality algorithms to identify the most likely synonyms for a target word in a given context. We show that our method can lead to performance comparable to the state-of-the-art.

Full Text: PDF