Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
glorified (0) - 5 freq glorifeed (1) - 1 freq glorifee (2) - 1 freq gloried (2) - 1 freq glorifeet (2) - 1 freq notified (3) - 2 freq mortified (3) - 20 freq codified (3) - 4 freq fortified (3) - 4 freq floried (3) - 1 freq gliffed (3) - 3 freq verified (3) - 2 freq petrified (3) - 7 freq glorie (3) - 32 freq terrified (3) - 27 freq clarifie (3) - 1 freq gratified (3) - 1 freq horrified (3) - 7 freq modified (3) - 2 freq glorify (3) - 1 freq glories (3) - 9 freq pacified (4) - 1 freq gloved (4) - 4 freq crucified (4) - 1 freq gleniffer (4) - 2 freq |
glorified (0) - 5 freq glorifeed (1) - 1 freq gloried (3) - 1 freq glorifeet (3) - 1 freq glorifee (3) - 1 freq glorify (4) - 1 freq gliffed (4) - 3 freq gratified (5) - 1 freq horrified (5) - 7 freq gluffed (5) - 10 freq terrified (5) - 27 freq glared (5) - 2 freq glories (5) - 9 freq clarifie (5) - 1 freq glorie (5) - 32 freq verified (5) - 2 freq floried (5) - 1 freq petrified (5) - 7 freq glivved (6) - 1 freq glowed (6) - 5 freq glimped (6) - 2 freq relexified (6) - 1 freq qualified (6) - 13 freq horrifeed (6) - 3 freq glisked (6) - 10 freq |
SoundEx code - G461 glorified - 5 freq gilravagin - 4 freq glaur-broun-and-reid - 1 freq gilravitches - 1 freq gilravitch't - 1 freq gilravitch - 1 freq glorification - 1 freq gilravage - 1 freq glorifeed - 1 freq glorifee - 1 freq glorify - 1 freq glorifeet - 1 freq |
MetaPhone code - KLRFT glorified - 5 freq glorifeed - 1 freq glorifeet - 1 freq |
GLORIFIED |
Time to execute Levenshtein function - 0.190380 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.326702 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.027282 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.036970 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.000839 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. |