| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goodlookin (0) - 1 freq good-looking (2) - 2 freq onlookin (3) - 2 freq prood-lookin (3) - 1 freq doon-lookin (3) - 1 freq rochlookin (3) - 1 freq guid-lookin (3) - 4 freq good-goin (3) - 1 freq odd-lookin (3) - 1 freq doonloadin (4) - 1 freq ootpoorin (4) - 1 freq gweed-lookin (4) - 1 freq 'dookin (4) - 1 freq dookin (4) - 20 freq waxylookin (4) - 1 freq gollopin (4) - 2 freq goodluck (4) - 2 freq finelookin (4) - 1 freq goodlyburn (4) - 1 freq ill-lookin (4) - 3 freq bollockin (4) - 1 freq lookin (4) - 985 freq bad-lookin (4) - 3 freq goodwin (4) - 7 freq drookin (4) - 3 freq |
goodlookin (0) - 1 freq good-looking (4) - 2 freq guid-lookin (4) - 4 freq godlin (5) - 1 freq good-goin (5) - 1 freq odd-lookin (5) - 1 freq onlookin (5) - 2 freq drookin (6) - 3 freq goodwin (6) - 7 freq bad-lookin (6) - 3 freq lookin (6) - 985 freq googlin (6) - 7 freq owerlookin (6) - 4 freq guid-leukin (6) - 1 freq goodlyburn (6) - 1 freq gleekin (6) - 4 freq godlaek (6) - 1 freq doodlin (6) - 2 freq gododdin (6) - 2 freq dookin (6) - 20 freq doon-lookin (6) - 1 freq gweed-lookin (6) - 1 freq rochlookin (6) - 1 freq prood-lookin (6) - 1 freq 'dookin (6) - 1 freq |
SoundEx code - G342 guid-lookin - 4 freq goodlookin - 1 freq gowdilocks - 7 freq good-looking - 2 freq godless - 12 freq gutless - 1 freq gaidhlig - 8 freq goodluck - 2 freq gweed-lookin - 1 freq guidless - 3 freq guddle's - 1 freq guddles - 2 freq gweed-leukin - 1 freq gàidhlig - 71 freq gödless - 1 freq gàidhlig's - 2 freq goidelic - 3 freq guid-leukin - 1 freq gyte-like - 1 freq gydals - 1 freq godlaek - 1 freq guid-leukkin - 1 freq ghàidhlig - 1 freq gdlujvoe - 1 freq ghdlqo - 1 freq gtalstonwader - 1 freq |
MetaPhone code - KTLKN guid-lookin - 4 freq goodlookin - 1 freq cataloguin' - 2 freq guid-leukin - 1 freq guid-leukkin - 1 freq |
GOODLOOKIN |
| Time to execute Levenshtein function - 0.279728 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.560191 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.031415 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.041510 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.000982 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. |