Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
juttin (0) - 3 freq luttin (1) - 8 freq nuttin (1) - 49 freq buttin (1) - 5 freq jottin (1) - 1 freq justin (1) - 6 freq jattin (1) - 1 freq ruttin (1) - 1 freq cuttin (1) - 73 freq suttin (1) - 81 freq muttin (1) - 3 freq tuttin (1) - 5 freq guttin (1) - 17 freq puttin (1) - 58 freq gustin (2) - 1 freq stuttin (2) - 1 freq jestin (2) - 1 freq ruttit (2) - 3 freq suttil (2) - 1 freq quotin (2) - 9 freq fittin (2) - 44 freq duettin (2) - 1 freq juin (2) - 25 freq bettin (2) - 12 freq guttit (2) - 4 freq |
juttin (0) - 3 freq jattin (1) - 1 freq jottin (1) - 1 freq muttin (2) - 3 freq luttin (2) - 8 freq guttin (2) - 17 freq suttin (2) - 81 freq puttin (2) - 58 freq tuttin (2) - 5 freq buttin (2) - 5 freq cuttin (2) - 73 freq justin (2) - 6 freq nuttin (2) - 49 freq ruttin (2) - 1 freq nottin (3) - 2 freq jotting (3) - 6 freq battin (3) - 1 freq jottit (3) - 1 freq pettin (3) - 3 freq wittin (3) - 28 freq nittin (3) - 3 freq gattin (3) - 1 freq putten (3) - 31 freq quittin (3) - 1 freq puttan (3) - 3 freq |
SoundEx code - J350 jottin - 1 freq juttin - 3 freq jattin - 1 freq jotham - 4 freq juden - 1 freq judean - 1 freq jayden - 1 freq judmoo - 4 freq judoon - 1 freq |
MetaPhone code - JTN gettin - 1145 freq gittin - 212 freq jottin - 1 freq gettan - 39 freq gittan - 30 freq gettin' - 18 freq gitten - 2 freq getten - 13 freq geeten - 1 freq gittin' - 16 freq juttin - 3 freq jattin - 1 freq gitin - 2 freq geidin' - 1 freq 'gettin - 2 freq juden - 1 freq judean - 1 freq gewttin - 1 freq gied-na - 1 freq getttin - 2 freq gideon - 2 freq getan - 1 freq jayden - 1 freq gittn - 1 freq judoon - 1 freq geetin - 1 freq getin - 1 freq gettin - 4 freq getn - 1 freq get'n - 1 freq |
JUTTIN |
Time to execute Levenshtein function - 0.199524 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.343919 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.027474 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.038604 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.001068 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. |