| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| justices (0) - 1 freq justice (1) - 68 freq justihed (2) - 1 freq auspices (2) - 1 freq justine (2) - 33 freq juistice (2) - 11 freq justis (2) - 2 freq justifies (2) - 2 freq juices (2) - 8 freq justifee (2) - 1 freq justine's (2) - 3 freq 'justice (2) - 1 freq justalces (2) - 1 freq injustices (2) - 1 freq jutes (3) - 9 freq rustic (3) - 3 freq juicer (3) - 1 freq cuties (3) - 2 freq pastimes (3) - 2 freq jassies (3) - 1 freq customes (3) - 1 freq tysties (3) - 1 freq unjustice (3) - 1 freq sumtimes (3) - 12 freq justify (3) - 14 freq |
justices (0) - 1 freq justice (2) - 68 freq justis (3) - 2 freq juistice (3) - 11 freq justifies (3) - 2 freq justalces (3) - 1 freq injustices (3) - 1 freq justine's (4) - 3 freq justifee (4) - 1 freq 'justice (4) - 1 freq juices (4) - 8 freq auspices (4) - 1 freq justihed (4) - 1 freq justine (4) - 33 freq posties (5) - 3 freq costies (5) - 8 freq jessies (5) - 3 freq testicles (5) - 1 freq justin (5) - 6 freq justness (5) - 1 freq sties (5) - 1 freq slices (5) - 19 freq besties (5) - 1 freq justified (5) - 9 freq elastics (5) - 1 freq |
SoundEx code - J232 jaikits - 1 freq justice - 68 freq juistice - 11 freq jakits - 2 freq jeests - 7 freq jaikets - 13 freq jaiket's - 3 freq jeists - 3 freq jaickets - 18 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 - JSTSS justices - 1 freq |
JUSTICES |
| Time to execute Levenshtein function - 0.274234 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.498139 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.027988 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.064503 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.008925 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. |