Efficient staggered decoding for sequence labeling

ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn , Issue , 2010, Pages 485-494

  Kaji, Nobuhiro ^a   Fujiwara, Yasuhiro ^a   Yoshinaga, Naoki ^a   Kitsuregawa, Masaru ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING ALGORITHM; OPTIMALITY; ORDERS OF MAGNITUDE; POS TAGGING; SEQUENCE LABELING; STATE-OF-THE-ART ALGORITHMS; TIME COMPLEXITY; VITERBI; VITERBI DECODING;

COMPUTATIONAL LINGUISTICS; DECODING;

VITERBI ALGORITHM;

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

References (23)

1. Thorsten Brants. 2000. TnT - a statistical part-of-speech tagger. In Proceedings of ANLP, pages 224-231.
2. Eugene Charniak, Mark Johnson, Micha Elsner, Joseph Austerweil, David Ellis, Isaac Haxton, Catherine Hill, R. Shrivaths, Jeremy Moore, Michael Pozar, and Theresa Vu. 2006. Multi-level coarse-to-fine PCFG parsing. In Proceedings of NAACL, pages 168-175.
3. Trevor Cohn. 2006. Efficient inference in large conditional random fields. In Proceedings of ECML, pages 606-613.
4. Michael Collins. 2002. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proceedings of EMNLP, pages 1-8.
5. Thomas G. Dietterich, Pedro Domingos, Lise Getoor, Stephen Muggleton, and Prasad Tadepalli. 2008. Structured machine learning: the next ten years. Machine Learning, 73(1):3-23.
6. Roberto Esposito and Daniele P. Radicioni. 2009. CARPEDIEM: Optimizing the Viterbi algorithm and applications to supervised sequential learning. Jorunal of Machine Learning Research, 10:1851-1880.
7. Pedro F. Felzenszwalb, Daniel P. Huttenlocher, and Jon M. Kleinberg. 2003. Fast algorithms for largestate-space HMMs with applications to Web usage analysis. In Proceedings of NIPS, pages 409-416.
8. Minwoo Jeong, Chin-Yew Lin, and Gary Geunbae Lee. 2009. Efficient inference of CRFs for large-scale natural language data. In Proceedings of ACLIJCNLP Short Papers, pages 281-284.
9. John Lafferty, Andrew McCallum, and Fernand Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of ICML, pages 282-289.
10. Percy Liang, Hal Daumé III, and Dan Klein. 2008. Structure compilation: Trading structure for features. In Proceedings of ICML, pages 592-599.
11. Yury Lifshits, Shay Mozes, OrenWeimann, and Michal Ziv-Ukelson. 2007. Speeding up HMM decoding and training by exploiting sequence repetitions. Computational Pattern Matching, pages 4-15.
12. Dekang Lin and Xiaoyun Wu. 2009. Phrae clustering for discriminative training. In Proceedings of ACLIJCNLP, pages 1030-1038.
13. Takuya Matsuzaki, Yusuke Miyao, and Jun'ichi Tsujii. 2007. Efficient HPSG parsing with supertagging and CFG-filtering. In Proceedings of IJCAI, pages 1671-1676.
14. Takashi Ninomiya, Takuya Matsuzaki, Yoshimasa Tsuruoka, Yusuke Miyao, and Jun'ichi Tsujii. 2006. Extremely lexicalized models for accurate and fast HPSG parsing. In Proceedings of EMNLP, pages 155-163.
15. Lawrence R. Rabiner. 1989. A tutorial on hidden Markov models and selected applications in speech recognition. In Proceedings of The IEEE, pages 257-286.
16. Sunita Sarawagi and Willian W. Cohen. 2004. Semi- Markov conditional random fields for information extraction. In Proceedings of NIPS, pages 1185-1192.
17. Fei Sha and Fernando Pereira. 2003. Shallow parsing with conditional random fields. In Proceedings of HLT-NAACL, pages 134-141.
18. Sajid M. Siddiqi and Andrew W. Moore. 2005. Fast inference and learning in large-state-space HMMs. In Proceedings of ICML, pages 800-807.
19. Charles Sutton, Khashayar Rohanimanesh, and Andrew McCallum. 2004. Dynamic conditional random fields: Factorized probabilistic models for labeling and segmenting sequence data. In Proceedings of ICML.
20. Ben Tasker, Carlos Guestrin, and Daphe Koller. 2003. Max-margin Markov networks. In Proceedings of NIPS, pages 25-32.
21. Ioannis Tsochantaridis, Thorsten Joachims, Thomas Hofmann, and Yasemin Altun. 2005. Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research, 6:1453-1484.
22. Yoshimasa Tsuruoka and Jun'ichi Tsujii. 2005. Bidirectional inference with the easiest-first strategy for tagging sequence data. In Proceedings of HLT/EMNLP, pages 467-474.
23. Andrew J. Viterbi. 1967. Error bounds for convolutional codes and an asymeptotically optimum decoding algorithm. IEEE Transactios on Information Theory, 13(2):260-267.