| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| auler (0) - 17 freq aller (1) - 1 freq aulder (1) - 243 freq aule (1) - 1 freq ouler (1) - 8 freq aul'er (1) - 1 freq auer (1) - 1 freq ruler (1) - 10 freq aaler (1) - 17 freq hauler (1) - 1 freq auller (1) - 1 freq kulter (2) - 5 freq culor (2) - 1 freq allen (2) - 2 freq paule (2) - 1 freq caumer (2) - 1 freq alles (2) - 1 freq outer (2) - 4 freq muwer (2) - 1 freq dazler (2) - 2 freq ather (2) - 3 freq aunser (2) - 2 freq a-lee (2) - 3 freq dailer (2) - 1 freq mule (2) - 4 freq |
auler (0) - 17 freq ouler (1) - 8 freq aaler (1) - 17 freq aule (2) - 1 freq ler (2) - 1 freq aller (2) - 1 freq hauler (2) - 1 freq auller (2) - 1 freq aulder (2) - 243 freq auer (2) - 1 freq aul'er (2) - 1 freq ruler (2) - 10 freq raeler (3) - 1 freq yule (3) - 78 freq leir (3) - 20 freq leer (3) - 4 freq tyler (3) - 15 freq aul' (3) - 5 freq aser (3) - 1 freq buyer (3) - 8 freq byler (3) - 3 freq alek (3) - 3 freq yauled (3) - 7 freq aver (3) - 4 freq wiler (3) - 1 freq |
SoundEx code - A460 aaler - 17 freq aul'er - 1 freq auler - 17 freq auller - 1 freq aller - 1 freq allure - 2 freq a-leary - 1 freq a-leerie - 1 freq ayallar - 4 freq €œayallar - 1 freq aulÂ’er - 1 freq aleerie' - 1 freq |
MetaPhone code - ALR aaler - 17 freq aul'er - 1 freq auler - 17 freq auller - 1 freq aller - 1 freq allure - 2 freq a-leary - 1 freq a-leerie - 1 freq aulÂ’er - 1 freq aleerie' - 1 freq |
AULER |
| Time to execute Levenshtein function - 0.182157 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.337413 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.027075 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.036722 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.000835 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. |