| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jeests (0) - 7 freq jeists (1) - 3 freq jeesus (1) - 2 freq jeesis (1) - 2 freq jeest (1) - 38 freq heests (1) - 2 freq jests (1) - 2 freq heest (2) - 1 freq wheests (2) - 1 freq jeist (2) - 1 freq crests (2) - 2 freq kests (2) - 2 freq jeems (2) - 91 freq jeems's (2) - 2 freq vests (2) - 4 freq beasts (2) - 144 freq nests (2) - 27 freq jesus (2) - 835 freq jeet (2) - 1 freq reest (2) - 11 freq jeers (2) - 1 freq feets (2) - 1 freq breests (2) - 7 freq weets (2) - 1 freq beest (2) - 11 freq |
jeests (0) - 7 freq jests (1) - 2 freq jeists (1) - 3 freq jeesus (2) - 2 freq heests (2) - 2 freq jeesis (2) - 2 freq jeest (2) - 38 freq jeust (3) - 35 freq feasts (3) - 4 freq tests (3) - 27 freq bests (3) - 2 freq pests (3) - 2 freq jeestin (3) - 1 freq reists (3) - 1 freq beists (3) - 1 freq gests (3) - 2 freq baests (3) - 13 freq biests (3) - 1 freq jess (3) - 21 freq guests (3) - 46 freq jest (3) - 80 freq taests (3) - 1 freq jets (3) - 5 freq justis (3) - 2 freq vests (3) - 4 freq |
SoundEx code - J232 jaikits - 1 freq justice - 67 freq juistice - 11 freq jakits - 2 freq jeests - 7 freq jaikets - 13 freq jaiket's - 3 freq jeists - 3 freq jaickets - 15 freq jests - 2 freq justices - 1 freq jackets - 3 freq 'justice - 1 freq jecdgement - 1 freq jaicket's - 1 freq justis - 2 freq jaykets - 1 freq justdaj - 1 freq jeckets - 1 freq justacard - 1 freq joshtjordan - 1 freq jackhutchison - 1 freq justsingsco - 1 freq jojoteesend - 1 freq justsingscot - 1 freq |
MetaPhone code - JSTS justice - 67 freq juistice - 11 freq jeests - 7 freq jeists - 3 freq geust's - 1 freq jests - 2 freq 'justice - 1 freq geocities - 12 freq justis - 2 freq gests - 2 freq |
JEESTS |
| Time to execute Levenshtein function - 0.285359 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.460749 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.029995 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.067496 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.001008 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. |