Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
girn (0) - 59 freq gird (1) - 48 freq pirn (1) - 8 freq kirn (1) - 33 freq irn (1) - 35 freq gairn (1) - 1 freq airn (1) - 50 freq tirn (1) - 35 freq girs (1) - 4 freq girl (1) - 73 freq gi'n (1) - 3 freq gin (1) - 1982 freq girnt (1) - 4 freq gien (1) - 1014 freq girny (1) - 4 freq gern (1) - 1 freq girns (1) - 19 freq birn (1) - 17 freq gurn (1) - 6 freq yirn (1) - 3 freq giro (1) - 12 freq air (2) - 970 freq gyan (2) - 104 freq gite (2) - 2 freq kiln (2) - 7 freq |
girn (0) - 59 freq gairn (1) - 1 freq gurn (1) - 6 freq gern (1) - 1 freq girny (1) - 4 freq girnie (2) - 3 freq yirn (2) - 3 freq grin (2) - 135 freq birn (2) - 17 freq gyran (2) - 1 freq grien (2) - 3 freq gran (2) - 232 freq giorno (2) - 2 freq gren (2) - 1 freq girns (2) - 19 freq grun (2) - 418 freq giro (2) - 12 freq tirn (2) - 35 freq girl (2) - 73 freq kirn (2) - 33 freq irn (2) - 35 freq gien (2) - 1014 freq airn (2) - 50 freq pirn (2) - 8 freq gin (2) - 1982 freq |
SoundEx code - G650 green - 612 freq grimy - 2 freq grun - 418 freq growin - 237 freq gran - 232 freq graan - 14 freq grin - 135 freq grown - 134 freq granny - 345 freq gowerin - 1 freq grimm - 4 freq gurrin - 1 freq groom - 17 freq grim - 51 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 - 59 freq grain - 77 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 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 - JRN journey - 109 freq girn - 59 freq jurney - 2 freq jeerin - 3 freq journo - 1 freq gern - 1 freq girny - 4 freq jurnay - 6 freq geyran - 1 freq girnie - 3 freq gearin - 2 freq gyran - 1 freq jurnai - 1 freq giorno - 2 freq journey' - 1 freq journay - 3 freq gerrin' - 2 freq €œjourney - 1 freq 'girn' - 1 freq jarrin - 2 freq 'girny - 1 freq |
GIRN |
Time to execute Levenshtein function - 0.192874 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.320049 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.027818 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.036585 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.000836 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. |