| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aonner (0) - 1 freq donner (1) - 2 freq tonner (1) - 1 freq gonner (1) - 1 freq wonner (1) - 5 freq conner (1) - 2 freq onner (1) - 3 freq ponner (1) - 1 freq yonner (1) - 67 freq annex (2) - 4 freq doner (2) - 2 freq wonnert (2) - 11 freq rinner (2) - 13 freq wonder (2) - 140 freq loner (2) - 1 freq tinner (2) - 1 freq agnne (2) - 1 freq monger (2) - 1 freq henner (2) - 3 freq runner (2) - 19 freq longer (2) - 72 freq concer (2) - 1 freq aunter (2) - 2 freq unner (2) - 461 freq aower (2) - 1 freq |
aonner (0) - 1 freq yonner (1) - 67 freq onner (1) - 3 freq donner (2) - 2 freq onnir (2) - 1 freq inner (2) - 46 freq unner (2) - 461 freq ponner (2) - 1 freq tonner (2) - 1 freq gonner (2) - 1 freq wonner (2) - 5 freq conner (2) - 2 freq anger (3) - 73 freq ahunner (3) - 1 freq ooner (3) - 2 freq onnher (3) - 1 freq hinner (3) - 46 freq funner (3) - 1 freq joiner (3) - 14 freq joyner (3) - 1 freq goner (3) - 4 freq daenner (3) - 1 freq connor (3) - 5 freq hunner (3) - 442 freq anter (3) - 1 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 - ANR aonner - 1 freq awner - 4 freq aaner - 1 freq ainer - 2 freq anar - 1 freq anurr - 4 freq anurra - 3 freq anr - 1 freq aner - 2 freq |
AONNER |
| Time to execute Levenshtein function - 0.218120 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.406693 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.029972 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.039462 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. |