A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Integrating Approximate String Matching with Phonetic String Similarity
[chapter]
2018
Lecture Notes in Computer Science
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
doi:10.1007/978-3-319-98398-1_12
fatcat:3yv37457qfhclm2z6xdfxrizdq