메뉴 건너뛰기




Volumn , Issue , 2006, Pages 167-170

Automatic acronym recognition

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; MACHINE LEARNING; SUPERVISED LEARNING;

EID: 79956068048     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1608974.1608999     Document Type: Conference Paper
Times cited : (20)

References (9)
  • 1
    • 0041627757 scopus 로고    scopus 로고
    • A simple algorithm for identifying abbreviation definitions in biomedical texts
    • University of California, Berkeley
    • Ariel S. Schwartz and Marti A. Hearst. 2003. A simple algorithm for identifying abbreviation definitions in biomedical texts. Proc. of the Pacific Symposium on Biocomputing. University of California, Berkeley.
    • (2003) Proc. of the Pacific Symposium on Biocomputing
    • Schwartz, A.S.1    Hearst, M.A.2
  • 3
    • 84901513605 scopus 로고    scopus 로고
    • Collection, encoding and linguistic processing of a swedish medical corpus: The MEDLEX experience
    • Genoa, Italy
    • Dimitrios Kokkinakis. 2006. Collection, Encoding and Linguistic Processing of a Swedish Medical Corpus: The MEDLEX Experience. Proc. of the 5th LREC. Genoa, Italy.
    • (2006) Proc. of the 5th LREC
    • Kokkinakis, D.1
  • 4
    • 0017492836 scopus 로고
    • A fast algorithm for computing longest common subsequences
    • James W. Hunt and Thomas G. Szymanski. 1977. A fast algorithm for computing longest common subsequences. Commun. of the ACM, 20(5): 350-353.
    • (1977) Commun. of the ACM , vol.20 , Issue.5 , pp. 350-353
    • Hunt, J.W.1    Szymanski, T.G.2


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