| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lenabellina (0) - 1 freq labellin (3) - 1 freq levellin' (4) - 3 freq labellit (4) - 1 freq levellin (4) - 5 freq liviabellona (4) - 2 freq embellish (5) - 2 freq travellin (5) - 14 freq cancelling (5) - 1 freq re-tellin (5) - 1 freq cancellin (5) - 1 freq snivelling (5) - 1 freq hansellin (5) - 3 freq retellin (5) - 4 freq recallin (5) - 1 freq unravellin (5) - 1 freq enrolling (5) - 1 freq snivellin (5) - 1 freq serabblin (5) - 1 freq lanabanana (5) - 6 freq legpullin (5) - 1 freq tinsellin (5) - 1 freq weaselin (5) - 1 freq pedallin (5) - 1 freq lenathehyena (5) - 14 freq |
lenabellina (0) - 1 freq labellin (4) - 1 freq liviabellona (5) - 2 freq levellin (6) - 5 freq labellit (6) - 1 freq ransellin (7) - 1 freq snivellin (7) - 1 freq labellt (7) - 1 freq lanabanana (7) - 6 freq nabblin (7) - 1 freq rebellion (7) - 36 freq eyeballin (7) - 6 freq tinsellin (7) - 1 freq legpullin (7) - 1 freq hansellin (7) - 3 freq henbell (7) - 2 freq levellin' (7) - 3 freq bellin (7) - 3 freq cancellin (7) - 1 freq labelled (7) - 13 freq penicillin (7) - 5 freq ladelin (8) - 1 freq revellin (8) - 3 freq handsellin (8) - 3 freq danbell (8) - 2 freq |
SoundEx code - L514 lamplicht - 5 freq lamplit - 1 freq limply - 2 freq lamp-licht - 1 freq lamplugh - 1 freq line-bi-line - 1 freq lamplight - 5 freq lee-enfields - 1 freq lamplichts - 1 freq lampless - 1 freq lamp-lit - 1 freq linfield - 2 freq lenabellina - 1 freq liamflynn - 7 freq |
MetaPhone code - LNBLN line-bi-line - 1 freq lenabellina - 1 freq |
LENABELLINA |
| Time to execute Levenshtein function - 0.220283 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.451006 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.030724 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.037540 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.000850 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. |