| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lion-freens (0) - 1 freq unfreens (4) - 1 freq sin-sheen (5) - 1 freq longarenus (5) - 1 freq conteens (5) - 3 freq leddy-friens (5) - 1 freq unfriens (5) - 2 freq linens (5) - 1 freq time-free (5) - 1 freq freens (5) - 242 freq girlfreend (5) - 4 freq lantrens (5) - 2 freq lime-tree (5) - 1 freq winscreen (5) - 1 freq livveens (5) - 1 freq lioness (5) - 2 freq scot-free (5) - 4 freq signifees (5) - 1 freq unfreen (5) - 1 freq pioneers (5) - 3 freq dial-steens (5) - 1 freq life-rent (5) - 1 freq linktree (5) - 1 freq sionifies (5) - 1 freq girlfreen (5) - 1 freq |
lion-freens (0) - 1 freq unfreens (6) - 1 freq unfriens (7) - 2 freq lantrens (7) - 2 freq leddy-friens (7) - 1 freq un-freenly (7) - 1 freq longarenus (7) - 1 freq girlfreins (8) - 1 freq life-rent (8) - 1 freq eco-freenly (8) - 1 freq landeens (8) - 1 freq hat-preens (8) - 1 freq unfreends (8) - 3 freq lanterns (8) - 7 freq €˜freens (8) - 1 freq lo-res (8) - 1 freq unfreen (8) - 1 freq linens (8) - 1 freq life-forms (8) - 1 freq freens (8) - 242 freq lenterns (8) - 1 freq in-lyins (9) - 1 freq lion-hertit (9) - 1 freq weemen-freends (9) - 1 freq longforgan (9) - 4 freq |
SoundEx code - L516 lambert - 3 freq lumbers - 3 freq lumber - 5 freq lumper's - 1 freq lan-afore - 1 freq lumberin - 1 freq lambrusco - 2 freq lumbert - 7 freq lumbered - 1 freq laun-brist - 1 freq llanbryde - 1 freq lumberjack - 1 freq lion-freens - 1 freq lumpur - 2 freq limber - 2 freq lamborghini - 10 freq lamborghinis - 1 freq lumburt - 1 freq lombarda - 1 freq lambretta - 1 freq limpar - 1 freq |
MetaPhone code - LNFRNS lion-freens - 1 freq |
LION-FREENS |
| Time to execute Levenshtein function - 0.200130 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.376972 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.027579 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.041421 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.000813 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. |