| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aerliest (0) - 4 freq airliest (1) - 6 freq erliest (1) - 1 freq earliest (2) - 19 freq ferlies (2) - 61 freq ferlie't (2) - 1 freq aerlier (2) - 8 freq aesiest (2) - 1 freq aerlie (2) - 10 freq aeasiest (2) - 1 freq kerless (3) - 1 freq airlier (3) - 16 freq marlies (3) - 1 freq aeriel (3) - 1 freq deidliest (3) - 1 freq certies (3) - 17 freq merries (3) - 6 freq teeniest (3) - 1 freq berries (3) - 26 freq ferninst (3) - 1 freq herdest (3) - 1 freq rerrest (3) - 1 freq ferthest (3) - 3 freq airies (3) - 1 freq ferlie (3) - 96 freq |
aerliest (0) - 4 freq erliest (1) - 1 freq airliest (1) - 6 freq earliest (2) - 19 freq arles (4) - 5 freq relievt (4) - 1 freq alist (4) - 2 freq erest (4) - 10 freq aulest (4) - 7 freq erles (4) - 1 freq arreist (4) - 3 freq relies (4) - 1 freq aflist (4) - 1 freq arrest (4) - 9 freq airlift (4) - 1 freq artist (4) - 27 freq realisit (4) - 1 freq airless (4) - 1 freq relient (4) - 1 freq ugliest (4) - 1 freq airtist (4) - 15 freq arabest (4) - 3 freq airnest (4) - 2 freq aerlie (4) - 10 freq aeasiest (4) - 1 freq |
SoundEx code - A642 aerliest - 4 freq airliest - 6 freq arles - 5 freq airlock - 4 freq arrol's - 1 freq airless - 1 freq auralsex - 1 freq arillas - 1 freq |
MetaPhone code - ERLST aerliest - 4 freq earliest - 19 freq erliest - 1 freq |
AERLIEST |
| Time to execute Levenshtein function - 0.233859 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.381973 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.027767 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.037370 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.000934 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. |