| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jakits (0) - 2 freq jakit (1) - 8 freq jaikits (1) - 1 freq jakies (1) - 2 freq jaskit (2) - 1 freq jake's (2) - 2 freq jaks (2) - 1 freq baits (2) - 3 freq makita (2) - 2 freq makit (2) - 41 freq yakies (2) - 1 freq gaits (2) - 30 freq jaikit (2) - 16 freq jaikets (2) - 13 freq jaiks (2) - 1 freq akis (2) - 1 freq laits (2) - 2 freq rakit (2) - 4 freq taits (2) - 1 freq makins (2) - 1 freq jokit (2) - 8 freq jaunts (2) - 2 freq takins (2) - 2 freq jakes (2) - 3 freq cakies (2) - 1 freq |
jakits (0) - 2 freq jaikits (1) - 1 freq jaikets (2) - 13 freq jaykets (2) - 1 freq jakies (2) - 2 freq jakit (2) - 8 freq poakits (3) - 7 freq jakers (3) - 1 freq jokit (3) - 8 freq jakes (3) - 3 freq jackets (3) - 3 freq kits (3) - 4 freq jaunts (3) - 2 freq jaiks (3) - 1 freq jaks (3) - 1 freq jaikit (3) - 16 freq jake's (3) - 2 freq joak's (4) - 1 freq jaiket (4) - 105 freq jints (4) - 3 freq jaiket' (4) - 1 freq joke's (4) - 4 freq kites (4) - 6 freq skoits (4) - 1 freq jeests (4) - 7 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 |
JAKITS |
| Time to execute Levenshtein function - 0.232353 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.365016 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.027586 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.038475 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.000907 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. |