| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grillin (0) - 2 freq grilling (1) - 1 freq trillin (1) - 1 freq drillin (1) - 13 freq chillin (2) - 6 freq gillis (2) - 1 freq trollin (2) - 1 freq gillan (2) - 5 freq gilli (2) - 3 freq grievin (2) - 14 freq gilpin (2) - 1 freq killin (2) - 61 freq grittin (2) - 3 freq grinnin (2) - 63 freq argillin (2) - 1 freq driplin (2) - 1 freq growlin (2) - 15 freq grilsie (2) - 1 freq riflin (2) - 1 freq rilin (2) - 2 freq fillin (2) - 63 freq gremlin (2) - 4 freq grilled (2) - 2 freq brallin (2) - 1 freq grimlins (2) - 1 freq |
grillin (0) - 2 freq trillin (2) - 1 freq drillin (2) - 13 freq grilling (2) - 1 freq dreillin (3) - 1 freq gillon (3) - 1 freq grill (3) - 5 freq brallin (3) - 1 freq grullyan (3) - 1 freq grille (3) - 1 freq grumlin (3) - 1 freq trillion (3) - 1 freq rollin (3) - 58 freq gremlin (3) - 4 freq gillian (3) - 7 freq rellin (3) - 1 freq grilled (3) - 2 freq gillan (3) - 5 freq trollin (3) - 1 freq growlin (3) - 15 freq gallon (4) - 13 freq garglin (4) - 2 freq grouzlin (4) - 1 freq growlan (4) - 3 freq trimlin (4) - 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 - KRLN crowlin - 3 freq curlin - 17 freq craalin - 7 freq caroline - 26 freq growlin - 15 freq crawlin - 19 freq carlin - 6 freq grillin - 2 freq carline - 33 freq crawlin' - 2 freq craalen - 1 freq carole-ann - 1 freq crahlin - 1 freq carolina - 8 freq growlan - 3 freq curlan - 2 freq craalan - 2 freq gurlin - 4 freq creelin - 2 freq quarrellin - 1 freq crawlan - 1 freq quarrelan - 2 freq €™gairlan - 3 freq carolyne - 1 freq corleone - 1 freq carlene - 1 freq |
GRILLIN |
| Time to execute Levenshtein function - 0.241983 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.391060 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.027473 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.038459 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.000923 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. |