Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
googlies (0) - 1 freq goolie (2) - 1 freq goonies (2) - 3 freq oolies (2) - 1 freq woolies (2) - 2 freq boolies (2) - 1 freq booglie (2) - 1 freq googled (2) - 1 freq googling (2) - 1 freq googlin (2) - 7 freq poorlies (2) - 1 freq wooglie (2) - 1 freq goggles (2) - 10 freq ghoulies (2) - 2 freq google (2) - 80 freq goodies (2) - 6 freq moggies (3) - 1 freq dookies (3) - 1 freq bougies (3) - 1 freq goodie (3) - 4 freq gouges (3) - 1 freq foggies (3) - 2 freq toories (3) - 3 freq rollies (3) - 1 freq boonies (3) - 1 freq |
googlies (0) - 1 freq goggles (3) - 10 freq ghoulies (3) - 2 freq google (3) - 80 freq googled (3) - 1 freq googlin (3) - 7 freq coagles (4) - 1 freq googly (4) - 3 freq geggies (4) - 1 freq goges (4) - 5 freq gillies (4) - 7 freq geylies (4) - 3 freq toggles (4) - 1 freq dooglas (4) - 4 freq uglies (4) - 1 freq boggles (4) - 3 freq gullies (4) - 3 freq bogles (4) - 23 freq googilin (4) - 1 freq giggles (4) - 6 freq gargles (4) - 1 freq boolies (4) - 1 freq woolies (4) - 2 freq googling (4) - 1 freq goodies (4) - 6 freq |
SoundEx code - G242 giggles - 6 freq googlies - 1 freq goggles - 10 freq ghazals - 1 freq gazelles - 3 freq gaslight - 1 freq gochle-green - 2 freq gisliss - 1 freq gissliss - 1 freq gesellschaft' - 1 freq gisless - 1 freq gaslicht - 1 freq gaclochken - 1 freq |
MetaPhone code - KKLS googlies - 1 freq keckles - 2 freq cockles - 6 freq goggles - 10 freq coagles - 1 freq coackles - 1 freq kuckles - 1 freq cackles - 1 freq |
GOOGLIES |
Time to execute Levenshtein function - 0.204147 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.399445 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.034393 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.047057 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.000988 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. |