| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lizbain (0) - 1 freq lizard (3) - 32 freq lippan (3) - 1 freq livin (3) - 336 freq tizin (3) - 3 freq lizzie (3) - 113 freq liinnin (3) - 1 freq linkin (3) - 15 freq lippin (3) - 9 freq littlin (3) - 17 freq bain (3) - 77 freq linnin (3) - 2 freq disdain (3) - 10 freq jibblin (3) - 1 freq lain (3) - 18 freq likkin (3) - 1 freq dizin (3) - 3 freq limpin (3) - 3 freq vizzyin (3) - 1 freq likenin (3) - 2 freq giban (3) - 1 freq lobbyin (3) - 2 freq lissnin (3) - 2 freq rizzin (3) - 1 freq i'rain (3) - 10 freq |
lizbain (0) - 1 freq lobbin (4) - 4 freq lazin (4) - 4 freq lambin (4) - 19 freq libyan (4) - 1 freq lobbyin (4) - 2 freq lisbon (4) - 2 freq lerbin (4) - 2 freq lamban (4) - 2 freq elbain (4) - 1 freq libbie (5) - 1 freq livan (5) - 6 freq bizzin (5) - 17 freq libary (5) - 1 freq bliban (5) - 1 freq littin (5) - 10 freq climbin (5) - 18 freq uizin (5) - 12 freq lirkin (5) - 1 freq linin (5) - 10 freq pizenin (5) - 1 freq louvain (5) - 1 freq mcbain (5) - 15 freq dizzin (5) - 1 freq limnin (5) - 1 freq |
SoundEx code - L215 lggpin-in - 1 freq lisbon - 2 freq lesb-i-an - 1 freq lesbian - 11 freq €˜lesbian - 1 freq lcafmee - 1 freq lwgbmse - 1 freq lugphones - 1 freq lizbain - 1 freq lazybones - 1 freq |
MetaPhone code - LSBN lisbon - 2 freq lesb-i-an - 1 freq lesbian - 11 freq €˜lesbian - 1 freq lizbain - 1 freq |
LIZBAIN |
| Time to execute Levenshtein function - 0.492172 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.811827 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.080038 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.093511 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.001111 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. |