| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| justify (0) - 14 freq justly (2) - 3 freq justis (2) - 2 freq stify (2) - 1 freq testify (2) - 3 freq justifee (2) - 1 freq justifyin (2) - 2 freq justine (2) - 33 freq justin (2) - 6 freq justice (2) - 67 freq gustin (3) - 1 freq gustie (3) - 3 freq justa (3) - 1 freq rustin (3) - 5 freq dustir (3) - 1 freq musty (3) - 2 freq busily (3) - 6 freq jutish (3) - 1 freq rustic (3) - 3 freq mortify (3) - 1 freq rectify (3) - 2 freq julidy (3) - 2 freq lusty (3) - 5 freq jestin (3) - 1 freq usty (3) - 1 freq |
justify (0) - 14 freq justifee (2) - 1 freq justifyin (3) - 2 freq justice (3) - 67 freq justin (3) - 6 freq justine (3) - 33 freq testify (3) - 3 freq justly (3) - 3 freq justis (3) - 2 freq stify (3) - 1 freq justifies (4) - 2 freq gustfu (4) - 1 freq justified (4) - 9 freq stife (4) - 1 freq jestin (4) - 1 freq jestit (4) - 1 freq justa (4) - 1 freq just (4) - 1576 freq juistice (4) - 11 freq juste (4) - 3 freq mustafa (4) - 1 freq jeestifee (4) - 3 freq justyna (4) - 1 freq lustin (5) - 1 freq 'justice (5) - 1 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 |
JUSTIFY |
| Time to execute Levenshtein function - 0.206440 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.344584 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.027235 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.037524 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.000852 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. |