Article

Free access

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

Authors:

Deepak Ravichandran,

Patrick Pantel,

Eduard HovyAuthors Info & Claims

ACL '05: Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics

Pages 622 - 629

https://doi.org/10.3115/1219840.1219917

Published: 25 June 2005 Publication History

Abstract

In this paper, we explore the power of randomized algorithm to address the challenge of working with very large amounts of data. We apply these algorithms to generate noun similarity lists from 70 million pages. We reduce the running time from quadratic to practically linear in the number of elements to be computed.

References

[1]

Banko, M. and Brill, E. 2001. Mitigating the paucity of dataproblem. In Proceedings of HLT. 2001. San Diego, CA.

Digital Library

[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.

Digital Library

[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.

Digital Library

[6]

Church, K. and Hanks, P. 1989. Word association norms, mutual information, and lexicography. In Proceedings of ACL-89. pp. 76--83. Vancouver, Canada.

Digital Library

[7]

Curran, J. and Moens, M. 2002. Scaling context space. In Proceedings of ACL-02 pp 231--238, Philadelphia, PA.

Digital Library

[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.

Digital Library

[9]

Hindle, D. 1990. Noun classification from predicate-argument structures. In Proceedings of ACL-90. pp. 268--275. Pittsburgh, PA.

Digital Library

[10]

Lin, D. 1998. Automatic retrieval and clustering of similar words. In Proceedings of COLING/ACL-98. pp. 768--774. Montreal, Canada.

Digital Library

[11]

Indyk, P., Motwani, R. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality Proceedings of 30thSTOC, 604--613.

Digital Library

[12]

A. Kolcz, A. Chowdhury, J. Alspector 2004. Improved robustness of signature-based near-replica detection via lexicon randomization. Proceedings of ACM-SIGKDD (2004).

Digital Library

[13]

Lin, D. 1994 Principar - an efficient, broad-coverage, principle-based parser. Proceedings of COLING-94, pp. 42--48. Kyoto, Japan.

Digital Library

[14]

Pantel, Patrick and Dekang Lin 2002. Discovering Word Senses from Text. In Proceedings of SIGKDD-02, pp. 613--619. Edmonton, Canada

Digital Library

[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.

Digital Library

Cited By

Eiras-Franco CMartínez-Rego DKanthan LPiñeiro CBahamonde AGuijarro-Berdiñas BAlonso-Betanzos A(2020)Fast Distributed kNN Graph Construction Using Auto-tuned Locality-sensitive HashingACM Transactions on Intelligent Systems and Technology10.1145/340888911:6(1-18)Online publication date: 12-Oct-2020
https://dl.acm.org/doi/10.1145/3408889
Aydar MAyvaz S(2019)An improved method of locality-sensitive hashing for scalable instance matchingKnowledge and Information Systems10.1007/s10115-018-1199-558:2(275-294)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1007/s10115-018-1199-5
Zha YLi J(2018)Liquid Silicon-MononaACM SIGPLAN Notices10.1145/3296957.317316753:2(214-228)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3296957.3173167
Show More Cited By

Recommendations

IR meets NLP: On the Semantic Similarity between Subject-Verb-Object Phrases
ICTIR '15: Proceedings of the 2015 International Conference on The Theory of Information Retrieval

Measuring the semantic similarity between phrases and sentences is an important task in natural language processing (NLP) and information retrieval (IR). We compare the quality of the distributional semantic NLP models against phrase-based semantic IR. ...
Randomized algorithms for comparison-based search
NIPS'11: Proceedings of the 24th International Conference on Neural Information Processing Systems

This paper addresses the problem of finding the nearest neighbor (or one of the R-nearest neighbors) of a query object q in a database of n objects, when we can only use a comparison oracle. The comparison oracle, given two reference objects and a query ...
The Development of a Standard Morpho-Syntactic Lexicon for Arabic NLP
LOPAL '18: Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications

In this paper, we present a linguistic resource developed at our institute which will soon be available in open source. ALIF (Arabic Lexicon Inflected Forms) is a morpho-syntactic lexicon of the inflected forms of the Arabic language in which each ...

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

ACL '05: Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics

June 2005

657 pages

General Chair:
Kevin Knight
University of Southern California

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 25 June 2005

Qualifiers

Article

Acceptance Rates

ACL '05 Paper Acceptance Rate 77 of 423 submissions, 18%;

Overall Acceptance Rate 85 of 443 submissions, 19%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

55
Total Citations
View Citations
2,534
Total Downloads

Downloads (Last 12 months)80
Downloads (Last 6 weeks)8

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Eiras-Franco CMartínez-Rego DKanthan LPiñeiro CBahamonde AGuijarro-Berdiñas BAlonso-Betanzos A(2020)Fast Distributed kNN Graph Construction Using Auto-tuned Locality-sensitive HashingACM Transactions on Intelligent Systems and Technology10.1145/340888911:6(1-18)Online publication date: 12-Oct-2020
https://dl.acm.org/doi/10.1145/3408889
Aydar MAyvaz S(2019)An improved method of locality-sensitive hashing for scalable instance matchingKnowledge and Information Systems10.1007/s10115-018-1199-558:2(275-294)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1007/s10115-018-1199-5
Zha YLi J(2018)Liquid Silicon-MononaACM SIGPLAN Notices10.1145/3296957.317316753:2(214-228)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3296957.3173167
Bollegala DAtanasov VMaehara TKawarabayashi K(2018)ClassiNet -- Predicting Missing Features for Short-Text ClassificationACM Transactions on Knowledge Discovery from Data10.1145/320157812:5(1-29)Online publication date: 27-Jun-2018
https://dl.acm.org/doi/10.1145/3201578
Zha YLi JShen XTuck JBianchini RSarkar V(2018)Liquid Silicon-MononaProceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3173162.3173167(214-228)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3173162.3173167
Abdulhayoglu MThijs B(2018)Use of locality sensitive hashing (LSH) algorithm to match Web of Science and ScopusScientometrics10.1007/s11192-017-2569-6116:2(1229-1245)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s11192-017-2569-6
Beheshti SBenatallah BVenugopal SRyu SMotahari-Nezhad HWang W(2017)A systematic review and comparative analysis of cross-document coreference resolution methods and toolsComputing10.1007/s00607-016-0490-099:4(313-349)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s00607-016-0490-0
Liu SSun JLiu ZPeng XLiu S(2016)Query-Directed Probing LSH for Cosine SimilarityProceedings of the Fifth International Conference on Network, Communication and Computing10.1145/3033288.3033318(171-177)Online publication date: 17-Dec-2016
https://dl.acm.org/doi/10.1145/3033288.3033318
Zheng YGuo QTung AWu SÖzcan FKoutrika GMadden S(2016)LazyLSHProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2882930(2023-2037)Online publication date: 26-Jun-2016
https://dl.acm.org/doi/10.1145/2882903.2882930
Kutzkov KAhmed MNikitaki SBailey JMoffat AAggarwal Cde Rijke MKumar RMurdock VSellis TYu J(2015)Weighted Similarity Estimation in Data StreamsProceedings of the 24th ACM International on Conference on Information and Knowledge Management10.1145/2806416.2806515(1051-1060)Online publication date: 17-Oct-2015
https://dl.acm.org/doi/10.1145/2806416.2806515
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents