메뉴 건너뛰기




Volumn , Issue , 2001, Pages

A sequential model for multi-class classification

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 80053388408     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (32)

References (31)
  • 2
    • 84867919822 scopus 로고
    • Transformation-based error-driven learning and natural language processing: A case study in part of speech tagging
    • E. Brill. 1995. Transformation-based error-driven learning and natural language processing: A case study in part of speech tagging. Computational Linguistics, 21(4):543-565.
    • (1995) Computational Linguistics , vol.21 , Issue.4 , pp. 543-565
    • Brill, E.1
  • 4
    • 0032633485 scopus 로고    scopus 로고
    • Similarity-based models of word cooccurrence probabilities
    • I. Dagan, L. Lee, and F. Pereira. 1999. Similarity-based models of word cooccurrence probabilities. Machine Learning, 34(1-3):43-69.
    • (1999) Machine Learning , vol.34 , Issue.1-3 , pp. 43-69
    • Dagan, I.1    Lee, L.2    Pereira, F.3
  • 5
    • 84937293966 scopus 로고
    • Automatic stochastic tagging of natural language texts
    • E. Dermatas and G. Kokkinakis. 1995. Automatic stochastic tagging of natural language texts. Computational Linguistics, 21(2):137-164.
    • (1995) Computational Linguistics , vol.21 , Issue.2 , pp. 137-164
    • Dermatas, E.1    Kokkinakis, G.2
  • 7
    • 85119672471 scopus 로고    scopus 로고
    • A classification approach to word prediction
    • Y. Even-Zohar and D. Roth. 2000. A classification approach to word prediction. In NAALP 2000, pages 124-131.
    • (2000) NAALP 2000 , pp. 124-131
    • Even-Zohar, Y.1    Roth, D.2
  • 9
    • 0032662978 scopus 로고    scopus 로고
    • A Winnow based approach to context-sensitive spelling correction
    • Special on Machine Learning and Natural Language
    • A. R. Golding and D. Roth. 1999. A Winnow based approach to context-sensitive spelling correction. Machine Learning, 34(1-3):107-130. Special Issue on Machine Learning and Natural Language.
    • (1999) Machine Learning , vol.34 , Issue.1-3 , pp. 107-130
    • Golding, A. R.1    Roth, D.2
  • 11
    • 84898942883 scopus 로고    scopus 로고
    • Classification by pairwise coupling
    • Michael I. Jordan, Michael J. Kearns, and Sara A. Solla, editors, The MIT Press
    • T. Hastie and R. Tibshirani. 1998. Classification by pairwise coupling. In Michael I. Jordan, Michael J. Kearns, and Sara A. Solla, editors, Advances in Neural Information Processing Systems, volume 10. The MIT Press.
    • (1998) Advances in Neural Information Processing Systems , vol.10
    • Hastie, T.1    Tibshirani, R.2
  • 13
    • 84945520073 scopus 로고    scopus 로고
    • Use of support vector machines for chunk identification
    • Lisbon, Protugal
    • T. Kudoh and Y. Matsumoto. 2000. Use of support vector machines for chunk identification. In CoNLL, pages 142-147, Lisbon, Protugal.
    • (2000) CoNLL , pp. 142-147
    • Kudoh, T.1    Matsumoto, Y.2
  • 14
    • 85068999674 scopus 로고    scopus 로고
    • Distributional similarity models: Clustering vs. nearest neighbors
    • L. Lee and F. Pereira. 1999. Distributional similarity models: Clustering vs. nearest neighbors. In ACL 99, pages 33-40.
    • (1999) ACL , vol.99 , pp. 33-40
    • Lee, L.1    Pereira, F.2
  • 15
    • 85149114506 scopus 로고    scopus 로고
    • Measure of distributional similarity
    • L. Lee. 1999. Measure of distributional similarity. In ACL 99, pages 25-32.
    • (1999) ACL , vol.99 , pp. 25-32
    • Lee, L.1
  • 16
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions and reversals
    • V.I. Levenshtein. 1966. Binary codes capable of correcting deletions, insertions and reversals. In Sov. Phys-Dokl, volume 10, pages 707-710.
    • (1966) Sov. Phys-Dokl , vol.10 , pp. 707-710
    • Levenshtein, V.I.1
  • 19
    • 0005496287 scopus 로고    scopus 로고
    • Automatic rule induction for unknown word guessing
    • A. Mikheev. 1997. Automatic rule induction for unknown word guessing. In Computational Linguistic, volume 23(3), pages 405-423.
    • (1997) Computational Linguistic , vol.23 , Issue.3 , pp. 405-423
    • Mikheev, A.1
  • 25
    • 0031632815 scopus 로고    scopus 로고
    • Learning to resolve natural language ambiguities: A unified approach
    • D. Roth. 1998. Learning to resolve natural language ambiguities: A unified approach. In Proc. National Conference on Artificial Intelligence, pages 806-813.
    • (1998) Proc. National Conference on Artificial Intelligence , pp. 806-813
    • Roth, D.1
  • 28
    • 0004251247 scopus 로고
    • Academic Press Inc., Boston, MA, second edition
    • H. S. Wilf. 1994. generatingfunctionology. Academic Press Inc., Boston, MA, second edition.
    • (1994) generatingfunctionology
    • Wilf, H. S.1
  • 29
    • 84975293364 scopus 로고
    • Decision lists for lexical ambiguity resolution: application to accent restoration in Spanish and French
    • D. Yarowsky. 1994. Decision lists for lexical ambiguity resolution: application to accent restoration in Spanish and French. In Proc. of the Annual Meeting of the ACL, pages 88-95.
    • (1994) Proc. of the Annual Meeting of the ACL , pp. 88-95
    • Yarowsky, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.