| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lilianedwards (0) - 2 freq landwards (4) - 1 freq landward (5) - 6 freq landwords (5) - 1 freq rickedwards (5) - 2 freq heavenwards (6) - 1 freq gillanders (6) - 1 freq vineyards (6) - 3 freq liftwards (6) - 1 freq vilipendars (6) - 2 freq inwards (6) - 7 freq taewards (6) - 186 freq lipliners (6) - 1 freq hamewards (6) - 2 freq slawards (6) - 1 freq landlairds (6) - 1 freq standards (6) - 35 freq aifterwards (6) - 3 freq edwards (6) - 5 freq landwart (6) - 11 freq landmarks (6) - 1 freq lendwirds (6) - 4 freq joedwards (6) - 10 freq eftirwards (7) - 2 freq julianbrans (7) - 3 freq |
lilianedwards (0) - 2 freq landwards (5) - 1 freq landwords (6) - 1 freq lendwirds (7) - 4 freq landward (7) - 6 freq landlairds (8) - 1 freq rickedwards (8) - 2 freq edwards (9) - 5 freq landwart (9) - 11 freq standards (9) - 35 freq len-words (9) - 1 freq lonnwirds (9) - 2 freq len-wirds (9) - 4 freq landmarks (9) - 1 freq joedwards (9) - 10 freq liftwards (9) - 1 freq gillanders (9) - 1 freq heavenwards (9) - 1 freq inwards (9) - 7 freq slawards (9) - 1 freq lowlanders (10) - 1 freq lawlanders (10) - 1 freq landers (10) - 10 freq inwairds (10) - 1 freq blindfolds (10) - 1 freq |
SoundEx code - L453 lawlands - 4 freq lowland - 32 freq lowlands - 5 freq lowlanders - 1 freq lawland - 20 freq lawlander - 1 freq lawlanders - 1 freq lowlands-l - 5 freq lowlander - 1 freq €œlowlands - 1 freq lilianedwards - 2 freq |
MetaPhone code - LLNTWRTS lilianedwards - 2 freq |
LILIANEDWARDS |
| Time to execute Levenshtein function - 0.224597 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.399180 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.027728 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.040805 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.001091 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. |