Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gomrell (0) - 1 freq gomerels (2) - 2 freq jonrell (2) - 1 freq gomez (3) - 1 freq homely (3) - 2 freq gormal (3) - 1 freq sorrel (3) - 1 freq gorbel (3) - 1 freq do-well (3) - 2 freq gomed (3) - 18 freq mell (3) - 23 freq €™msell (3) - 1 freq gomoral (3) - 1 freq gemmel (3) - 1 freq gomeril (3) - 15 freq donnell (3) - 1 freq rommel (3) - 1 freq gomper (3) - 3 freq terrell (3) - 4 freq foswell (3) - 6 freq gell (3) - 5 freq compels (3) - 1 freq gbell (3) - 1 freq gorble (3) - 2 freq grill (3) - 5 freq |
gomrell (0) - 1 freq gomerels (3) - 2 freq gomeral (4) - 1 freq gomeril (4) - 15 freq gabriell (4) - 1 freq gomoral (4) - 1 freq gomerals (4) - 1 freq gorilla (4) - 7 freq grill (4) - 5 freq jonrell (4) - 1 freq gomerils (4) - 5 freq gemmely (5) - 1 freq smell (5) - 271 freq himsell (5) - 14 freq morally (5) - 3 freq some'll (5) - 1 freq burrell (5) - 4 freq goodall (5) - 1 freq god'll (5) - 1 freq gorble (5) - 2 freq generall (5) - 1 freq gemmelt (5) - 1 freq gell (5) - 5 freq gbell (5) - 1 freq farrell (5) - 1 freq |
SoundEx code - G564 general - 200 freq gomeril - 15 freq generally - 56 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 - KMRL gomeril - 15 freq gomrell - 1 freq gomoral - 1 freq €˜kimberley - 1 freq gomeral - 1 freq |
GOMRELL |
Time to execute Levenshtein function - 0.218245 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.379178 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.027876 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.042701 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.000860 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. |