Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
leaves (0) - 203 freq leeves (1) - 19 freq leaven (1) - 1 freq laves (1) - 3 freq sleaves (1) - 1 freq loaves (1) - 5 freq leave (1) - 447 freq weaves (1) - 8 freq heaves (1) - 2 freq cleaves (1) - 1 freq leavers (1) - 1 freq leives (1) - 3 freq leave's (1) - 1 freq leaves' (1) - 1 freq eaves (1) - 2 freq leavans (2) - 1 freq lakes (2) - 2 freq maves (2) - 8 freq leeven (2) - 2 freq learns (2) - 10 freq heavey (2) - 1 freq leevels (2) - 1 freq cleaver (2) - 4 freq eares (2) - 1 freq ledges (2) - 3 freq |
leaves (0) - 203 freq loaves (1) - 5 freq leeves (1) - 19 freq laves (1) - 3 freq leives (1) - 3 freq lives (2) - 236 freq levies (2) - 1 freq loves (2) - 63 freq laeves (2) - 16 freq luves (2) - 16 freq elves (2) - 10 freq leaves' (2) - 1 freq eaves (2) - 2 freq leave's (2) - 1 freq leave (2) - 447 freq sleaves (2) - 1 freq leaven (2) - 1 freq heaves (2) - 2 freq weaves (2) - 8 freq cleaves (2) - 1 freq leavers (2) - 1 freq elvis (3) - 11 freq waves (3) - 137 freq leas (3) - 14 freq leans (3) - 16 freq |
SoundEx code - L120 lives - 236 freq leafs - 43 freq lips - 193 freq leaves - 203 freq loofs - 6 freq life's - 64 freq laifs - 2 freq luves - 16 freq leeves - 19 freq love's - 12 freq loves - 63 freq loups - 6 freq laps - 7 freq lifes - 48 freq lowps - 29 freq laves - 3 freq leaps - 7 freq luve's - 5 freq lavvies - 10 freq loabbies - 5 freq lobby's - 1 freq lyfe's - 4 freq lyfis - 1 freq levies - 1 freq lobbies - 3 freq luve''s - 1 freq lapis - 1 freq lavish - 2 freq leps - 1 freq luvs - 11 freq loops - 4 freq lippies - 1 freq lawvies - 1 freq loafs - 9 freq 'life's - 1 freq lobs - 1 freq loofache - 1 freq lyf's - 1 freq laeves - 16 freq labs - 3 freq laefs - 2 freq leave's - 1 freq löfs - 1 freq lups - 1 freq lawfowk - 1 freq libs - 1 freq lævs - 1 freq luifs - 5 freq lifcs - 1 freq leefs - 1 freq leifs - 3 freq loufs - 1 freq luipkie - 1 freq leives - 3 freq lovies - 1 freq €˜lips - 2 freq livvy's - 3 freq liv's - 1 freq lavvy's - 1 freq lubeck - 2 freq loaves - 5 freq lapse - 2 freq lives' - 1 freq lhfic - 1 freq llfox - 1 freq lepps - 1 freq lifeÂ’s - 2 freq labs' - 1 freq lbc - 1 freq lbk - 1 freq lvsz - 1 freq lepucy - 1 freq leaves' - 1 freq lvg - 1 freq lfc - 4 freq lufc - 2 freq livvys - 1 freq lbx - 1 freq lvfeze - 1 freq |
MetaPhone code - LFS lives - 236 freq leafs - 43 freq leaves - 203 freq loofs - 6 freq life's - 64 freq laifs - 2 freq luves - 16 freq leeves - 19 freq love's - 12 freq loves - 63 freq laughs - 56 freq lifes - 48 freq laves - 3 freq luve's - 5 freq lavvies - 10 freq lyfe's - 4 freq lyfis - 1 freq levies - 1 freq luve''s - 1 freq luvs - 11 freq lawvies - 1 freq loafs - 9 freq 'life's - 1 freq lyf's - 1 freq laeves - 16 freq laaghs - 3 freq laefs - 2 freq leave's - 1 freq löfs - 1 freq loghs - 1 freq lævs - 1 freq luifs - 5 freq leefs - 1 freq leifs - 3 freq loufs - 1 freq leives - 3 freq lovies - 1 freq livvy's - 3 freq liv's - 1 freq lavvy's - 1 freq loaves - 5 freq lives' - 1 freq life’s - 2 freq leaves' - 1 freq livvys - 1 freq |
LEAVES |
Time to execute Levenshtein function - 0.214786 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.353753 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.028014 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.047709 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.001119 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. |