Term-weighting approaches in automatic text retrieval
Information Processing and Management: an International Journal
Handbook of theoretical computer science (vol. A): algorithms and complexity
Handbook of theoretical computer science (vol. A): algorithms and complexity
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
A comparison of indexing techniques for Japanese text retrieval
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
An extension of Ukkonen's enhanced dynamic programming ASM algorithm
ACM Transactions on Information Systems (TOIS)
Using n-grams for Korean text retrieval
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Comparing representations in Chinese information retrieval
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Chinese text retrieval without using a dictionary
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
PAT-tree-based keyword extraction for Chinese information retrieval
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Overlapping statistical word indexing: a new indexing method for Japanese text
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Dynamic programming matching for large scale information retrieval
AsianIR '03 Proceedings of the sixth international workshop on Information retrieval with Asian languages - Volume 11
Hi-index | 0.00 |
We introduce a new similarity measure based on dynamic programming, intended for technical terms such as machine translation system, which are quite common in technical writing. We compare our proposal with systems which use standard IDF cosine similarity, but on different vocabularies. The dynamic programming method is relatively strong when the query contains a single long technical term, and none of the words in the term are particularly good keywords.