메뉴 건너뛰기




Volumn , Issue , 2008, Pages 97-104

Named entity recognition for Indian languages

Author keywords

[No Author keywords available]

Indexed keywords

COMPARABLE CORPORA; INDIAN LANGUAGES; LANGUAGE INDEPENDENTS; MATCHING TECHNIQUES; NAMED ENTITIES; NAMED ENTITY RECOGNITION; NEW APPROACHES; PROPERTY; SET OF RULES;

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

References (6)
  • 3
    • 0347552513 scopus 로고    scopus 로고
    • 2000a. Technical Report CUED/FIN-FENG/TR.385, Cambridge University Engineering Department
    • Kim, J. and Woodland, P.C. 2000a. Rule Based Named Entity Recognition. Technical Report CUED/FIN-FENG/TR.385, Cambridge University Engineering Department, 2000.
    • (2000) Rule Based Named Entity Recognition
    • Kim, J.1    Woodland, P.C.2
  • 4
    • 8644233078 scopus 로고    scopus 로고
    • Markov models for language-independent named entity recognition
    • Taiwan, pages
    • Malouf, Robert. 2002 Markov models for language-independent named entity recognition. In Proceedings of CoNLL-2002 Taipei, Taiwan, pages 591-599.
    • (2002) Proceedings of CoNLL-2002 Taipei , pp. 591-599
    • Malouf, Robert1
  • 5
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • Levenshtein, V.I. 1966. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10: 707–710.
    • (1966) Soviet Physics Doklady , vol.10 , pp. 707-710
    • Levenshtein, V.I.1


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