메뉴 건너뛰기




Volumn 2189, Issue , 2001, Pages 228-237

Using multiattribute prediction suffix graphs for spanish part-of-speech tagging

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING; DECISION TREES; FORECASTING; FORESTRY; INFORMATION ANALYSIS; MARKOV PROCESSES; TREES (MATHEMATICS);

EID: 84958523609     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44816-0_23     Document Type: Conference Paper
Times cited : (1)

References (21)
  • 1
    • 0002046240 scopus 로고
    • Some advances in transformation-based part of speech tagging
    • E. Brill. Some advances in transformation-based part of speech tagging. In Proceedings of AAAI94, page 6, 1994.
    • (1994) Proceedings of AAAI94 , pp. 6
    • Brill, E.1
  • 3
    • 0024925138 scopus 로고
    • A stochastic parts program and noun phrase parser for unrestricted text
    • K.W. Church. A stochastic parts program and noun phrase parser for unrestricted text. In Proceedings of ICASSP, 1989.
    • (1989) Proceedings of ICASSP
    • Church, K.W.1
  • 8
    • 84969358400 scopus 로고
    • Probabilistic tagging with feature structures
    • André Kempe. Probabilistic tagging with feature structures. In Coling-94, volume 1, pages 161–165, August 1994.
    • (1994) Coling-94 , vol.1 , pp. 161-165
    • Kempe, A.1
  • 9
    • 84867119745 scopus 로고
    • Tagging english text with a probabilistic model
    • B. Merialdo. Tagging english text with a probabilistic model. Computational Linguistics, 2(20):155–171, 1994.
    • (1994) Computational Linguistics , vol.2 , Issue.20 , pp. 155-171
    • Merialdo, B.1
  • 11
    • 33744584654 scopus 로고
    • Induction of decision trees
    • J.R. Quinlan. Induction of decision trees. Machine Learning, (1):81–106, 1986.
    • (1986) Machine Learning , vol.1 , pp. 81-106
    • Quinlan, J.R.1
  • 12
    • 0020824731 scopus 로고
    • A universal data compression system
    • J. Rissanen. A universal data compression system. IEEE Trans. Inform. Theory, 29(5):656–664, 1983.
    • (1983) IEEE Trans. Inform. Theory , vol.29 , Issue.5 , pp. 656-664
    • Rissanen, J.1
  • 14
    • 0030282113 scopus 로고    scopus 로고
    • The power of amnesia: Learning probabilistic automata with variable memory length
    • Dana Ron, Yoram Singer, and Naftali Tishby. The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning, (25):117–149, 1996.
    • (1996) Machine Learning , vol.25 , pp. 117-149
    • Ron, D.1    Singer, Y.2    Tishby, N.3
  • 19
    • 0001472937 scopus 로고
    • Error bounds for convolutional codes and an asymptotical optimal decoding algorithm
    • A.J. Viterbi. Error bounds for convolutional codes and an asymptotical optimal decoding algorithm. In Proceedings of IEEE, volume 61, pages 268–278, 1967.
    • (1967) Proceedings of IEEE , vol.61 , pp. 268-278
    • Viterbi, A.J.1
  • 21
    • 0026866314 scopus 로고
    • A sequential algorithm for the universal coding of finite-memory sources
    • M. Weinberger, A. Lempel, and K. Ziv. A sequential algorithm for the universal coding of finite-memory sources. IEEE Trans. Inform. Theory, 38:1002–1014, 1982.
    • (1982) IEEE Trans. Inform. Theory , vol.38 , pp. 1002-1014
    • Weinberger, M.1    Lempel, A.2    Ziv, K.3


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