| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gamrie (0) - 5 freq gammie (1) - 4 freq gamie (1) - 12 freq jammie (2) - 2 freq parrie (2) - 4 freq gatie (2) - 1 freq gadie (2) - 5 freq warie (2) - 1 freq gumlie (2) - 4 freq gearie (2) - 4 freq garvie (2) - 1 freq gawkie (2) - 1 freq gamin (2) - 3 freq rairie (2) - 3 freq gaudie (2) - 1 freq geerie (2) - 1 freq jamsie (2) - 3 freq garye (2) - 3 freq glamorie (2) - 1 freq gaunie (2) - 6 freq marie (2) - 212 freq gramarie (2) - 1 freq carrie (2) - 11 freq memrie (2) - 5 freq gamble (2) - 12 freq |
gamrie (0) - 5 freq gamie (2) - 12 freq gammie (2) - 4 freq game (3) - 642 freq gare (3) - 1 freq aumrie (3) - 3 freq gramarie (3) - 1 freq gurrie (3) - 1 freq memrie (3) - 5 freq mairie (3) - 1 freq imrie (3) - 1 freq glaurie (3) - 7 freq gowrie (3) - 1 freq gamies (3) - 11 freq maimrie (3) - 2 freq glorie (3) - 32 freq marie (3) - 212 freq glaumrie (3) - 5 freq grie (3) - 6 freq geerie (3) - 1 freq gamin (3) - 3 freq gumlie (3) - 4 freq gearie (3) - 4 freq glamorie (3) - 1 freq garye (3) - 3 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 - 55 freq comer - 4 freq caumer - 1 freq cummer - 6 freq kimmer - 6 freq 'c'mere' - 1 freq gomorrah - 2 freq kimmeer - 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 |
GAMRIE |
| Time to execute Levenshtein function - 0.205587 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.347415 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.027640 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.037307 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.000796 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. |