| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jackets (0) - 3 freq packets (1) - 20 freq jaickets (1) - 18 freq tackets (1) - 3 freq jacket (1) - 29 freq jeckets (1) - 1 freq jaykets (1) - 1 freq rackets (1) - 3 freq jaikets (1) - 13 freq facets (2) - 2 freq poackets (2) - 8 freq jaikits (2) - 1 freq jakes (2) - 3 freq sacrets (2) - 1 freq backers (2) - 2 freq packers (2) - 1 freq pockets (2) - 22 freq jack's (2) - 6 freq backeth (2) - 1 freq brackets (2) - 6 freq ackers (2) - 16 freq mackers (2) - 1 freq jakers (2) - 1 freq jaiket' (2) - 1 freq rockets (2) - 9 freq |
jackets (0) - 3 freq jeckets (1) - 1 freq jaickets (1) - 18 freq jaikets (2) - 13 freq rackets (2) - 3 freq jaykets (2) - 1 freq jacket (2) - 29 freq packets (2) - 20 freq tackets (2) - 3 freq rockets (3) - 9 freq jakits (3) - 2 freq joackeys (3) - 1 freq jackie's (3) - 2 freq rickets (3) - 1 freq sockets (3) - 8 freq jaicket's (3) - 1 freq buckets (3) - 25 freq pickets (3) - 3 freq jaycket (3) - 1 freq tickets (3) - 84 freq jecket (3) - 10 freq jacks (3) - 10 freq poackets (3) - 8 freq jackals (3) - 1 freq jaicket (3) - 72 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 - JKTS jaikits - 1 freq jakits - 2 freq jaikets - 13 freq jaiket's - 3 freq jaickets - 18 freq jackets - 3 freq jaicket's - 1 freq jaykets - 1 freq jeckets - 1 freq |
JACKETS |
| Time to execute Levenshtein function - 0.290871 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.638460 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.033363 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.093516 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.001175 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. |