Learning with annotation noise

ACL-IJCNLP 2009 - Joint Conf. of the 47th Annual Meeting of the Association for Computational Linguistics and 4th Int. Joint Conf. on Natural Language Processing of the AFNLP, Proceedings of the Conf.

Volumn , Issue , 2009, Pages 280-287

  Beigman, Eyal ^a   Klebanov, Beata Beigman ^b  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL LINGUISTICS;

LOSS MODEL; PERCEPTRON ALGORITHMS; TEST TIME;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 84858430682     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1687878.1687919     Document Type: Conference Paper

References (32)

1. Dana Angluin and Philip Laird. 1988. Learning from Noisy Examples. Machine Learning, 2(4):343-370.
2. Beata Beigman Klebanov and Eyal Beigman. 2009. From Annotator Agreement to Noise Models. Computational Linguistics, accepted for publication.
3. Beata Beigman Klebanov, Eyal Beigman, and Daniel Diermeier. 2008. Analyzing Disagreements. In COLING 2008 Workshop on Human Judgments in Computational Linguistics, pages 2-7, Manchester, UK.
4. Avrim Blum, Alan Frieze, Ravi Kannan, and Santosh Vempala. 1996. A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 330-338, Burlington, Vermont, USA.
5. Xavier Carreras, Llúis Màrquez, and Jorge Castro. 2005. Filtering-Ranking Perceptron Learning for Partial Parsing. Machine Learning, 60(1):41-71.
6. Massimiliano Ciaramita and Mark Johnson. 2003. Supersense Tagging of Unknown Nouns in WordNet. In Proceedings of the Empirical Methods in Natural Language Processing Conference, pages 168-175, Sapporo, Japan.
7. William Cohen, Vitor Carvalho, and Tom Mitchell. 2004. Learning to Classify Email into "Speech Acts". In Proceedings of the Empirical Methods in Natural Language Processing Conference, pages 309-316, Barcelona, Spain.
8. Edith Cohen. 1997. Learning Noisy Perceptrons by a Perceptron in Polynomial Time. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 514-523, Miami Beach, Florida, USA.
9. Michael Collins and Nigel Duffy. 2002. New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron. In Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, pages 263-370, Philadelphia, USA.
10. Michael Collins and Brian Roark. 2004. Incremental Parsing with the Perceptron Algorithm. In Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, pages 111-118, Barcelona, Spain.
11. Michael Collins. 2002a. Discriminative Training Methods for Hidden Markov Hodels: Theory and Experiments with Perceptron Algorithms. In Proceedings of the Empirical Methods in Natural Language Processing Conference, pages 1-8, Philadelphia, USA.
12. Michael Collins. 2002b. Ranking Algorithms for Named Entity Extraction: Boosting and the Voted Perceptron. In Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, pages 489-496, Philadelphia, USA.
13. Vitaly Feldman, Parikshit Gopalan, Subhash Khot, and Ashok Ponnuswami. 2006. New Results for Learning Noisy Parities and Halfspaces. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pages 563-574, Los Alamitos, CA, USA.
14. William Feller. 1968. An Introduction to Probability Theory and Its Application, volume 1. Wiley, New York, 3rd edition.
15. Yoav Freund and Robert Schapire. 1999. Large Margin Classification Using the Perceptron Algorithm. Machine Learning, 37(3):277-296.
16. Venkatesan Guruswami and Prasad Raghavendra. 2006. Hardness of Learning Halfspaces with Noise. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pages 543-552, Los Alamitos, CA, USA.
17. David Haussler. 1992. Decision Theoretic Generalizations of the PAC Model for Neural Net and other Learning Applications. Information and Computation, 100(1):78-150.
18. James Henderson and Ivan Titov. 2005. Data-Defined Kernels for Parse Reranking Derived from Probabilistic Models. In Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, pages 181-188, Ann Arbor, Michigan, USA.
19. Michael Kearns and Ming Li. 1988. Learning in the Presence of Malicious Errors. In Proceedings of the 20th Annual ACM symposium on Theory of Computing, pages 267-280, Chicago, USA.
20. Michael Kearns, Robert Schapire, and Linda Sellie. 1994. Toward Efficient Agnostic Learning. Machine Learning, 17(2):115-141.
21. Michael Kearns. 1993. Efficient Noise-Tolerant Learning from Statistical Queries. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 392-401, San Diego, CA, USA.
22. Marvin Minsky and Seymour Papert. 1969. Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge, Mass.
23. A. B. Novikoff. 1962. On convergence proofs on perceptrons. Symposium on the Mathematical Theory of Automata, 12:615-622.
24. Miles Osborne. 2002. Shallow Parsing Using Noisy and Non-Stationary Training Material. Journal of Machine Learning Research, 2:695-719.
25. Massimo Poesio, Udo Kruschwitz, and Chamberlain Jon. 2008. ANAWIKI: Creating Anaphorically Annotated Resources through Web Cooperation. In Proceedings of the 6th International Language Resources and Evaluation Conference, Marrakech, Morocco.
26. Dennis Reidsma and Jean Carletta. 2008. Reliability measurement without limit. Computational Linguistics, 34(3):319-326.
27. Dennis Reidsma and Rieks op den Akker. 2008. Exploiting Subjective Annotations. In COLING 2008 Workshop on Human Judgments in Computational Linguistics, pages 8-16, Manchester, UK.
28. Frank Rosenblatt. 1962. Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanisms. Spartan Books, Washington, D.C.
29. Libin Shen and Aravind Joshi. 2005. Incremental LTAG Parsing. In Proceedings of the Human Language Technology Conference and Empirical Methods in Natural Language Processing Conference, pages 811-818, Vancouver, British Columbia, Canada.
30. Rion Snow, Brendan O'Connor, Daniel Jurafsky, and Andrew Ng. 2008. Cheap and Fast - But is it Good? Evaluating Non-Expert Annotations for Natural Language Tasks. In Proceedings of the Empirical Methods in Natural Language Processing Conference, pages 254-263, Honolulu, Hawaii.
31. Paul Viola and Mukund Narasimhan. 2005. Learning to Extract Information from Semi-Structured Text Using a Discriminative Context Free Grammar. In Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 330-337, Salvador, Brazil.
32. Luis von Ahn. 2006. Games with a purpose. Computer, 39(6):92-94.