| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lanabanana (0) - 6 freq loubanana (3) - 1 freq lananin (4) - 1 freq banana (4) - 45 freq annaa (5) - 1 freq latharna (5) - 6 freq lebanon (5) - 7 freq alabama (5) - 2 freq aibagawa (5) - 3 freq rannan (5) - 1 freq lannin (5) - 2 freq catamaran (5) - 1 freq lairnan (5) - 3 freq naaaaa (5) - 1 freq laaghan (5) - 1 freq laarant (5) - 1 freq snabaa (5) - 1 freq marianna (5) - 1 freq aaaamang (5) - 1 freq annan' (5) - 1 freq savanna (5) - 2 freq agaaaaaa (5) - 1 freq laaaaaaaang (5) - 1 freq dalhanna (5) - 1 freq lanrang (5) - 2 freq |
lanabanana (0) - 6 freq loubanana (4) - 1 freq lananin (5) - 1 freq albanian (6) - 1 freq lebanon (6) - 7 freq banana (6) - 45 freq lannin (6) - 2 freq linnean (7) - 1 freq lamban (7) - 2 freq lenabellina (7) - 1 freq learnan (7) - 2 freq laenan (7) - 1 freq unmeanan (7) - 1 freq plannan (7) - 2 freq landan (7) - 2 freq lankan (7) - 2 freq vannan (7) - 1 freq lausanne (7) - 1 freq nanna (7) - 1 freq leanan (7) - 4 freq fannan (7) - 1 freq albania (7) - 1 freq ladybank (7) - 1 freq bannan (7) - 1 freq jonanan (7) - 1 freq |
SoundEx code - L515 lampin - 6 freq lambin - 19 freq lanfine - 1 freq lamban - 2 freq lambing - 1 freq limpin - 3 freq lambeen - 3 freq lampan - 1 freq lumpen - 1 freq lumpin - 1 freq €˜lambing - 1 freq lambeens - 2 freq lumphinnans - 1 freq lumphanan - 1 freq lanabanana - 6 freq |
MetaPhone code - LNBNN lanabanana - 6 freq |
LANABANANA |
| Time to execute Levenshtein function - 0.258086 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.384747 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.028633 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.038044 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.000910 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. |