摘要
针对现有基于网页结构信息抽取技术的不足,提出一种基于确定性树自动机DTA(deterministic tree automaton)的信息抽取技术。其核心思想是通过将HTML文档转换成二叉树的形式,然后依据树自动机对待抽取网页的接收和拒绝状态进行数据的抽取。该方法充分利用了HTML文档的树状结构。依托树自动机将传统的以单一结构途径的信息抽取与文法推理两者相结合。经实验证明与同类抽取方法相比在准确率、召回率以及抽取所需时间上均有所提高。
In light of the deficiency of existing information extraction techniques based on webpage structure, in this paper we propose an information extraction technique based on deterministic tree automata (DTA). The core idea of it is to transform the HTML document to binary tree, and then extract the data according to the acceptance and rejection state of DTA on its webpage extraction. The method makes the full use of tree structure of HTML documents and combines conventional information extraction in single structure route with grammar inference relying on DTA. Experimental results shows that the approach with DTA improves the precision, recall rate and time of extraction comparing with other similar extraction methods.
出处
《计算机应用与软件》
CSCD
2009年第12期228-230,250,共4页
Computer Applications and Software
关键词
树自动机
信息抽取
HTML
Tree automata Information extraction HTML