메뉴 건너뛰기




Volumn 3406, Issue , 2005, Pages 510-521

Incremental information extraction using tree-based context representations

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTATIONAL LINGUISTICS; CONTEXT FREE LANGUAGES; DATA REDUCTION; EXTRACTION; MATHEMATICAL MODELS; SEMANTICS; TEXT PROCESSING; TREES (MATHEMATICS);

EID: 24344471378     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30586-6_55     Document Type: Conference Paper
Times cited : (3)

References (22)
  • 3
    • 78049288875 scopus 로고    scopus 로고
    • Mistake-driven learning in text categorization
    • C. Cardie and R. Weischedel, editors, Proceedings of EMNLP-97, Providence, US, 1997. Association for Computational Linguistics
    • I. Dagan, Y. Karov, and D. Roth. Mistake-driven learning in text categorization. In C. Cardie and R. Weischedel, editors, Proceedings of EMNLP-97, 2nd Conference on Empirical Methods in Natural Language Processing, pages 55-63, Providence, US, 1997. Association for Computational Linguistics.
    • 2nd Conference on Empirical Methods in Natural Language Processing , pp. 55-63
    • Dagan, I.1    Karov, Y.2    Roth, D.3
  • 7
    • 84905866214 scopus 로고    scopus 로고
    • Boosted wrapper induction
    • D. Freitag and N. Kushmerick. Boosted wrapper induction. In AAAI/IAAI, pages 577-583, 2000.
    • (2000) AAAI/IAAI , pp. 577-583
    • Freitag, D.1    Kushmerick, N.2
  • 9
    • 24344492886 scopus 로고    scopus 로고
    • JTidy. http://jtidy.sourceforge.net/.
  • 11
    • 34250091945 scopus 로고
    • Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
    • N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
    • (1988) Machine Learning , vol.2 , pp. 285-318
    • Littlestone, N.1
  • 12
    • 33947709854 scopus 로고    scopus 로고
    • Bayesian information extraction network
    • L. Peshkin and A. Pfeffer. Bayesian information extraction network. In IJCAI, 2003.
    • (2003) IJCAI
    • Peshkin, L.1    Pfeffer, A.2
  • 13
    • 84880912564 scopus 로고    scopus 로고
    • Relational learning via propositional algorithms: An information extraction case study
    • D. Roth and W.-t. Yih. Relational learning via propositional algorithms: An information extraction case study. In IJCAI, 2001.
    • (2001) IJCAI
    • Roth, D.1    Yih, W.-T.2
  • 15
    • 24344474696 scopus 로고    scopus 로고
    • A shallow algorithm for correcting nesting errors and other well-formedness violations in XML-like input
    • C. Siefkes. A shallow algorithm for correcting nesting errors and other well-formedness violations in XML-like input. In Extreme Markup Languages (EML) 2004, 2004.
    • (2004) Extreme Markup Languages (EML) 2004
    • Siefkes, C.1
  • 16
    • 35048865513 scopus 로고    scopus 로고
    • Combining Winnow and orthogonal sparse bigrams for incremental spam filtering
    • J.-F. Boulicaut, F. Esposito, F. Giannotti, and D. Pedreschi, editors, Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2004), Springer
    • C. Siefkes, F. Assis, S. Chhabra, and W. S. Yerazunis. Combining Winnow and orthogonal sparse bigrams for incremental spam filtering. In J.-F. Boulicaut, F. Esposito, F. Giannotti, and D. Pedreschi, editors, Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2004), volume 3202 of Lecture Notes in Artificial Intelligence, pages 410-421. Springer, 2004.
    • (2004) Lecture Notes in Artificial Intelligence , vol.3202 , pp. 410-421
    • Siefkes, C.1    Assis, F.2    Chhabra, S.3    Yerazunis, W.S.4
  • 18
    • 24344456924 scopus 로고    scopus 로고
    • Trainable Information Extractor. http://www.inf.fu-berlin.de/inst/ag-db/software/tie/.
  • 19
    • 24344463714 scopus 로고    scopus 로고
    • TreeTagger. http://www.ims.uni-stuttgart.de/projekte/corplex/TreeTagger/.
  • 20
    • 24344435405 scopus 로고    scopus 로고
    • txt2html. http://txt2html.sourceforge.net/.
  • 21
    • 0003607366 scopus 로고    scopus 로고
    • 2004. W3C Working Draft, 29 October
    • XML Path Language (XPath) 2.0, 2004. W3C Working Draft, 29 October 2004.
    • (2004) XML Path Language (XPath) 2.0
  • 22
    • 24344454206 scopus 로고    scopus 로고
    • Feature-rich memory-based classification for shallow NLP and information extraction
    • J. Franke, G. Nakhaeizadeh, and I. Renz, editors, Springer Physica
    • J. Zavrel and W. Daelemans. Feature-rich memory-based classification for shallow NLP and information extraction. In J. Franke, G. Nakhaeizadeh, and I. Renz, editors, Text Mining, Theoretical Aspects and Applications, pages 33-54. Springer Physica, 2003.
    • (2003) Text Mining, Theoretical Aspects and Applications , pp. 33-54
    • Zavrel, J.1    Daelemans, W.2


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