| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jackals (0) - 1 freq jackal (1) - 1 freq jackets (2) - 3 freq facials (2) - 2 freq jack's (2) - 6 freq jacks (2) - 10 freq jacksies (3) - 2 freq faals (3) - 1 freq manuals (3) - 2 freq acaus (3) - 2 freq packers (3) - 1 freq backers (3) - 2 freq lockars (3) - 2 freq jackson (3) - 38 freq jocky's (3) - 1 freq canals (3) - 3 freq ackwall (3) - 1 freq rascals (3) - 1 freq jaikits (3) - 1 freq lackeys (3) - 3 freq facks (3) - 15 freq hackles (3) - 3 freq jaks (3) - 1 freq packs (3) - 12 freq tackawa (3) - 1 freq |
jackals (0) - 1 freq jackal (2) - 1 freq jacks (3) - 10 freq jack's (3) - 6 freq jackets (3) - 3 freq yackles (4) - 1 freq jock's (4) - 35 freq jeckets (4) - 1 freq hackles (4) - 3 freq jacksie (4) - 3 freq jucks (4) - 1 freq jockys (4) - 1 freq tackles (4) - 3 freq joackeys (4) - 1 freq cackles (4) - 1 freq jaickets (4) - 18 freq jocks (4) - 5 freq jocky's (4) - 1 freq jacksies (4) - 2 freq facials (4) - 2 freq jackie's (4) - 2 freq jacques (5) - 2 freq packages (5) - 1 freq jake's (5) - 2 freq macks (5) - 3 freq |
SoundEx code - J242 jagless - 3 freq juggles - 1 freq jiggles - 2 freq joco-like - 1 freq joco-lik - 3 freq jackals - 1 freq jwgillespie - 1 freq jakelees - 1 freq jackgilchrist - 6 freq |
MetaPhone code - JKLS giggles - 6 freq jagless - 3 freq juggles - 1 freq jiggles - 2 freq jackals - 1 freq jakelees - 1 freq |
JACKALS |
| Time to execute Levenshtein function - 0.207453 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.379254 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.027430 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.047870 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.001028 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. |