Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
aleevin (0) - 1 freq eleevin (1) - 4 freq leevin (1) - 195 freq jleevin (1) - 1 freq aleevint (1) - 1 freq eevin (2) - 5 freq arreevin (2) - 1 freq leivin (2) - 62 freq cleekin (2) - 11 freq fleerin (2) - 4 freq leevit (2) - 4 freq deevin (2) - 4 freq fleetin (2) - 20 freq leerin (2) - 5 freq alivin (2) - 1 freq eleivin (2) - 1 freq cleavin (2) - 1 freq sleepin (2) - 160 freq meevin (2) - 17 freq fleein (2) - 174 freq alterin (2) - 2 freq leavin (2) - 187 freq theevin (2) - 1 freq aleen (2) - 97 freq gleekin (2) - 4 freq |
aleevin (0) - 1 freq leevin (1) - 195 freq eleevin (1) - 4 freq alivin (2) - 1 freq eleivin (2) - 1 freq leavin (2) - 187 freq eleeven (2) - 35 freq leeven (2) - 2 freq laevin (2) - 12 freq aleyven (2) - 2 freq aleevint (2) - 1 freq jleevin (2) - 1 freq leivin (2) - 62 freq levin (2) - 1 freq eleevan (2) - 1 freq beleevin (3) - 1 freq heevin (3) - 9 freq leetin (3) - 5 freq leeving (3) - 1 freq aleeve (3) - 1 freq reevin (3) - 3 freq luvin (3) - 26 freq leven (3) - 17 freq eleven (3) - 38 freq leavan (3) - 2 freq |
SoundEx code - A415 aleevint - 1 freq album - 24 freq albums - 8 freq albania - 1 freq alban - 3 freq aleyven - 2 freq alpin - 7 freq alfenus - 1 freq aa-lappin - 8 freq alven - 1 freq alfounder - 1 freq alpinson - 1 freq albanian - 1 freq alabama - 2 freq albion - 3 freq aliveness - 2 freq aleevin - 1 freq alpine - 2 freq allophone - 1 freq albino - 2 freq alvinstraight - 1 freq alivin - 1 freq albannach - 8 freq albans - 1 freq alibammm - 2 freq |
MetaPhone code - ALFN aleyven - 2 freq alven - 1 freq aleevin - 1 freq allophone - 1 freq alivin - 1 freq |
ALEEVIN |
Time to execute Levenshtein function - 0.199594 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.408529 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.027340 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.037289 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.000896 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. |