Sketching techniques for large scale NLP

6th Web as Corpus Workshop, WAC 2010 at the 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2010 - Proceedings

Volumn , Issue , 2010, Pages 17-25

  Goyal, Amit ^a   Jagarlamudi, Jagadeesh ^a   Daumé, Hal ^a   Venkatasubramanian, Suresh ^a  

^a University of Utah   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS; SEMANTICS;

AVERAGE RELATIVE ERROR; COUNT-MIN SKETCH; LARGE AMOUNTS; LARGE-SCALES; POWER; SKETCH TECHNIQUES; SKETCHINGS; STREAMING DATA; TEXT DATA; WORD-PAIRS;

RANDOM ACCESS STORAGE;

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

References (23)

1. Eneko Agirre, Enrique Alfonseca, Keith Hall, Jana Kravalova, Marius Paşca, and Aitor Soroa. 2009. A study on similarity and relatedness using distributional and wordnet-based approaches. In NAACL '09: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics.
2. Thorsten Brants, Ashok C. Popat, Peng Xu, Franz J. Och, and Jeffrey Dean. 2007. Large language models in machine translation. In Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL).
3. Moses Charikar, Kevin Chen, and Martin Farachcolton. 2002. Finding frequent items in data streams.
4. K. Church and P. Hanks. 1989. Word Association Norms, Mutual Information and Lexicography. In Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics, pages 76-83, Vancouver, Canada, June.
5. Graham Cormode and Marios Hadjieleftheriou. 2008. Finding frequent items in data streams. In VLDB.
6. Graham Cormode and S. Muthukrishnan. 2004. An improved data stream summary: The count-min sketch and its applications. J. Algorithms.
7. Cristian Estan and George Varghese. 2002. New directions in traffic measurement and accounting. SIG-COMM Comput. Commun. Rev., 32(4).
8. Amit Goyal, Hal Daumé III, and Suresh Venkatasubramanian. 2009. Streaming for large scale NLP: Language modeling. In North American Chapter of the Association for Computational Linguistics (NAACL).
9. D. Graff. 2003. English Gigaword. Linguistic Data Consortium, Philadelphia, PA, January.
10. Abby Levenberg and Miles Osborne. 2009. Stream-based randomised language models for SMT. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, pages 756-764, Singapore, August. Association for Computational Linguistics.
11. Ping Li and Kenneth W. Church. 2007. A sketch algorithm for estimating two-way and multi-way associations. Comput. Linguist., 33(3).
12. G. S. Manku and R. Motwani. 2002. Approximate frequency counts over data streams. In Proceedings of the 28th International Conference on Very Large Data Bases.
13. S. Muthukrishnan. 2005. Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science, 1(2).
14. Patrick Pantel, Eric Crestan, Arkady Borkovsky, Ana-Maria Popescu, and Vishnu Vyas. 2009. Web-scale distributional similarity and entity set expansion. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, pages 938-947, Singapore, August. Association for Computational Linguistics.
15. S. Patwardhan and E. Riloff. 2006. Learning Domain-Specific Information Extraction Patterns from the Web. In Proceedings of the ACL 2006 Workshop on Information Extraction Beyond the Document.
16. Deepak Ravichandran, Patrick Pantel, and Eduard Hovy. 2005. Randomized algorithms and nlp: using locality sensitive hash function for high speed noun clustering. In ACL'05: Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics.
17. Florin Rusu and Alin Dobra. 2007. Statistical analysis of sketch estimators. In SIGMOD'07. ACM.
18. Philip J. Stone, Dexter C. Dunphy, Marshall S. Smith, and Daniel M. Ogilvie. 1966. The General Inquirer: A Computer Approach to Content Analysis. MIT Press.
19. David Talbot and Miles Osborne. 2007. Smoothed Bloom filter language models: Tera-scale LMs on the cheap. In Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EM NLP-CoNLL).
20. Peter D. Turney and Michael L. Littman. 2002. Unsupervised learning of semantic orientation from a hundred-billion-word corpus. CoRR, cs.LG/0212012.
21. Peter D. Turney. 2008. A uniform approach to analogies, synonyms, antonyms, and associations. In Proceedings of COLING 2008.
22. Benjamin Van Durme and Ashwin Lall. 2009a. Probabilistic counting with randomized storage. In IJ-CAI'09: Proceedings of the 21st international jont conference on Artifical intelligence, pages 1574-1579.
23. Benjamin Van Durme and Ashwin Lall. 2009b. Streaming pointwise mutual information. In Advances in Neural Information Processing Systems 22.