| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jaykets (0) - 1 freq jaikets (1) - 13 freq jackets (1) - 3 freq jayket (1) - 12 freq jaickets (2) - 18 freq jaiket' (2) - 1 freq jacket (2) - 29 freq jaiket's (2) - 3 freq jaiket (2) - 105 freq packets (2) - 20 freq jakers (2) - 1 freq rackets (2) - 3 freq tackets (2) - 3 freq baskets (2) - 8 freq jakes (2) - 3 freq jaycket (2) - 1 freq jake's (2) - 2 freq jeckets (2) - 1 freq jakits (2) - 2 freq jaikits (2) - 1 freq markets (2) - 3 freq jazzers (3) - 1 freq bakes (3) - 17 freq backet (3) - 8 freq ashets (3) - 14 freq |
jaykets (0) - 1 freq jaikets (1) - 13 freq jakits (2) - 2 freq jaikits (2) - 1 freq jackets (2) - 3 freq jayket (2) - 12 freq jaickets (3) - 18 freq jake's (3) - 2 freq jeckets (3) - 1 freq jakes (3) - 3 freq jakers (3) - 1 freq jaiket' (3) - 1 freq jaiket's (3) - 3 freq jaiket (3) - 105 freq jakies (4) - 2 freq jynts (4) - 13 freq jaikit (4) - 16 freq joke's (4) - 4 freq jaks (4) - 1 freq jokers (4) - 2 freq jakey's (4) - 1 freq pookets (4) - 1 freq jokes (4) - 50 freq jets (4) - 5 freq jakit (4) - 8 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 |
JAYKETS |
| Time to execute Levenshtein function - 0.327137 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.588448 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.030609 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.037990 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.001271 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. |