Guided learning for bidirectional sequence classification

ACL 2007 - Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics

Volumn , Issue , 2007, Pages 760-767

  Shen, Libin ^a   Satta, Giorgio ^b   Joshi, Aravind K ^c  

^a BBN TECHNOLOGIES   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; ERROR RATE; LEARNING FRAMEWORKS; LOCAL CLASSIFIER; PERCEPTRON; POS TAGGING; RELATIVE ERRORS; SEQUENCE CLASSIFICATION; TEST SETS;

LEARNING ALGORITHMS; STATISTICAL TESTS;

COMPUTATIONAL LINGUISTICS;

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

References (19)

1. L. Bottou. 1991. Une approche théorique de l'apprentissage connexionniste: Applications à la reconnaissance de la parole. Ph.D. thesis, Université de Paris XI.
2. M. Collins and B. Roark. 2004. Incremental parsing with the perceptron algorithm. In ACL-2004.
3. M. Collins. 2002. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In EMNLP-2002.
4. K. Crammer and Y. Singer. 2003. Ultraconservative online algorithms for multiclass problems. Journal of Machine Learning Research, 3:951-991.
5. H. Daumé III and D. Marcu. 2005. Learning as search optimization: Approximate large margin methods for structured prediction. In ICML-2005.
6. Y. Freund and R. E. Schapire. 1999. Large margin classification using the perceptron algorithm. Machine Learning, 37(3):277-296.
7. J. Giménez and L.Màrquez. 2004. Svmtool: A general pos tagger generator based on support vector machines. In LREC-2004.
8. W. Krauth and M. Mézard. 1987. Learning algorithms with optimal stability in neural networks. Journal of Physics A, 20:745-752.
9. J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditional random fields: Probabilistic models for segmentation and labeling sequence data. In ICML-2001.
10. M. P. Marcus, B. Santorini, and M. A. Marcinkiewicz. 1994. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313-330.
11. A. Ratnaparkhi. 1996. A maximum entropy part-of-speech tagger. In EMNLP-1996.
12. G. Satta and O. Stock. 1994. Bi-Directional Context-Free Grammar Parsing for Natural Language Processing. Artificial Intelligence, 69(1-2).
13. L. Shen and A. K. Joshi. 2005. Incremental LTAG Parsing. In EMNLP-2005.
14. L. Shen and A. K. Joshi. 2007. Bidirectional LTAG Dependency Parsing. Technical Report 07-02, IRCS, UPenn.
15. B. Taskar, C. Guestrin, and D. Koller. 2003. Max-margin markov networks. In NIPS-2003.
16. K. Toutanova, D. Klein, C. Manning, and Y. Singer. 2003. Feature-rich part-of-speech tagging with a cyclic dependency network. In NAACL-2003.
17. Y. Tsuruoka and J. Tsujii. 2005. Bidirectional inference with the easiest-first strategy for tagging sequence data. In EMNLP-2005.
18. B. Widrow and M. E. Hoff. 1960. Adaptive switching circuits. IRE WESCON Convention Record, part 4.
19. W. Woods. 1976. Parsers in speech understanding systems. Technical Report 3438, Vol. 4, 1-21, BBN Inc.