| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jutes (0) - 9 freq juts (1) - 1 freq butes (1) - 2 freq jules (1) - 1 freq mutes (1) - 1 freq jubes (1) - 3 freq junes (1) - 1 freq jute (1) - 7 freq gytes (2) - 1 freq dates (2) - 36 freq putey (2) - 3 freq jeyes (2) - 1 freq wut's (2) - 1 freq jate (2) - 1 freq gute (2) - 1 freq cut's (2) - 2 freq jude's (2) - 1 freq jt's (2) - 2 freq jure (2) - 1 freq gut's (2) - 4 freq huts (2) - 7 freq duties (2) - 16 freq runes (2) - 6 freq jets (2) - 5 freq lues (2) - 1 freq |
jutes (0) - 9 freq juts (1) - 1 freq jots (2) - 5 freq jute (2) - 7 freq jets (2) - 5 freq junes (2) - 1 freq butes (2) - 2 freq jules (2) - 1 freq mutes (2) - 1 freq jubes (2) - 3 freq kuts (3) - 1 freq autos (3) - 1 freq jibes (3) - 2 freq jyles (3) - 1 freq gites (3) - 1 freq jatest (3) - 1 freq mates (3) - 90 freq joves (3) - 2 freq tues (3) - 6 freq judas (3) - 24 freq fates (3) - 4 freq james (3) - 283 freq quytes (3) - 1 freq wytes (3) - 3 freq totes (3) - 1 freq |
SoundEx code - J320 judge - 222 freq juidge - 17 freq jots - 5 freq judas - 24 freq jeidge - 5 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 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 - 432 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 |
JUTES |
| Time to execute Levenshtein function - 0.197544 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.360453 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.027711 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.038016 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.000912 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. |