| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| generally (0) - 56 freq generall (1) - 1 freq generals' (2) - 1 freq generals (2) - 2 freq general (2) - 200 freq €”generally (2) - 1 freq centrally (2) - 1 freq 'general' (3) - 1 freq reeeally (3) - 1 freq gineral (3) - 3 freq generator (3) - 3 freq feenally (3) - 1 freq genral (3) - 4 freq venerable (3) - 1 freq genetically (3) - 1 freq leeterally (3) - 2 freq literally (3) - 42 freq eternally (3) - 7 freq generously (3) - 1 freq generated (3) - 2 freq liberally (3) - 1 freq genealogy (3) - 6 freq generatit (3) - 2 freq mentally (3) - 9 freq iterally (3) - 1 freq |
generally (0) - 56 freq generall (1) - 1 freq generals (3) - 2 freq general (3) - 200 freq generously (4) - 1 freq gineral (4) - 3 freq €”generally (4) - 1 freq centrally (4) - 1 freq generals' (4) - 1 freq genral (4) - 4 freq liberally (5) - 1 freq generated (5) - 2 freq iterally (5) - 1 freq mentally (5) - 9 freq generatit (5) - 2 freq genealogy (5) - 6 freq generate (5) - 4 freq generator (5) - 3 freq 'general' (5) - 1 freq literally (5) - 42 freq feenally (5) - 1 freq reeeally (5) - 1 freq venerable (5) - 1 freq leeterally (5) - 2 freq genetically (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 - JNRL general - 200 freq generally - 56 freq generall - 1 freq gineral - 3 freq genral - 4 freq €˜general - 2 freq 'general' - 1 freq genèral - 2 freq €”generally - 1 freq jonrell - 1 freq |
GENERALLY |
| Time to execute Levenshtein function - 0.218288 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.380874 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.027270 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.037286 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.000907 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. |