| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| growein (0) - 42 freq growen (1) - 19 freq growlin (1) - 15 freq rowein (1) - 7 freq growin (1) - 240 freq drownin (2) - 2 freq giowerin (2) - 1 freq crowin (2) - 2 freq growing (2) - 14 freq srowin (2) - 1 freq grouwin (2) - 1 freq growes (2) - 31 freq erowen (2) - 1 freq growers (2) - 1 freq flowein (2) - 1 freq growesna (2) - 1 freq growit (2) - 3 freq grovelin (2) - 1 freq growlit (2) - 2 freq grouin (2) - 10 freq grower (2) - 2 freq glowin (2) - 33 freq grawin (2) - 13 freq granein (2) - 1 freq gowkin (2) - 2 freq |
growein (0) - 42 freq growin (1) - 240 freq growen (1) - 19 freq gruwin (2) - 3 freq grouwin (2) - 1 freq growan (2) - 24 freq grawin (2) - 13 freq grouwen (2) - 1 freq growlin (2) - 15 freq grown (2) - 138 freq rowein (2) - 7 freq growne (3) - 10 freq goween (3) - 1 freq grein (3) - 4 freq grenein (3) - 1 freq growlan (3) - 3 freq grewn (3) - 3 freq rowin (3) - 30 freq growe (3) - 108 freq growin' (3) - 6 freq groin (3) - 3 freq grawn (3) - 4 freq groomin (3) - 4 freq growzn (3) - 1 freq groanin (3) - 14 freq |
SoundEx code - G650 green - 644 freq grimy - 2 freq grun - 422 freq growin - 240 freq gran - 232 freq graan - 14 freq grin - 137 freq grown - 138 freq granny - 383 freq gowerin - 1 freq grimm - 4 freq gurrin - 1 freq groom - 17 freq grim - 53 freq grime - 5 freq growen - 19 freq gaarin - 1 freq grunn - 16 freq garm - 1 freq growein - 42 freq graham - 38 freq 'gran - 3 freq gren - 1 freq girn - 60 freq grain - 78 freq 'granny' - 2 freq graun - 9 freq grunny - 92 freq groun - 7 freq groan - 19 freq grunnie - 13 freq girmny - 1 freq growne - 10 freq garrin - 35 freq girmy - 1 freq grannie - 328 freq growin' - 6 freq gruim - 2 freq grouwen - 1 freq gran' - 1 freq green' - 1 freq greene - 2 freq grouin - 10 freq grin- - 1 freq gern - 1 freq gram - 10 freq gra-an - 1 freq gurn - 6 freq grawin - 13 freq groun' - 1 freq 'grannie - 5 freq granme - 1 freq greeny - 3 freq girny - 4 freq germ - 3 freq giowerin - 1 freq girnywye - 1 freq grawn - 4 freq growan - 24 freq 'green' - 2 freq grün - 1 freq greein - 3 freq grene - 15 freq grayan - 1 freq geyran - 1 freq girnie - 3 freq gearin - 2 freq 'granny - 3 freq gyran - 1 freq graen - 1 freq 'greein - 2 freq grane - 4 freq grewn - 3 freq grouwin - 1 freq grien - 3 freq grein - 4 freq grame - 3 freq geryon - 9 freq grann - 1 freq groon - 7 freq grainy - 1 freq gairm - 4 freq gairn - 1 freq giorno - 2 freq graeme - 19 freq gorm - 1 freq gruwin - 3 freq greyin - 2 freq garron - 6 freq groam - 1 freq granma - 2 freq groon' - 1 freq germy - 1 freq germá - 1 freq greenie - 3 freq gerrin' - 2 freq €˜gorm - 1 freq groin - 3 freq 'girn' - 1 freq €˜grown - 1 freq goram - 1 freq graunie - 1 freq granÂ’ - 1 freq growinÂ’ - 1 freq growÂ’n - 1 freq 'girny - 1 freq |
MetaPhone code - KRWN growin - 240 freq growen - 19 freq growein - 42 freq crawin - 12 freq growin' - 6 freq grouwen - 1 freq grawin - 13 freq growan - 24 freq crowin' - 1 freq crowin - 2 freq grouwin - 1 freq gruwin - 3 freq growinÂ’ - 1 freq |
GROWEIN |
| Time to execute Levenshtein function - 0.200758 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.367370 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.027735 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.036913 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.000875 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. |