Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
jubiter (0) - 29 freq jupiter (1) - 9 freq arbiter (2) - 2 freq biter (2) - 1 freq cuiter (2) - 1 freq jubilee (2) - 4 freq juicer (2) - 1 freq jubiter's (2) - 1 freq quaiter (2) - 4 freq hubster (2) - 1 freq foubister (3) - 2 freq gutter (3) - 32 freq jobie (3) - 1 freq joiner (3) - 14 freq suite (3) - 16 freq juicier (3) - 1 freq igniter (3) - 2 freq beter (3) - 1 freq twiter (3) - 1 freq suites (3) - 2 freq fiter (3) - 1 freq heiter (3) - 1 freq greiter (3) - 1 freq guizer (3) - 4 freq bluiter (3) - 1 freq |
jubiter (0) - 29 freq jupiter (2) - 9 freq biter (3) - 1 freq arbiter (3) - 2 freq jester (4) - 4 freq janitor (4) - 6 freq debater (4) - 1 freq jater (4) - 1 freq jabber (4) - 4 freq beter (4) - 1 freq jotter (4) - 28 freq juicer (4) - 1 freq hubster (4) - 1 freq cuiter (4) - 1 freq jubiter's (4) - 1 freq jubilee (4) - 4 freq quaiter (4) - 4 freq beater (5) - 11 freq efiter (5) - 1 freq unter (5) - 1 freq outer (5) - 4 freq arbiters (5) - 1 freq rubber (5) - 54 freq buited (5) - 1 freq baitur (5) - 4 freq |
SoundEx code - J136 jupiter - 9 freq jubiter - 29 freq jubiter's - 1 freq jupiter's - 1 freq |
MetaPhone code - JBTR jubiter - 29 freq |
JUBITER |
Time to execute Levenshtein function - 0.324371 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.757986 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.040209 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.088431 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.000786 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. |