Integrating Approximate String Matching with Phonetic String Similarity


Well-defined dictionaries of tagged entities are used in many tasks to identify entities where the scope is limited and there is no need to use machine learning. One common solution is to encode the input dictionary into Trie trees to find matches on an input text. However, the size of the dictionary and the presence of spelling errors on the input tokens have a negative influence on such solutions. We present an approach that transforms the dictionary and each input token into a compact well-known phonetic representation. The resulting dictionary is encoded in a Trie that is about 72{\%} smaller than a non-phonetic Trie. We perform inexact matching over this representation to filter a set of initial results. Lastly, we apply a second similarity measure to filter the best result to annotate a given entity. The experiments showed that it achieved good F1 results. The solution was developed as an entity recognition plug-in for GATE, a well-known information extraction framework.






	author    = {Ferri, Junior and Tissot, Hegler and Del Fabro, Marcos Didonet},
	title     = {Integrating Approximate String Matching with Phonetic String Similarity},
	editor    = {Bencz{\'u}r, Andr{\'a}s and Thalheim, Bernhard and Horv{\'a}th, Tom{\'a}{{s}}},
	booktitle = {Advances in Databases and Information Systems},
	year      = {2018},
	publisher = {Springer International Publishing},
	address   = {Cham},
	pages     = {173--181},
	isbn      = {978-3-319-98398-1}