| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aerlier (0) - 8 freq airlier (1) - 16 freq aerlie (1) - 10 freq earlier (2) - 109 freq ferlied (2) - 1 freq aeriel (2) - 1 freq verrier (2) - 1 freq ferlie (2) - 96 freq ferrier (2) - 6 freq anerlie (2) - 68 freq airlie (2) - 47 freq aesier (2) - 13 freq airier (2) - 1 freq terrier (2) - 13 freq merrier (2) - 4 freq ferlies (2) - 61 freq cerrier (2) - 1 freq aerliest (2) - 4 freq sairlie (3) - 6 freq deilie (3) - 2 freq cherlie (3) - 133 freq warlie (3) - 2 freq aeter (3) - 1 freq oilier (3) - 1 freq jerrie (3) - 5 freq |
aerlier (0) - 8 freq airlier (1) - 16 freq earlier (2) - 109 freq aerlie (2) - 10 freq airlie (3) - 47 freq raeler (3) - 1 freq airier (3) - 1 freq aeriel (3) - 1 freq eflir (4) - 1 freq aaler (4) - 17 freq efler (4) - 1 freq meeler (4) - 1 freq parler (4) - 2 freq uglier (4) - 1 freq relief (4) - 109 freq arles (4) - 5 freq fylier (4) - 1 freq relied (4) - 4 freq yerker (4) - 1 freq elyer (4) - 1 freq earrier (4) - 1 freq raellie (4) - 18 freq dealer (4) - 15 freq raelie (4) - 3 freq auler (4) - 17 freq |
SoundEx code - A646 airlier - 16 freq aerlier - 8 freq |
MetaPhone code - ERLR earlier - 109 freq aerlier - 8 freq |
AERLIER |
| Time to execute Levenshtein function - 0.192002 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.353603 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.028735 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.038649 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.000949 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. |