Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
joogelt (0) - 1 freq jooglt (1) - 1 freq joogle (2) - 6 freq shoogelt (2) - 1 freq jowelt (2) - 2 freq doobelt (2) - 1 freq jooglet (2) - 1 freq jangelt (2) - 1 freq hoobeit (3) - 6 freq tootlt (3) - 1 freq forgett (3) - 1 freq jooglin (3) - 10 freq forget (3) - 266 freq gelt (3) - 1 freq joel (3) - 1 freq fordelt (3) - 2 freq jogger (3) - 1 freq joggers (3) - 1 freq lodgest (3) - 1 freq jooked (3) - 8 freq jonrell (3) - 1 freq jooder (3) - 1 freq oolt (3) - 1 freq looket (3) - 36 freq joogal (3) - 1 freq |
joogelt (0) - 1 freq jooglt (1) - 1 freq jooglet (2) - 1 freq joogle (3) - 6 freq jangelt (3) - 1 freq jowelt (3) - 2 freq jowlt (4) - 1 freq jeelt (4) - 16 freq jougle (4) - 1 freq taegelt (4) - 1 freq gelt (4) - 1 freq jiggilt (4) - 1 freq jolt (4) - 7 freq taigelt (4) - 12 freq joogled (4) - 6 freq jooglin (4) - 10 freq doobelt (4) - 1 freq shoogelt (4) - 1 freq joost (5) - 230 freq taigilt (5) - 2 freq foogle (5) - 1 freq jookle (5) - 2 freq google (5) - 80 freq jogged (5) - 2 freq jookit (5) - 3 freq |
SoundEx code - J243 joogled - 6 freq joogelt - 1 freq joggled - 1 freq jiggilt - 1 freq jakolet - 1 freq jooglt - 1 freq jooglet - 1 freq |
MetaPhone code - JJLT joogelt - 1 freq |
JOOGELT |
Time to execute Levenshtein function - 0.427669 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.914804 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.076790 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.109611 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.001125 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. |