Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
keeeeebzy (0) - 2 freq weeeeeeee (4) - 1 freq teeeeeam (4) - 1 freq jeeeez (4) - 1 freq peeeee (4) - 2 freq eeeeek (4) - 1 freq eeeeeeee (4) - 1 freq keevee (4) - 1 freq peeeeee (4) - 2 freq eeeeeeeee (4) - 1 freq kneesey (4) - 1 freq peeeeeeee (4) - 2 freq seereez (4) - 1 freq eeeeeee (4) - 1 freq meeeee (4) - 1 freq peedieboy (4) - 1 freq heeeeeee (4) - 1 freq eeezy (4) - 1 freq peeeeeee (4) - 1 freq weeeee (4) - 1 freq kweekly (5) - 1 freq kneedeep (5) - 1 freq eeleeven (5) - 1 freq seelently (5) - 1 freq dee-eep (5) - 2 freq |
keeeeebzy (0) - 2 freq keevee (6) - 1 freq kneesey (6) - 1 freq seereez (6) - 1 freq eeeeek (6) - 1 freq eeezy (6) - 1 freq jeeeez (6) - 1 freq keb (7) - 2 freq keenly (7) - 8 freq byeeee (7) - 1 freq keeled (7) - 5 freq cheezy (7) - 1 freq squeezy (7) - 1 freq keepen (7) - 1 freq keeped (7) - 1 freq breezy (7) - 3 freq keelie (7) - 7 freq beez (7) - 1 freq kubby (7) - 1 freq keepet (7) - 1 freq keneen (7) - 2 freq kreepee (7) - 1 freq keekie (7) - 1 freq feebly (7) - 6 freq keener (7) - 6 freq |
SoundEx code - K120 keeps - 161 freq keep's - 3 freq kybosh - 3 freq kebbock - 2 freq kips - 3 freq keps - 6 freq kubis - 3 freq kebbuck - 5 freq kippage - 1 freq kebbok - 1 freq keb-hoose - 1 freq keep-hoose - 3 freq kfc - 5 freq ksvvkca - 1 freq kfcs - 1 freq kpj - 1 freq koyehhbiis - 1 freq kpju - 1 freq kibosh - 1 freq keeeeebzy - 2 freq kpxs - 1 freq kjjvsgo - 1 freq kbaek - 1 freq kps - 1 freq kjovoiz - 1 freq kyefis - 1 freq kbgc - 1 freq kbzjo - 1 freq |
MetaPhone code - KBS cubes - 12 freq cubs - 7 freq gubs - 1 freq gabs - 3 freq coyboys - 1 freq 'cowboys' - 1 freq gobs - 4 freq quoybeezie - 1 freq cobs - 1 freq gabsie - 1 freq kubis - 3 freq cooboys - 4 freq cowboys - 3 freq cabbies - 1 freq cobbis - 1 freq gobbs - 20 freq qubsu - 1 freq cabesy - 5 freq cbus - 1 freq keeeeebzy - 2 freq |
KEEEEEBZY |
Time to execute Levenshtein function - 0.341724 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.417099 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.032576 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.037551 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.001108 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. |