Gram-free synonym extraction via suffix arrays

AIRS(2008)

引用 6|浏览6
暂无评分
摘要
This paper proposes a method for implementing real-time synonym search systems. Our final aim is to provide users with an interface with which they can query the system for any length strings and the system returns a list of synonyms of the input string. We propose an efficient algorithm for this operation. The strategy involves indexing documents by suffix arrays and finding adjacent strings of the query by dynamically retrieving its contexts (i.e., strings around the query). The extracted contexts are in turn sent to the suffix arrays to retrieve the strings around the contexts, which are likely to contain the synonyms of the query string.
更多
查看译文
关键词
gram-free synonym extraction,final aim,adjacent string,real-time synonym search system,input string,suffix array,length string,efficient algorithm,query string,real time,indexation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要