| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grumph (0) - 15 freq gumph (1) - 1 freq grumpy (1) - 9 freq grump (1) - 3 freq frumpy (2) - 1 freq gruoch (2) - 1 freq gruppt (2) - 10 freq grumphie (2) - 367 freq gruppy (2) - 1 freq grumpyo (2) - 1 freq grupp (2) - 2 freq rump (2) - 10 freq triumph (2) - 17 freq grulsh (2) - 1 freq grunch (2) - 1 freq grumpie (2) - 1 freq grush (2) - 1 freq grampa (2) - 8 freq sumph (2) - 21 freq grumly (2) - 1 freq humph (2) - 14 freq krummph (2) - 3 freq grumphed (2) - 8 freq grumfy (2) - 1 freq bumph (2) - 3 freq |
grumph (0) - 15 freq grumphie (2) - 367 freq grump (2) - 3 freq grumpy (2) - 9 freq gumph (2) - 1 freq grumphed (3) - 8 freq grumpie (3) - 1 freq grampa (3) - 8 freq graph (3) - 4 freq triumph (3) - 17 freq grumphin (3) - 2 freq grumpyo (3) - 1 freq grup (4) - 52 freq grurh (4) - 1 freq trump (4) - 74 freq gump (4) - 1 freq gruip (4) - 1 freq trumps (4) - 8 freq frump (4) - 1 freq grupt (4) - 2 freq grumpbhie (4) - 1 freq grumphie' (4) - 2 freq grumpian (4) - 4 freq grumphies (4) - 14 freq grampus (4) - 1 freq |
SoundEx code - G651 granfaithers - 1 freq granfaither - 38 freq grumphie - 367 freq grown-up - 9 freq granbairns - 11 freq growen-up - 7 freq growen-ups - 22 freq 'growen-ups - 1 freq grumble - 9 freq growin-up - 1 freq grumph - 15 freq ggrumphie - 1 freq 'grumphie' - 1 freq grumphies - 14 freq grumphie-bairn - 2 freq graunparent's - 1 freq grumfies - 2 freq grumfie - 1 freq grewn-up - 1 freq grampian - 11 freq grumblit - 1 freq graunbairn - 4 freq graunfaither - 6 freq granflaith - 2 freq grumphie's - 20 freq girnie-faced - 1 freq grumphed - 8 freq grimfaced - 1 freq grumbelt - 1 freq grumpy - 9 freq grampa - 8 freq grumblin - 1 freq grown-ups - 12 freq grim-faced - 2 freq grampus - 1 freq grumpily - 1 freq grumbles - 2 freq grumphiel' - 1 freq grumphie' - 2 freq grumpbhie - 1 freq grumphie''s - 1 freq grumpie - 1 freq grumbled - 2 freq grienie-bloo - 1 freq groun-up - 1 freq grump - 3 freq gruein-blate - 1 freq green-bay - 1 freq greenflees - 3 freq greenwife - 1 freq grumphin - 2 freq grumphieman - 11 freq grumphiehoose - 3 freq greeny-broun - 1 freq granfather - 1 freq grampians - 2 freq granfaither's - 3 freq granfither - 1 freq greenfield's - 2 freq green-faced - 1 freq grampa's - 2 freq grumphie-sty - 1 freq granny-wifey - 1 freq granpa - 1 freq grönivoe - 1 freq greenpeace - 1 freq greenfly - 2 freq greenflees' - 1 freq greenfield - 2 freq granpaurent - 5 freq growne-ups - 1 freq €˜grumpy - 1 freq greenbank - 1 freq greenbanks - 10 freq grenbanks - 1 freq grumfy - 1 freq grownups - 1 freq grampianpolice - 1 freq granpaw - 1 freq gerryinaberdeen - 28 freq greenfinch - 1 freq grumpyo - 1 freq grumpian - 4 freq graemepercy - 2 freq grumpyhatlady - 2 freq grumpygoth - 1 freq |
MetaPhone code - KRMF grumphie - 367 freq krummph - 3 freq grumph - 15 freq ggrumphie - 1 freq 'grumphie' - 1 freq grumfie - 1 freq grumphie' - 2 freq grumfy - 1 freq |
GRUMPH |
| Time to execute Levenshtein function - 0.187651 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.322485 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.027494 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.037179 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.000864 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. |