Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
justifee (0) - 1 freq justified (2) - 9 freq justifee'd (2) - 2 freq justice (2) - 68 freq jeestifee (2) - 3 freq justihed (2) - 1 freq justine (2) - 33 freq justifies (2) - 2 freq justices (2) - 1 freq justify (2) - 14 freq testifee (2) - 1 freq jubilee (3) - 4 freq justis (3) - 2 freq stife (3) - 1 freq juistice (3) - 11 freq mystifeed (3) - 1 freq juste (3) - 3 freq gustie (3) - 3 freq justin (3) - 6 freq 'justice (3) - 1 freq justifyin (3) - 2 freq qualifee (3) - 2 freq testifees (3) - 1 freq justine's (3) - 3 freq lustie (3) - 1 freq |
justifee (0) - 1 freq justify (2) - 14 freq jeestifee (2) - 3 freq justifies (3) - 2 freq justine (3) - 33 freq justice (3) - 68 freq justified (3) - 9 freq testifee (3) - 1 freq juste (4) - 3 freq justifyin (4) - 2 freq juistice (4) - 11 freq justin (4) - 6 freq stife (4) - 1 freq justifee'd (4) - 2 freq justices (4) - 1 freq justihed (4) - 1 freq justis (4) - 2 freq testify (5) - 3 freq jestit (5) - 1 freq jester (5) - 4 freq styfie (5) - 1 freq gustfu (5) - 1 freq jestin (5) - 1 freq justly (5) - 3 freq just (5) - 1618 freq |
SoundEx code - J231 justifee - 1 freq justification - 3 freq justifyin - 2 freq justify - 14 freq justifiably - 2 freq justified - 9 freq justifies - 2 freq justifee'd - 2 freq jeestifee - 3 freq jeck-ida-box - 1 freq juist-depairts - 1 freq juxtapositions - 1 freq juxtaposit - 1 freq juxtaposition - 2 freq jkkhjdpops - 1 freq joctibeet - 2 freq justvoteimo - 1 freq |
MetaPhone code - JSTF justifee - 1 freq justify - 14 freq jeestifee - 3 freq |
JUSTIFEE |
Time to execute Levenshtein function - 0.229194 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.627532 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.073249 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.080615 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.000943 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. |