| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jets (0) - 5 freq mets (1) - 1 freq jegs (1) - 1 freq jet (1) - 16 freq juts (1) - 1 freq aets (1) - 11 freq jots (1) - 5 freq sets (1) - 130 freq bets (1) - 8 freq jests (1) - 2 freq jews (1) - 23 freq pets (1) - 12 freq gets (1) - 432 freq eets (1) - 58 freq jess (1) - 21 freq vets (1) - 9 freq jees (1) - 3 freq nets (1) - 46 freq lets (1) - 74 freq jesse (2) - 7 freq ahts (2) - 1 freq jeests (2) - 7 freq eth (2) - 8 freq rits (2) - 1 freq jetsam (2) - 1 freq |
jets (0) - 5 freq jots (1) - 5 freq juts (1) - 1 freq vets (2) - 9 freq jess (2) - 21 freq eets (2) - 58 freq jees (2) - 3 freq nets (2) - 46 freq jutes (2) - 9 freq lets (2) - 74 freq gets (2) - 432 freq eejets (2) - 1 freq mets (2) - 1 freq jegs (2) - 1 freq pets (2) - 12 freq aets (2) - 11 freq jet (2) - 16 freq jests (2) - 2 freq sets (2) - 130 freq bets (2) - 8 freq jews (2) - 23 freq ts (3) - 44 freq jogs (3) - 2 freq 'eats (3) - 2 freq lits (3) - 15 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 |
JETS |
| Time to execute Levenshtein function - 0.230045 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.350764 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.027309 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.037940 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.000938 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. |