| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jots (0) - 5 freq joys (1) - 32 freq jets (1) - 5 freq jobs (1) - 78 freq tots (1) - 4 freq hots (1) - 1 freq joes (1) - 4 freq jows (1) - 2 freq joos (1) - 6 freq ots (1) - 2 freq lots (1) - 76 freq nots (1) - 2 freq rots (1) - 4 freq wots (1) - 3 freq bots (1) - 4 freq dots (1) - 7 freq jot (1) - 13 freq joss (1) - 2 freq cots (1) - 2 freq joks (1) - 1 freq oots (1) - 22 freq pots (1) - 44 freq jogs (1) - 2 freq juts (1) - 1 freq jtk (2) - 4 freq |
jots (0) - 5 freq juts (1) - 1 freq jets (1) - 5 freq jot (2) - 13 freq joss (2) - 2 freq bots (2) - 4 freq cots (2) - 2 freq dots (2) - 7 freq pots (2) - 44 freq jutes (2) - 9 freq jogs (2) - 2 freq wots (2) - 3 freq oots (2) - 22 freq joks (2) - 1 freq hots (2) - 1 freq joes (2) - 4 freq tots (2) - 4 freq rots (2) - 4 freq joys (2) - 32 freq jows (2) - 2 freq jobs (2) - 78 freq nots (2) - 2 freq ots (2) - 2 freq lots (2) - 76 freq joos (2) - 6 freq |
SoundEx code - J320 judge - 222 freq juidge - 17 freq jots - 5 freq judas - 24 freq jaddies - 1 freq jt's - 2 freq jets - 5 freq jed's - 4 freq jeedge - 8 freq jutes - 9 freq juts - 1 freq joodge - 1 freq jutish - 1 freq jeidge - 2 freq jude's - 1 freq jtxxyow - 1 freq jdqo - 1 freq jzdg - 1 freq jtjh - 1 freq jtc - 1 freq jtk - 4 freq |
MetaPhone code - JTS gets - 424 freq gits - 102 freq jots - 5 freq geddes - 22 freq geets - 23 freq judas - 24 freq gitths - 1 freq geetie's - 1 freq get's - 5 freq jaddies - 1 freq jt's - 2 freq git's - 3 freq gid's - 1 freq getts - 7 freq jets - 5 freq jed's - 4 freq jutes - 9 freq juts - 1 freq gied's - 1 freq gydes - 3 freq geds - 1 freq geats - 1 freq jude's - 1 freq gytes - 1 freq geets - 1 freq gites - 1 freq gets' - 1 freq |
JOTS |
| Time to execute Levenshtein function - 0.179150 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.340789 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.029477 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.040272 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.000880 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. |