| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jaickets (0) - 15 freq jaicket's (1) - 1 freq jackets (1) - 3 freq jaicket (1) - 68 freq jaikets (1) - 13 freq jaycket (2) - 1 freq jaisket (2) - 1 freq rackets (2) - 3 freq jaiket' (2) - 1 freq jacket (2) - 29 freq spickets (2) - 1 freq rickets (2) - 1 freq jaiket's (2) - 3 freq tackets (2) - 3 freq tickets (2) - 83 freq jaiket (2) - 105 freq jaickit (2) - 16 freq mairkets (2) - 3 freq packets (2) - 20 freq jaykets (2) - 1 freq crickets (2) - 1 freq jaikits (2) - 1 freq saicrets (2) - 9 freq jeckets (2) - 1 freq pickets (2) - 3 freq |
jaickets (0) - 15 freq jackets (1) - 3 freq jaicket's (2) - 1 freq jaikets (2) - 13 freq jeckets (2) - 1 freq jaicket (2) - 68 freq jaickit (3) - 16 freq tickets (3) - 83 freq packets (3) - 20 freq jaykets (3) - 1 freq jaikits (3) - 1 freq tackets (3) - 3 freq pickets (3) - 3 freq rackets (3) - 3 freq jacket (3) - 29 freq rickets (3) - 1 freq jaycket (3) - 1 freq jackie's (4) - 2 freq pockets (4) - 21 freq poackets (4) - 6 freq jaiket's (4) - 3 freq buckets (4) - 25 freq jecket (4) - 10 freq jacks (4) - 10 freq jakits (4) - 2 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 - JKTS jaikits - 1 freq jakits - 2 freq jaikets - 13 freq jaiket's - 3 freq jaickets - 15 freq jackets - 3 freq jaicket's - 1 freq jaykets - 1 freq jeckets - 1 freq |
JAICKETS |
| Time to execute Levenshtein function - 0.183551 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.344847 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.031791 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.038299 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.000896 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. |