| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gomerils (0) - 5 freq gomerals (1) - 1 freq gomerels (1) - 2 freq gomeril (1) - 15 freq gomeral (2) - 1 freq gomoral (3) - 1 freq almerals (3) - 1 freq nostrils (3) - 20 freq owerins (3) - 1 freq generals (3) - 2 freq comers (3) - 1 freq gowerin (3) - 1 freq goners (3) - 1 freq gerbils (3) - 2 freq merits (3) - 7 freq comer's (3) - 1 freq goers (3) - 3 freq perils (3) - 2 freq numerals (3) - 4 freq bovrils (3) - 1 freq groceries (3) - 2 freq merdils (3) - 1 freq sometims (3) - 4 freq forerins (3) - 1 freq gomrell (3) - 1 freq |
gomerils (0) - 5 freq gomerels (1) - 2 freq gomerals (1) - 1 freq gomeril (2) - 15 freq gomeral (3) - 1 freq gomrell (4) - 1 freq generals (4) - 2 freq numerals (4) - 4 freq almerals (4) - 1 freq gomoral (4) - 1 freq girls (5) - 58 freq memorials (5) - 4 freq merdils (5) - 1 freq grals (5) - 1 freq homer's (5) - 1 freq gumrie's (5) - 1 freq gameramus (5) - 1 freq camarels (5) - 1 freq murals (5) - 8 freq bovrils (5) - 1 freq goners (5) - 1 freq gurls (5) - 1 freq comers (5) - 1 freq merles (5) - 1 freq gerbils (5) - 2 freq |
SoundEx code - G564 general - 200 freq gomeril - 15 freq generally - 55 freq gomerils - 5 freq generall - 1 freq gomerels - 2 freq gnarled - 4 freq gomrell - 1 freq generals - 2 freq generals' - 1 freq gnurlit - 3 freq gomerals - 1 freq gomoral - 1 freq géneral - 1 freq gineral - 3 freq genral - 4 freq €˜general - 2 freq general-education - 1 freq general-like - 1 freq 'general' - 1 freq genèral - 2 freq €”generally - 1 freq generalelection - 1 freq gomeral - 1 freq generalisations - 1 freq generalised - 1 freq |
MetaPhone code - KMRLS gomerils - 5 freq gomerels - 2 freq gomerals - 1 freq camarels - 1 freq |
GOMERILS |
| Time to execute Levenshtein function - 0.220116 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.366666 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.027415 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.038883 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.000859 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. |