The Community for Technology Leaders
2012 IEEE 28th International Conference on Data Engineering (2012)
Arlington, Virginia USA
Apr. 1, 2012 to Apr. 5, 2012
ISSN: 1084-4627
ISBN: 978-0-7695-4747-3
pp: 762-773
ABSTRACT
Dictionary-based entity extraction has attracted much attention from the database community recently, which locates sub strings in a document into predefined entities (e.g., person names or locations). To improve extraction recall, a recent trend is to provide approximate matching between sub strings of the document and entities by tolerating minor errors. In this paper we study dictionary-based approximate entity extraction with edit-distance constraints. Existing methods have several limitations. First, they need to tune many parameters to achieve high performance. Second, they are inefficient for large edit-distance thresholds. We propose a trie-based method to address these problems. We first partition each entity into a set of segments, and then use a trie structure to index segments. To extract similar entities, we search segments from the document, and extend the matching segments in both entities and the document to find similar pairs. We develop an extension-based method to efficiently find similar string pairs by extending the matching segments. We optimize our partition scheme and select the best partition strategy to improve the extraction performance. Experimental results show that our method achieves much higher performance compared with state-of-the-art studies.
INDEX TERMS
CITATION

D. Deng, J. Feng and G. Li, "An Efficient Trie-based Method for Approximate Entity Extraction with Edit-Distance Constraints," 2012 IEEE 28th International Conference on Data Engineering(ICDE), Arlington, Virginia USA, 2012, pp. 762-773.
doi:10.1109/ICDE.2012.29
96 ms
(Ver 3.3 (11022016))