| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grilling (0) - 1 freq grillin (1) - 2 freq trillin (2) - 1 freq grieving (2) - 1 freq grinning (2) - 5 freq tilling (2) - 1 freq rolling (2) - 7 freq growling (2) - 1 freq filling (2) - 5 freq pilling (2) - 1 freq thrilling (2) - 1 freq trolling (2) - 3 freq killing (2) - 7 freq milling (2) - 1 freq drillin (2) - 13 freq spilling (2) - 3 freq willing (2) - 10 freq shilling (2) - 4 freq grimlins (2) - 1 freq grinding (2) - 2 freq millins (3) - 1 freq trimlin (3) - 1 freq ripping (3) - 1 freq swillin (3) - 2 freq guiding (3) - 1 freq |
grilling (0) - 1 freq grillin (2) - 2 freq growling (3) - 1 freq trolling (3) - 3 freq rolling (3) - 7 freq spilling (4) - 3 freq enrolling (4) - 1 freq drillin (4) - 13 freq willing (4) - 10 freq shilling (4) - 4 freq milling (4) - 1 freq birlling (4) - 1 freq grimlins (4) - 1 freq grinding (4) - 2 freq killing (4) - 7 freq trillin (4) - 1 freq grieving (4) - 1 freq tilling (4) - 1 freq filling (4) - 5 freq thrilling (4) - 1 freq pilling (4) - 1 freq grinning (4) - 5 freq gruching (5) - 1 freq gillan (5) - 5 freq dreillin (5) - 1 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 |
GRILLING |
| Time to execute Levenshtein function - 0.521049 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.685208 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.028431 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.070458 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.000938 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. |