| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anhere (0) - 1 freq adhere (1) - 7 freq acher (2) - 1 freq anser (2) - 5 freq anters (2) - 1 freq manere (2) - 2 freq 'where (2) - 15 freq anee (2) - 1 freq 'there (2) - 50 freq €œhere (2) - 20 freq affere (2) - 1 freq anger (2) - 73 freq tamhere (2) - 1 freq ashore (2) - 35 freq a'where (2) - 1 freq there (2) - 6822 freq unherd (2) - 2 freq aner (2) - 2 freq ahern (2) - 1 freq 'here (2) - 51 freq anders (2) - 1 freq -here (2) - 1 freq awhare (2) - 2 freq anter (2) - 1 freq asher (2) - 1 freq |
anhere (0) - 1 freq adhere (2) - 7 freq asher (3) - 1 freq anter (3) - 1 freq ihere (3) - 6 freq awhare (3) - 2 freq 'here (3) - 51 freq -here (3) - 1 freq yhere (3) - 1 freq anther (3) - 2 freq behere (3) - 2 freq chere (3) - 1 freq ather (3) - 3 freq anywhere (3) - 33 freq where (3) - 739 freq aner (3) - 2 freq here (3) - 4207 freq unherd (3) - 2 freq anser (3) - 5 freq nhr (3) - 1 freq ashore (3) - 35 freq anger (3) - 73 freq acher (3) - 1 freq there (3) - 6822 freq ochre (4) - 4 freq |
SoundEx code - A560 ah'mur - 3 freq anywhere - 33 freq ahunner - 1 freq anhere - 1 freq aonner - 1 freq any-whar - 1 freq awner - 4 freq anywhar - 2 freq aumry - 1 freq amor - 1 freq amara - 1 freq aaner - 1 freq amore - 1 freq aumrie - 3 freq ainer - 2 freq anar - 1 freq anywherr - 1 freq anywhaur - 2 freq anurr - 4 freq anurra - 3 freq amour - 1 freq amyire - 1 freq annmari - 2 freq anr - 1 freq anywhur - 2 freq amorra - 2 freq aner - 2 freq |
MetaPhone code - ANHR anywhere - 33 freq anhere - 1 freq any-whar - 1 freq anywhar - 2 freq anywherr - 1 freq anywhaur - 2 freq anywhur - 2 freq |
ANHERE |
| Time to execute Levenshtein function - 0.208144 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.361799 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.031446 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.039669 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001019 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |