| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ratified (0) - 9 freq gratified (1) - 1 freq pacified (2) - 1 freq ratifees (2) - 1 freq notified (2) - 2 freq setified (2) - 2 freq satisfied (2) - 21 freq rationed (2) - 4 freq satisfied' (3) - 1 freq radiated (3) - 1 freq latinised (3) - 1 freq satisfeed (3) - 2 freq rifled (3) - 1 freq fortified (3) - 4 freq ratier (3) - 1 freq petrified (3) - 7 freq magnified (3) - 2 freq cairied (3) - 12 freq retired (3) - 40 freq satisfies (3) - 1 freq railed (3) - 2 freq maitied (3) - 1 freq mairied (3) - 10 freq paecified (3) - 1 freq rattled (3) - 32 freq |
ratified (0) - 9 freq gratified (2) - 1 freq rationed (3) - 4 freq notified (3) - 2 freq setified (3) - 2 freq ratifees (3) - 1 freq fortified (4) - 4 freq ruifed (4) - 1 freq retired (4) - 40 freq mortified (4) - 20 freq rated (4) - 3 freq setifeed (4) - 1 freq satisfied (4) - 21 freq pacified (4) - 1 freq satefeed (4) - 11 freq fatigued (5) - 1 freq raiped (5) - 5 freq radioed (5) - 1 freq codified (5) - 4 freq justified (5) - 9 freq stidied (5) - 1 freq crucified (5) - 1 freq stifled (5) - 1 freq raided (5) - 4 freq rallied (5) - 6 freq |
SoundEx code - R313 redoubtable - 1 freq ratified - 9 freq red-tipped - 1 freq redpath's - 1 freq redpath - 2 freq rtepoetry - 1 freq |
MetaPhone code - RTFT ratified - 9 freq |
RATIFIED |
| Time to execute Levenshtein function - 0.390230 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.686076 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.028125 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.074866 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.001072 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. |