| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gumlie (1) - 4 freq aumrie (1) - 3 freq gurrie (1) - 1 freq gamrie (1) - 5 freq furie (2) - 13 freq gumtree (2) - 1 freq pumpie (2) - 2 freq cumbie (2) - 1 freq ourie (2) - 3 freq glorie (2) - 32 freq gurlie (2) - 11 freq gowrie (2) - 1 freq gunnie (2) - 16 freq aurrie (2) - 1 freq humbie (2) - 1 freq imrie (2) - 1 freq memrie (2) - 5 freq gammie (2) - 4 freq gummies (2) - 2 freq gamie (2) - 12 freq gumlier (2) - 1 freq furrie (2) - 1 freq guare (2) - 1 freq glaumrie (2) - 5 freq guckie (2) - 1 freq |
gamrie (1) - 5 freq gumlie (2) - 4 freq gurrie (2) - 1 freq aumrie (2) - 3 freq gumlier (3) - 1 freq gamie (3) - 12 freq memrie (3) - 5 freq guare (3) - 1 freq gammie (3) - 4 freq geerie (3) - 1 freq guerre (3) - 1 freq comrie (3) - 1 freq grie (3) - 6 freq imrie (3) - 1 freq glaumrie (3) - 5 freq gearie (3) - 4 freq glorie (3) - 32 freq gowrie (3) - 1 freq gumtree (3) - 1 freq gummy (4) - 6 freq 'marie (4) - 2 freq gomin (4) - 21 freq gamies (4) - 11 freq gome (4) - 1 freq genre (4) - 9 freq |
SoundEx code - G560 gonorrhoea - 1 freq gemmer - 1 freq gomorrah - 2 freq gimmer - 2 freq gunnar - 6 freq goner - 4 freq genre - 9 freq ganner - 1 freq gener - 1 freq gonner - 1 freq geynear - 2 freq gunner - 2 freq gamrie - 5 freq gey-near - 1 freq gnar - 1 freq gonhorrea - 1 freq gwenmairi - 1 freq |
MetaPhone code - KMR c'mere - 7 freq camber - 1 freq camera - 57 freq comer - 4 freq caumer - 1 freq cummer - 6 freq kimmer - 6 freq 'c'mere' - 1 freq gomorrah - 2 freq kimmeer - 1 freq commer - 1 freq comrie - 1 freq 'c'mere - 2 freq coimbra - 1 freq gamrie - 5 freq cumbria - 2 freq kumar - 1 freq comber - 2 freq qmryy - 1 freq cmuir - 1 freq kamara - 1 freq |
GUMRIE |
| Time to execute Levenshtein function - 0.239855 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.371095 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.035176 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.041596 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. |