Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Mining the Web: Discovering Knowledge from HyperText Data
Mining the Web: Discovering Knowledge from HyperText Data
Acquisition of lexical paraphrases from texts
COMPUTERM '02 COLING-02 on COMPUTERM 2002: second international workshop on computational terminology - Volume 14
Optimizing synonym extraction using monolingual and bilingual resources
PARAPHRASE '03 Proceedings of the second international workshop on Paraphrasing - Volume 16
Selection of effective contextual information for automatic synonym acquisition
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Term aggregation: mining synonymous expressions using personal stylistic variations
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Finding synonyms using automatic word alignment and measures of distributional similarity
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Aligning needles in a haystack: paraphrase acquisition across the web
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Acquiring synonyms from monolingual comparable texts
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Mining numbers in text using suffix arrays and clustering based on dirichlet process mixture models
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
| Hi-index | 0.00 |
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.