| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| juxtaposit (0) - 1 freq juxtaposition (3) - 2 freq juxtapositions (4) - 1 freq supposit (4) - 4 freq untappit (4) - 1 freq mutatit (5) - 1 freq utmost (5) - 3 freq tapmost (5) - 1 freq jumpit (5) - 25 freq jumpsuit (5) - 3 freq stappit (5) - 117 freq curtassie (5) - 1 freq ootpost (5) - 1 freq jurassic (5) - 4 freq supposin (5) - 14 freq tappit (5) - 6 freq budapest (5) - 3 freq exposin (5) - 7 freq suppost (5) - 4 freq deposit (5) - 6 freq guitarist (5) - 3 freq composit (5) - 2 freq jurnalist (5) - 1 freq unstappit (5) - 2 freq taoist (6) - 2 freq |
juxtaposit (0) - 1 freq juxtaposition (4) - 2 freq juxtapositions (6) - 1 freq ootpost (7) - 1 freq jumpsuit (7) - 3 freq untappit (7) - 1 freq supposit (7) - 4 freq guitarist (8) - 3 freq exposin (8) - 7 freq deposit (8) - 6 freq unstappit (8) - 2 freq jatest (8) - 1 freq tapesty (8) - 1 freq budapest (8) - 3 freq jurnalist (8) - 1 freq composit (8) - 2 freq suppost (8) - 4 freq tapmost (8) - 1 freq tappit (8) - 6 freq utmost (8) - 3 freq stappit (8) - 117 freq jumpit (8) - 25 freq autopilot (9) - 1 freq furthest (9) - 3 freq taest (9) - 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 - JKSTPST juxtaposit - 1 freq |
JUXTAPOSIT |
| Time to execute Levenshtein function - 0.186435 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.361602 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.028251 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.037029 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.001049 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. |