| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| justifies (0) - 2 freq justified (1) - 9 freq testifies (2) - 1 freq justifee (2) - 1 freq justices (2) - 1 freq justine's (3) - 3 freq nullifies (3) - 1 freq justalces (3) - 1 freq justis (3) - 2 freq justice (3) - 68 freq mystified (3) - 2 freq justine (3) - 33 freq destinies (3) - 1 freq certifies (3) - 1 freq justihed (3) - 1 freq justify (3) - 14 freq testifees (3) - 1 freq justifee'd (3) - 2 freq justifyin (3) - 2 freq jeestifee (4) - 3 freq jutes (4) - 9 freq buttries (4) - 3 freq duties (4) - 16 freq stiffen (4) - 7 freq juidges (4) - 1 freq |
justifies (0) - 2 freq justified (2) - 9 freq justices (3) - 1 freq justifee (3) - 1 freq testifies (3) - 1 freq testifees (4) - 1 freq justifyin (4) - 2 freq justis (4) - 2 freq justify (4) - 14 freq justifee'd (5) - 2 freq jeestifee (5) - 3 freq justice (5) - 68 freq justine's (5) - 3 freq justihed (5) - 1 freq justalces (5) - 1 freq mystified (5) - 2 freq justine (5) - 33 freq destinies (5) - 1 freq certifies (5) - 1 freq selfies (6) - 9 freq casuities (6) - 1 freq westies (6) - 1 freq justness (6) - 1 freq stovies (6) - 37 freq wastries (6) - 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 - JSTFS justifies - 2 freq |
JUSTIFIES |
| Time to execute Levenshtein function - 0.211003 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.528610 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.030524 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.067939 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.001009 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. |