Randomized algorithms and NLP: Using locality sensitive hash function for high speed noun clustering

ACL-05 - 43rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn , Issue , 2005, Pages 622-629

  Ravichandran, Deepak ^a   Pantel, Patrick ^a   Hovy, Eduard ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LARGE AMOUNTS OF DATA; LOCALITY SENSITIVE HASH; RANDOMIZED ALGORITHMS; RUNNING TIME;

COMPUTATIONAL LINGUISTICS; HASH FUNCTIONS;

CLUSTERING ALGORITHMS;

EID: 36949016905     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Banko, M. and Brill, E. 2001. Mitigating the paucity of dataproblem. In Proceedings of HLT. 2001. San Diego, CA.
2. Box, G. E. P. and M. E. Muller 1958. Ann. Math. Stat. 29, 610-611.
3. Broder, Andrei 1997. On the Resemblance and Containment of Documents. Proceedings of the Compression and Complexity of Sequences.
4. Cavnar, W. B. and J. M. Trenkle 1994. N-Gram-Based Text Categorization. In Proceedings of Third Annual Symposium on Document Analysis and Information Retrieval, Las Vegas, NV, UNLV Publications/Reprographics, 161-175.
5. Charikar, Moses 2002. Similarity Estimation Techniques from Rounding Algorithms In Proceedings of the 34th Annual ACM Symposium on Theory of Computing.
6. Church, K. and Hanks, P. 1989. Word association norms, mutual information, and lexicography. In Proceedings of ACL-89. pp. 76-83. Vancouver, Canada.
7. Curran, J. and Moens, M. 2002. Scaling context space. In Proceedings of ACL-02 pp 231-238, Philadelphia, PA.
8. Goemans, M. X. and D. P. Williamson 1995. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. JACM 42(6): 1115-1145.
9. Hindle, D. 1990. Noun classification from predicate-argument structures. In Proceedings of ACL-90. pp. 268-275. Pittsburgh, PA.
10. Lin, D. 1998. Automatic retrieval and clustering of similar words. In Proceedings of COLING/ACL-98. pp. 768-774. Montreal, Canada.
11. Indyk, P., Motwani, R. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality Proceedings of 30th STOC, 604-613.
12. A. Kolcz, A. Chowdhury, J. Alspector 2004. Improved robustness of signature-based near-replica detection via lexicon randomization. Proceedings of ACM-SIGKDD (2004).
13. Lin, D. 1994 Principar - an efficient, broad-coverage, principle-based parser. Proceedings of COLING-94, pp. 42-48. Kyoto, Japan.
14. Pantel, Patrick and Dekang Lin 2002. Discovering Word Senses from Text. In Proceedings of SIGKDD-02, pp. 613-619. Edmonton, Canada
15. Rabin, M. O. 1981. Fingerprinting by random polynomials. Center for research in Computing technology , Harvard University, Report TR-15-81.
16. Salton, G. and McGill, M. J. 1983. Introduction to Modern Information Retrieval. McGraw Hill.