DMCA
Efficient Approximate Entity Extraction with Edit Distance Constraints
Cached
Download Links
| Citations: | 35 - 8 self |
BibTeX
@MISC{Wang_efficientapproximate,
author = {Wei Wang and Chuan Xiao and Xuemin Lin and Chengqi Zhang},
title = {Efficient Approximate Entity Extraction with Edit Distance Constraints},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respect to a large dictionary of known entities, as the domain knowledge encoded in the dictionary helps to improve the extraction performance. In this paper, we study the problem of approximate dictionary matching with edit distance constraints. Compared to existing studies using token-based similarity constraints, our problem definition enables us to capture typographical or orthographical errors, both of which are common in entity extraction tasks yet may be missed by token-based similarity constraints. Our problem is technically challenging as existing approaches based on q-gram filtering have poor performance due to the existence of many short entities in the dictionary. Our proposed solution is based on an improved neighborhood generation method employing novel partitioning and prefix pruning techniques. We also propose an efficient document processing algorithm that minimizes unnecessary comparisons and enumerations and hence achieves good scalability. We have conducted extensive experiments on several publicly available named entity recognition datasets. The proposed algorithm outperforms alternative approaches by up to an order of magnitude.
Keyphrases
edit distance constraint efficient approximate entity extraction entity recognition token-based similarity constraint extraction performance many short entity prefix pruning technique large dictionary known entity approximate match dictionary help q-gram filtering entity extraction task unstructured text recent trend problem definition hence achieves good scalability orthographical error extensive experiment approximate dictionary matching novel partitioning entity recognition datasets domain knowledge poor performance improved neighborhood generation method alternative approach unnecessary comparison efficient document processing algorithm
