Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
god-almighty (0) - 1 freq dalmichty (4) - 3 freq almighty (4) - 9 freq almichty (5) - 40 freq modality (5) - 2 freq awmighty (5) - 1 freq almightly (5) - 1 freq moonlight (6) - 3 freq €˜alright (6) - 1 freq draughty (6) - 1 freq blighty (6) - 1 freq tealight (6) - 1 freq normality (6) - 9 freq mighty (6) - 41 freq draiglty (6) - 1 freq morality (6) - 8 freq dighty (6) - 2 freq alright (6) - 21 freq flighty (6) - 3 freq locality (6) - 3 freq love-light (6) - 1 freq aamichty (6) - 9 freq daylight (6) - 22 freq goamit (6) - 1 freq gaslight (6) - 1 freq |
god-almighty (0) - 1 freq almighty (7) - 9 freq dalmichty (7) - 3 freq daylight (9) - 22 freq love-light (9) - 1 freq delight (9) - 33 freq gaslight (9) - 1 freq god-damnt (9) - 1 freq ash-light (9) - 1 freq almichty (9) - 40 freq awmighty (9) - 1 freq almightly (9) - 1 freq goodnight (9) - 7 freq alight (10) - 3 freq too-tight (10) - 1 freq tail-light (10) - 1 freq 'alright (10) - 2 freq almychty (10) - 1 freq coorslight (10) - 1 freq gulmoget (10) - 1 freq day-licht (10) - 1 freq hauf-light (10) - 2 freq lead-licht (10) - 3 freq heidlight (10) - 1 freq guid-mither (10) - 6 freq |
SoundEx code - G345 guddlin - 11 freq god-almighty - 1 freq guidelines - 26 freq godlin - 1 freq gait-lam - 1 freq godliness - 1 freq |
MetaPhone code - KTLMFT god-almighty - 1 freq |
GOD-ALMIGHTY |
Time to execute Levenshtein function - 0.407140 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.641884 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.061725 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.039241 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.000844 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. |