| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| growling (0) - 1 freq rowling (1) - 3 freq growlin (1) - 15 freq growing (1) - 14 freq dowling (2) - 1 freq growlit (2) - 2 freq grilling (2) - 1 freq browning (2) - 7 freq googling (2) - 1 freq growin (2) - 240 freq prowlin (2) - 3 freq crowding (2) - 1 freq rowlin (2) - 4 freq howling (2) - 3 freq trolling (2) - 3 freq groping (2) - 1 freq drowning (2) - 1 freq gowlin (2) - 15 freq growin' (2) - 6 freq growein (2) - 42 freq drooling (2) - 2 freq gosling (2) - 1 freq growlan (2) - 3 freq crowlin (2) - 3 freq growins (2) - 1 freq |
growling (0) - 1 freq growlin (2) - 15 freq growing (2) - 14 freq rowling (2) - 3 freq grilling (3) - 1 freq growlan (3) - 3 freq crawling (3) - 1 freq crowlin (4) - 3 freq growein (4) - 42 freq growins (4) - 1 freq drooling (4) - 2 freq gosling (4) - 1 freq browsing (4) - 2 freq rolling (4) - 7 freq crowning (4) - 1 freq growin' (4) - 6 freq bowling (4) - 1 freq rowting (4) - 1 freq glowing (4) - 1 freq growin (4) - 240 freq prowlin (4) - 3 freq googling (4) - 1 freq growlit (4) - 2 freq dowling (4) - 1 freq gowlin (4) - 15 freq |
SoundEx code - G645 growlin - 15 freq gairland - 1 freq garland - 5 freq grillin - 2 freq garlands - 2 freq growlan - 3 freq gurlin - 4 freq grullyans - 2 freq grullyan - 1 freq €™gairlan - 3 freq garylineker - 4 freq growling - 1 freq grilling - 1 freq |
MetaPhone code - KRLNK 'curling' - 2 freq karling - 1 freq cairling - 1 freq carling - 3 freq curling - 3 freq crawling - 1 freq growling - 1 freq grilling - 1 freq |
GROWLING |
| Time to execute Levenshtein function - 0.498606 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.630537 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.061859 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.047833 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.000818 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. |