| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nasty-looking (0) - 1 freq nasty-lookin (1) - 1 freq ratty-lookin (3) - 1 freq sarky-lookin (4) - 1 freq nazi-lookin (4) - 1 freq waxy-lookin (4) - 1 freq daft-lookin (4) - 1 freq radge-lookin (5) - 2 freq bad-lookin (5) - 3 freq good-looking (5) - 2 freq comfy-lookin (5) - 1 freq bad-lookin' (5) - 1 freq waxylookin (5) - 1 freq sinister-lookin (6) - 1 freq rough-lookin (6) - 1 freq stocking (6) - 5 freq stooning (6) - 1 freq stroking (6) - 1 freq pantyloons (6) - 1 freq stalking (6) - 2 freq stookin (6) - 2 freq unco-lookin (6) - 1 freq nosy-walkin' (6) - 1 freq gweed-lookin (6) - 1 freq nay-saying (6) - 1 freq |
nasty-looking (0) - 1 freq nasty-lookin (2) - 1 freq ratty-lookin (6) - 1 freq nazi-lookin (7) - 1 freq daft-lookin (7) - 1 freq good-looking (8) - 2 freq stalking (8) - 2 freq waxy-lookin (8) - 1 freq sarky-lookin (8) - 1 freq unco-lookin (9) - 1 freq nosy-walkin' (9) - 1 freq stroking (9) - 1 freq daft-luikin (9) - 1 freq networking (9) - 3 freq animal-lookin (9) - 1 freq unsticking (9) - 1 freq bad-lookin' (9) - 1 freq radge-lookin (9) - 2 freq sinister-lookin (9) - 1 freq comfy-lookin (9) - 1 freq stocking (9) - 5 freq bad-lookin (9) - 3 freq bustling (10) - 1 freq striking (10) - 1 freq nosey-like (10) - 1 freq |
SoundEx code - N234 nichtly - 4 freq nostalgic - 8 freq nestled - 7 freq nestlin - 2 freq nostalgia - 9 freq nicht-walkers - 1 freq nestlé - 1 freq nestlt - 1 freq nestle - 2 freq nightly - 3 freq nicht-late - 1 freq nescotland - 1 freq new-stellt - 1 freq nochttheless - 1 freq nychtlie - 1 freq no-catholics - 1 freq nestily - 1 freq noctilucent - 2 freq €œnostalgia - 1 freq nasty-looking - 1 freq nochtless - 1 freq nasty-lookin - 1 freq nscotland - 3 freq nxdohwlde - 1 freq nqqjdlditj - 1 freq nostalgia's - 1 freq |
MetaPhone code - NSTLKNK nasty-looking - 1 freq |
NASTY-LOOKING |
| Time to execute Levenshtein function - 0.388746 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.632659 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.081807 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.071740 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.000971 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. |