메뉴 건너뛰기




Volumn 34, Issue 1, 1999, Pages 107-130

Winnow-based approach to context-sensitive spelling correction

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; CONTEXT SENSITIVE LANGUAGES; ERROR CORRECTION; NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 0032662978     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1007545901558     Document Type: Article
Times cited : (229)

References (40)
  • 1
    • 0007563290 scopus 로고
    • Learning boolean functions in an infinite attribute space
    • Blum, A. (1992). Learning boolean functions in an infinite attribute space. Machine Learning, 9(4), 373-386.
    • (1992) Machine Learning , vol.9 , Issue.4 , pp. 373-386
    • Blum, A.1
  • 5
    • 34249753618 scopus 로고
    • Support-vector networks
    • Cortes, C., & Vapnik, V. (1995). Support-vector networks. Machine Learning, 20, 273-297.
    • (1995) Machine Learning , vol.20 , pp. 273-297
    • Cortes, C.1    Vapnik, V.2
  • 7
    • 0000259511 scopus 로고    scopus 로고
    • Approximate statistical tests for comparing supervised classification learning algorithms
    • Dietterich, T.G. (1998). Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation, 10(1), 1895-1924.
    • (1998) Neural Computation , vol.10 , Issue.1 , pp. 1895-1924
    • Dietterich, T.G.1
  • 8
    • 0031269184 scopus 로고    scopus 로고
    • On the optimality of the simple Bayesian classifier under zero-one loss
    • Domingos, P., & Pazzani, M. (1997). On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 29, 103-130.
    • (1997) Machine Learning , vol.29 , pp. 103-130
    • Domingos, P.1    Pazzani, M.2
  • 12
    • 84983110889 scopus 로고
    • A decision-theoretic generalization of on-line learning and an application to boosting
    • Springer-Verlag
    • Freund, Y., & Schapire, R.E. (1995). A decision-theoretic generalization of on-line learning and an application to boosting. Computational Learning Theory: Eurocolt'95 (pp. 23-37). Springer-Verlag.
    • (1995) Computational Learning Theory: Eurocolt'95 , pp. 23-37
    • Freund, Y.1    Schapire, R.E.2
  • 13
    • 34248847962 scopus 로고
    • A method for disambiguating word senses in a large corpus
    • Gale, W.A., Church, K.W., & Yarowsky, D. (1993). A method for disambiguating word senses in a large corpus. Computers and the Humanities, 26, 415-439.
    • (1993) Computers and the Humanities , vol.26 , pp. 415-439
    • Gale, W.A.1    Church, K.W.2    Yarowsky, D.3
  • 19
    • 0023312404 scopus 로고
    • Estimation of probabilities from sparse data for the language model component of a speech recognizer
    • Katz, S.M. (1987). Estimation of probabilities from sparse data for the language model component of a speech recognizer. IEEE Trans, on Acoustics, Speech, and Signal Processing, ASSP-35(3), 400-401.
    • (1987) IEEE Trans, on Acoustics, Speech, and Signal Processing, ASSP-35 , Issue.3 , pp. 400-401
    • Katz, S.M.1
  • 24
    • 0026979939 scopus 로고
    • Techniques for automatically correcting words in text
    • Kukich, K. (1992). Techniques for automatically correcting words in text. ACM Computing Surveys, 24(4), 377-439.
    • (1992) ACM Computing Surveys , vol.24 , Issue.4 , pp. 377-439
    • Kukich, K.1
  • 25
    • 34250091945 scopus 로고
    • Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
    • Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285-318.
    • (1988) Machine Learning , vol.2 , pp. 285-318
    • Littlestone, N.1
  • 26
    • 0000511449 scopus 로고
    • Redundant noisy attributes, attribute errors, and linear threshold learning using Winnow
    • Morgan Kaufmann
    • Littlestone, N. (1991). Redundant noisy attributes, attribute errors, and linear threshold learning using Winnow. Proceedings of the 4th Annual Workshop on Computational Learning Theory (pp. 147-156). Morgan Kaufmann.
    • (1991) Proceedings of the 4th Annual Workshop on Computational Learning Theory , pp. 147-156
    • Littlestone, N.1
  • 27
    • 85050937116 scopus 로고
    • Comparing several linear-threshold learning algorithms on tasks involving superfluous attributes
    • Morgan Kaufmann
    • Littlestone, N. (1995). Comparing several linear-threshold learning algorithms on tasks involving superfluous attributes. Proceedings of the 12th International Conference on Machine Learning (pp. 353-361). Morgan Kaufmann.
    • (1995) Proceedings of the 12th International Conference on Machine Learning , pp. 353-361
    • Littlestone, N.1
  • 30
    • 34249852033 scopus 로고
    • Building a large annotated corpus of English: The Penn Treebank
    • Marcus, M.P., Santorini, B., & Marcinkiewicz, M. (1993). Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2), 313-330.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.P.1    Santorini, B.2    Marcinkiewicz, M.3
  • 32
    • 0027929445 scopus 로고
    • On structuring probabilistic dependences in stochastic language modelling
    • Ney, H., Essen, U., & Kneser, R. (1994). On structuring probabilistic dependences in stochastic language modelling. Computer Speech and Language, 8, 1-38.
    • (1994) Computer Speech and Language , vol.8 , pp. 1-38
    • Ney, H.1    Essen, U.2    Kneser, R.3


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