Abstract:
|
Within the context of the approximate searching of names in a DB, we
discuss searching techniques for the DEA distance function. A very
efficient technique is presented based on a Trie tree. Also, an
easy-to-implement technique is presented based on the relationships
between bigrams and simple edit distance. |