Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
laavets (0) - 1 freq leave's (2) - 1 freq leaves (2) - 208 freq laeves (2) - 16 freq loaves (2) - 5 freq leavers (2) - 1 freq laayers (2) - 30 freq laves (2) - 3 freq laavie (3) - 1 freq staves (3) - 2 freq jaykets (3) - 1 freq slaves (3) - 18 freq lawvies (3) - 1 freq vets (3) - 9 freq lavins (3) - 1 freq laens (3) - 1 freq faves (3) - 3 freq markets (3) - 3 freq laits (3) - 2 freq tarves (3) - 8 freq duvets (3) - 1 freq jaikets (3) - 13 freq havers (3) - 35 freq laeve (3) - 37 freq daves (3) - 2 freq |
laavets (0) - 1 freq leavers (3) - 1 freq laves (3) - 3 freq loaves (3) - 5 freq leave's (3) - 1 freq laeves (3) - 16 freq leaves (3) - 208 freq levels (4) - 66 freq leets (4) - 18 freq luvers (4) - 12 freq leeves (4) - 19 freq love's (4) - 12 freq lats (4) - 26 freq luve's (4) - 5 freq caveats (4) - 1 freq levers (4) - 6 freq leemets (4) - 1 freq lavvies (4) - 10 freq lovers (4) - 20 freq velvets (4) - 1 freq lets (4) - 74 freq lates (4) - 2 freq leevels (4) - 1 freq loves (4) - 68 freq lives (4) - 241 freq |
SoundEx code - L132 lifts - 42 freq lapdug - 4 freq lapdug's - 1 freq liftcd - 1 freq layaboots - 1 freq lufts - 2 freq 'leftish' - 1 freq lapdog - 2 freq lift's - 2 freq laavets - 1 freq lofts - 1 freq lap-dug - 1 freq left's - 1 freq life-thochts - 1 freq leviticus - 4 freq leftist - 1 freq low-pitched - 1 freq lbahttdxhf - 1 freq lvtxl - 1 freq |
MetaPhone code - LFTS lifts - 42 freq lights - 104 freq lufts - 2 freq light's - 2 freq lift's - 2 freq laavets - 1 freq lights' - 1 freq lofts - 1 freq lyght's - 1 freq left's - 1 freq |
LAAVETS |
Time to execute Levenshtein function - 0.196237 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.379584 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.027740 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.038074 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.000949 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. |