| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| juistice (0) - 11 freq justice (1) - 67 freq justices (2) - 1 freq 'justice (2) - 1 freq justine (2) - 33 freq nguistics (3) - 1 freq quitie (3) - 2 freq cuistin (3) - 3 freq solstice (3) - 3 freq unjustice (3) - 1 freq gustie (3) - 3 freq juice (3) - 68 freq baistie (3) - 3 freq kistie (3) - 14 freq injustice (3) - 14 freq cuitie (3) - 1 freq juste (3) - 3 freq quietie (3) - 1 freq beistie (3) - 1 freq taistie (3) - 1 freq ruistin (3) - 1 freq quistion (3) - 8 freq cuisine (3) - 6 freq luistit (3) - 1 freq muisic' (3) - 1 freq |
juistice (0) - 11 freq justice (1) - 67 freq 'justice (3) - 1 freq justine (3) - 33 freq justices (3) - 1 freq justin (4) - 6 freq injustice (4) - 14 freq juste (4) - 3 freq rustic (4) - 3 freq justify (4) - 14 freq unjustice (4) - 1 freq justis (4) - 2 freq juist (4) - 1704 freq autistic (4) - 2 freq justifee (4) - 1 freq stce (5) - 1 freq jeestifee (5) - 3 freq jista (5) - 1 freq elastic (5) - 13 freq distince (5) - 1 freq existince (5) - 1 freq buistin (5) - 1 freq unstick (5) - 1 freq justihed (5) - 1 freq cystic (5) - 1 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 |
JUISTICE |
| Time to execute Levenshtein function - 0.185536 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.340293 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.027558 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.037826 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.000842 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. |