No Free Lunch: Brute Force vs. Locality-Sensitive Hashing for Cross-lingual Pairwise Similarity Ferhan Ture1 , Tamer Elsayed2 , Jimmy Lin1,3 1 2

First Page		Document Content
Date: 2011-09-05 10:52:26 MinHash Locality-sensitive hashing Cosine similarity Data mining Jaccard index Nearest neighbor search Digital signature Information science Information retrieval Search algorithms		No Free Lunch: Brute Force vs. Locality-Sensitive Hashing for Cross-lingual Pairwise Similarity Ferhan Ture1 , Tamer Elsayed2 , Jimmy Lin1,3 1 2 Add to Reading List Source URL: www.umiacs.umd.edu Download Document from Source Website File Size: 696,58 KB Share Document on Facebook