| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ratified (0) - 9 freq gratified (1) - 1 freq satisfied (2) - 21 freq notified (2) - 2 freq setified (2) - 2 freq ratifees (2) - 1 freq pacified (2) - 1 freq rationed (2) - 4 freq mairied (3) - 10 freq modified (3) - 2 freq richtified (3) - 1 freq latinised (3) - 1 freq rallied (3) - 6 freq codified (3) - 4 freq gratiteed (3) - 1 freq raiked (3) - 5 freq raired (3) - 39 freq satisfie (3) - 1 freq ruifed (3) - 1 freq bambified (3) - 1 freq stidied (3) - 1 freq fatigued (3) - 1 freq radioed (3) - 1 freq fortified (3) - 4 freq petrified (3) - 7 freq |
ratified (0) - 9 freq gratified (2) - 1 freq rationed (3) - 4 freq ratifees (3) - 1 freq setified (3) - 2 freq notified (3) - 2 freq mortified (4) - 20 freq setifeed (4) - 1 freq rated (4) - 3 freq satefeed (4) - 11 freq retired (4) - 42 freq satisfied (4) - 21 freq pacified (4) - 1 freq ruifed (4) - 1 freq fortified (4) - 4 freq reteired (5) - 3 freq unified (5) - 3 freq qualified (5) - 15 freq paecified (5) - 1 freq mystified (5) - 2 freq tidied (5) - 7 freq settified (5) - 1 freq ratties (5) - 2 freq raided (5) - 4 freq rattled (5) - 34 freq |
SoundEx code - R313 redoubtable - 1 freq redpath - 3 freq ratified - 9 freq red-tipped - 1 freq redpath's - 1 freq rtepoetry - 1 freq |
MetaPhone code - RTFT ratified - 9 freq |
RATIFIED |
| Time to execute Levenshtein function - 0.236950 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.410070 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.031323 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.041776 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.000876 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. |