| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aumrie (0) - 3 freq aurrie (1) - 1 freq glaumrie (2) - 5 freq dumpie (2) - 1 freq aumrie's (2) - 1 freq currie (2) - 1 freq a'mie (2) - 1 freq auntie (2) - 157 freq ourie (2) - 3 freq lurie (2) - 1 freq aumry (2) - 1 freq apirie (2) - 1 freq durie (2) - 1 freq sumwie (2) - 1 freq furie (2) - 13 freq burie (2) - 4 freq gurrie (2) - 1 freq pumpie (2) - 2 freq cumbie (2) - 1 freq jaurie (2) - 1 freq maimrie (2) - 2 freq imrie (2) - 1 freq caurie (2) - 2 freq humbie (2) - 1 freq hurrie (2) - 1 freq |
aumrie (0) - 3 freq imrie (2) - 1 freq aurrie (2) - 1 freq aumry (2) - 1 freq maumie (3) - 6 freq memrie (3) - 5 freq caurie (3) - 2 freq maimrie (3) - 2 freq airie (3) - 1 freq curie (3) - 1 freq mairie (3) - 1 freq mri (3) - 1 freq amyire (3) - 1 freq marie (3) - 212 freq urie (3) - 1 freq jaurie (3) - 1 freq comrie (3) - 1 freq gamrie (3) - 5 freq amore (3) - 1 freq durie (3) - 1 freq apirie (3) - 1 freq lurie (3) - 1 freq moorie (3) - 5 freq furie (3) - 13 freq ourie (3) - 3 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 - AMR ah'mur - 3 freq amber - 13 freq aumry - 1 freq amor - 1 freq amara - 1 freq amore - 1 freq aumrie - 3 freq amour - 1 freq €˜amber - 1 freq amorra - 2 freq |
AUMRIE |
| Time to execute Levenshtein function - 0.275153 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.468076 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.034949 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.039765 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.000927 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. |