Polynomial to linear: Efficient classification with conjunctive features

EMNLP 2009 - Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: A Meeting of SIGDAT, a Special Interest Group of ACL, Held in Conjunction with ACL-IJCNLP 2009

Volumn , Issue , 2009, Pages 1542-1551

  Yoshinaga, Naoki ^a   Kitsuregawa, Masaru ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY PARSING; FEATURE VECTORS; GIVEN FEATURES; PRECOMPUTE;

COMPUTATIONAL LINGUISTICS; VECTORS;

NATURAL LANGUAGE PROCESSING SYSTEMS;

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

References (40)

1. Galen Andrew and Jianfeng Gao. 2007. Scalable training of L1-regularized log-linear models. In Proc. ICML 2007, pages 33-40.
2. Jun'ichi Aoe. 1989. An efficient digital search algorithm by using a double-array structure. IEEE Transactions on Software Engineering, 15(9):1066-1077, September.
3. Adam Berger, Stephen Della Pietra, and Vincent Della Pietra. 1996. A maximum entropy approach to natural language processing. Computational Linguistics, 22(1):39-71, March.
4. Kun-Ta Chuang, Jiun-Long Huang, and Ming-Syan Chen. 2008. Power-law relationship and self-similarity in the itemset support distribution: analysis and applications. The VLDB Journal, 17(5):1121-1141, August.
5. Corinna Cortes and Vladimir Vapnik. 1995. Supportvector networks. Machine Learning, 20(3):273-297, September.
6. Ofer Dekel and Yoram Singer. 2007. Support vector machines on a budget. In Bernhard Schölkopf, John Platt, and Thomas Hofmann, editors, Advances in Neural Information Processing Systems 19, pages 345-352. The MIT Press.
7. Ofer Dekel, Shai Shalev-Shwartz, and Yoram Singer. 2008. The forgetron: A kernel-based perceptron on a budget. SIAM Journal on Computing, 37(5):1342-1372, January.
8. O'Neil Delpratt, Naila Rahman, and Rajeev Raman. 2006. Engineering the LOUDS succinct tree representation. In Proc. WEA 2006, pages 134-145.
9. Leo Egghe. 2000. The distribution of n-grams. Scientometrics, 47(2):237-252, February.
10. Kuzman Ganchev and Mark Dredze. 2008. Small statistical models by random feature mixing. In Proc. ACL 2008 Workshop on Mobile Language Processing, pages 19-20.
11. Jianfeng Gao, Galen Andrew, Mark Johnson, and Kristina Toutanova. 2007. A comparative study of parameter estimation methods for statistical natural language processing. In Proc. ACL 2007, pages 824-831.
12. Yoav Goldberg and Michael Elhadad. 2008. splitSVM: Fast, space-efficient, non-heuristic, polynomial kernel computation for NLP applications. In Proc. ACL 2008, Short Papers, pages 237-240.
13. Joshua Goodman. 2004. Exponential priors for maximum entropy models. In Proc. HLT-NAACL 2004, pages 305-311.
14. Hideki Isozaki and Hideto Kazawa. 2002. Efficient support vector classifiers for named entity recognition. In Proc. COLING 2002, pages 1-7.
15. Masakazu Iwatate, Masayuki Asahara, and Yuji Matsumoto. 2008. Japanese dependency parsing using a tournament model. In Proc. COLING 2008, pages 361-368.
16. Guy Jacobson. 1989. Space-efficient static trees and graphs. In Proc. FOCS 1989, pages 549-554.
17. Hisashi Kashima, Tsuyoshi Idé, Tsuyoshi Kato, and Masashi Sugiyama. 2009. Recent advances and trends in large-scale kernel methods. IEICE Transactions on on Information and Systems, E92-D. to appear.
18. Jun'ichi Kazama and Jun'ichi Tsujii. 2003. Evaluation and extension of maximum entropy models with inequality constraints. In Proc. EMNLP 2003, pages 137-144.
19. Jun'ichi Kazama and Jun'ichi Tsujii. 2005. Maximum entropy models with inequality constraints: A case study on text categorization. Machine Learning, 60(1-3):159-194.
20. Terry Koo, Xavier Carreras, and Michael Collins. 2008. Simple semi-supervised dependency parsing. In Proc. ACL 2008, pages 595-603.
21. Taku Kudo and Yuji Matsumoto. 2002. Japanese dependency analysis using cascaded chunking. In Proc. CoNLL 2002, pages 1-7.
22. Taku Kudo and Yuji Matsumoto. 2003. Fast methods for kernel-based text analysis. In Proc. ACL 2003, pages 24-31.
23. Sadao Kurohashi and Makoto Nagao. 2003. Building a Japanese parsed corpus. In Anne Abeillé, editor, Treebank: Building and Using Parsed Corpora, pages 249-260. Kluwer Academic Publishers.
24. John D. Lafferty, Andrew McCallum, and Fernando C. N. Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. ICML 2001, pages 282-289.
25. Yudong Liu and Anoop Sarkar. 2007. Experimental evaluation of LTAG-based features for semantic role labeling. In Proc. EMNLP 2007, pages 590-599.
26. David McClosky, Eugene Charniak, and Mark Johnson. 2006. Effective self-training for parsing. In Proc. HLT-NAACL 2006, pages 152-159.
27. Yusuke Miyao and Jun'ichi Tsujii. 2002. Maximum entropy estimation for feature forests. In Proc. HLT 2002, pages 292-297.
28. Ngan L.T. Nguyen and Jin-Dong Kim. 2008. Exploring domain differences for the design of a pronoun resolution system for biomedical texts. In Proc. COLING 2008, pages 625-632.
29. Joakim Nivre. 2003. An efficient algorithm for projective dependency parsing. In Proc. IWPT 2003, pages 149-160.
30. Daisuke Okanohara and Jun'ichi Tsujii. 2009. Learning combination features with L1 regularization. In Proc. HLT-NAACL 2009, Short Papers, pages 97-100.
31. Francesco Orabona, Joseph Keshet, and Barbara Caputo. 2008. The projectron: a bounded kernel-based perceptron. In Proc. ICML 2008, pages 720-727.
32. Patrick Pantel. 2007. Data catalysis: Facilitating largescale natural language data processing. In Proc. ISUC, pages 201-204.
33. Stijn De Saeger, Kentaro Torisawa, and Jun'ichi Kazama. 2009. Mining web-scale treebanks. In Proc. NLP 2009, pages 837-840.
34. Manabu Sassano. 2004. Linear-time dependency analysis for Japanese. In Proc. COLING 2004, pages 8-14.
35. Drahomíra "Johanka" Spoustová, Jan Hajič, Jan Raab, and Miroslav Spousta. 2009. Semi-supervised training for the averaged perceptron POS tagger. In Proc. EACL 2009, pages 763-771.
36. Charles Sutton, Khashayar Rohanimanesh, and Andrew McCallum. 2004. Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data. In Proc. ICML 2004, pages 783-790.
37. Robert Tibshirani. 1996. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B, 58(1):267-288, April.
38. Yu-Chieh Wu, Jie-Chi Yang, and Yue-Shi Lee. 2007. An approximate approach for training polynomial kernel SVMs in linear time. In Proc. ACL 2007
39. Poster and Demo Sessions, pages 65-68. Susumu Yata, Kazuhiro Morita, Masao Fuketa, and Jun'ichi Aoe. 2008. Fast string matching with space-efficient word graphs. In Proc. Innovations in Information Technology 2008, pages 79-83.
40. George K. Zipf. 1949. Human Behavior and the Principle of Least-Effort. Addison-Wesley.