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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Yoshida, M., Nakagawa, H., & Terada, A. (2008). Gram-free synonym extraction via suffix arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4993 LNCS, pp. 276–285). https://doi.org/10.1007/978-3-540-68636-1_27
Mendeley helps you to discover research relevant for your work.