| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aerlier (0) - 8 freq aerlie (1) - 10 freq airlier (1) - 16 freq airier (2) - 1 freq aeriel (2) - 1 freq merrier (2) - 4 freq cerrier (2) - 1 freq aesier (2) - 13 freq aerliest (2) - 4 freq ferrier (2) - 6 freq ferlied (2) - 1 freq airlie (2) - 47 freq anerlie (2) - 68 freq ferlies (2) - 61 freq terrier (2) - 13 freq earlier (2) - 106 freq verrier (2) - 1 freq ferlie (2) - 96 freq seller (3) - 11 freq arm'er (3) - 1 freq ferliefu (3) - 3 freq crier (3) - 2 freq aalie (3) - 1 freq pearlie (3) - 1 freq eilder (3) - 1 freq |
aerlier (0) - 8 freq airlier (1) - 16 freq earlier (2) - 106 freq aerlie (2) - 10 freq airlie (3) - 47 freq raeler (3) - 1 freq aeriel (3) - 1 freq airier (3) - 1 freq relief (4) - 105 freq relies (4) - 1 freq aerial (4) - 5 freq arles (4) - 5 freq aerly (4) - 19 freq eflir (4) - 1 freq beyler (4) - 1 freq auller (4) - 1 freq airer (4) - 1 freq dealer (4) - 15 freq aurrie (4) - 1 freq raellie (4) - 16 freq ruler (4) - 10 freq efler (4) - 1 freq relied (4) - 4 freq erline (4) - 1 freq yerker (4) - 1 freq |
SoundEx code - A646 airlier - 16 freq aerlier - 8 freq |
MetaPhone code - ERLR earlier - 106 freq aerlier - 8 freq |
AERLIER |
| Time to execute Levenshtein function - 0.225494 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.505514 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.064853 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.039718 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.000836 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. |