메뉴 건너뛰기




Volumn , Issue , 2006, Pages 67-74

Web Corpus Mining by instance of Wikipedia

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; INFORMATION RETRIEVAL SYSTEMS;

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

References (22)
  • 5
    • 0345861203 scopus 로고    scopus 로고
    • New algorithm for ordered tree-to-tree correction problem
    • Weimin Chen. 2001. New algorithm for ordered tree-to-tree correction problem. Journal of Algorithms, 40(2):135-158.
    • (2001) Journal of Algorithms , vol.40 , Issue.2 , pp. 135-158
    • Chen, Weimin1
  • 11
    • 0344154403 scopus 로고    scopus 로고
    • Introduction to the special issue on the web as corpus
    • Adam Kilgarriff and Gregory Grefenstette. 2003. Introduction to the special issue on the web as corpus. Computational Linguistics, 29(3):333-347.
    • (2003) Computational Linguistics , vol.29 , Issue.3 , pp. 333-347
    • Kilgarriff, Adam1    Grefenstette, Gregory2
  • 12
    • 84896693236 scopus 로고    scopus 로고
    • Computing the edit-distance between unrooted ordered trees
    • G. Bilardi, G. F. Italiano, A. Pietracaprina, and G. Pucci, editors, pages Berlin. Springer
    • P. Klein. 1998. Computing the edit-distance between unrooted ordered trees. In G. Bilardi, G. F. Italiano, A. Pietracaprina, and G. Pucci, editors, Proceedings of the 6th Annual European Symposium, pages 91-102, Berlin. Springer.
    • (1998) Proceedings of the 6th Annual European Symposium , pp. 91-102
    • Klein, P.1
  • 13
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • Jon M. Kleinberg. 1999. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632.
    • (1999) Journal of the ACM , vol.46 , Issue.5 , pp. 604-632
    • Kleinberg, Jon M.1
  • 14
    • 44449085876 scopus 로고    scopus 로고
    • The net for the graphs - towards webgenre representation for corpus linguistic studies
    • Marco Baroni and Silvia Bernardini, editors, Gedit, Bologna, Italy
    • Alexander Mehler and Rüdiger Gleim. 2005. The net for the graphs - towards webgenre representation for corpus linguistic studies. In Marco Baroni and Silvia Bernardini, editors, WaCky! Working papers on the Web as corpus. Gedit, Bologna, Italy.
    • (2005) WaCky! Working papers on the Web as corpus
    • Mehler, Alexander1    Gleim, Rüdiger2
  • 17
    • 10244238969 scopus 로고    scopus 로고
    • On inference theories and code theories: Corpus evidence for semantic schemas
    • Michael Stubbs. 2001. On inference theories and code theories: Corpus evidence for semantic schemas. Text, 21(3):437-465.
    • (2001) Text , vol.21 , Issue.3 , pp. 437-465
    • Stubbs, Michael1
  • 18
    • 0018491659 scopus 로고
    • The tree-to-tree correction problem
    • K. C. Tai. 1979. The tree-to-tree correction problem. Journal of the ACM, 26(3):422-433.
    • (1979) Journal of the ACM , vol.26 , Issue.3 , pp. 422-433
    • Tai, K. C.1
  • 21
    • 27144441097 scopus 로고    scopus 로고
    • An evaluation of statistical approaches to text categorization
    • (/2)
    • Yiming Yang. 1999. An evaluation of statistical approaches to text categorization. Journal of Information Retrieval, 1(1/2):67-88.
    • (1999) Journal of Information Retrieval , vol.1 , Issue.1 , pp. 67-88
    • Yang, Yiming1
  • 22
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • K. Zhang and D. Shasha. 1989. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 18:1245-1262.
    • (1989) SIAM Journal of Computing , vol.18 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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