| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rifted (0) - 1 freq drifted (1) - 10 freq sifted (1) - 1 freq gifted (1) - 8 freq rifled (1) - 1 freq lifted (1) - 99 freq fisted (2) - 1 freq reeted (2) - 4 freq liftcd (2) - 1 freq rested (2) - 12 freq fixted (2) - 1 freq righted (2) - 2 freq rife (2) - 18 freq rooted (2) - 12 freq lfted (2) - 1 freq rite (2) - 56 freq tilted (2) - 5 freq miffed (2) - 4 freq fitted (2) - 27 freq ruited (2) - 4 freq ried (2) - 2 freq crafted (2) - 2 freq ifter (2) - 1 freq liftid (2) - 1 freq misted (2) - 2 freq |
rifted (0) - 1 freq refuted (2) - 1 freq rifled (2) - 1 freq lifted (2) - 99 freq gifted (2) - 8 freq drifted (2) - 10 freq sifted (2) - 1 freq rutted (3) - 1 freq grafted (3) - 4 freq ranted (3) - 4 freq rented (3) - 5 freq tufted (3) - 1 freq rifts (3) - 6 freq reisted (3) - 1 freq rotted (3) - 1 freq ruifed (3) - 1 freq rowted (3) - 1 freq riveted (3) - 1 freq airted (3) - 31 freq rated (3) - 3 freq giftid (3) - 1 freq riftin (3) - 6 freq rted (3) - 1 freq lufted (3) - 5 freq drafted (3) - 2 freq |
SoundEx code - R133 repeatit - 52 freq repeated - 32 freq reputation - 30 freq refuted - 1 freq riftit - 1 freq reputit - 2 freq rifted - 1 freq repeatedly - 4 freq riveted - 1 freq repetition - 6 freq repeatet - 6 freq reputatioun - 2 freq rebooted - 1 freq repeteetion - 4 freq rapidity - 1 freq refutautioun - 2 freq repetit - 1 freq reputaetional - 1 freq repaitit - 5 freq rebattit - 2 freq repetitious - 1 freq 'reputations' - 1 freq repeteition - 1 freq rubbit-oot - 1 freq reputations - 1 freq €˜reputation - 1 freq repitition - 1 freq repetitive - 2 freq repeatitly - 2 freq rabbitheadal - 1 freq rippeditup - 1 freq refutation - 1 freq rebutted - 1 freq |
MetaPhone code - RFTT refuted - 1 freq riftit - 1 freq rifted - 1 freq riveted - 1 freq righted - 2 freq |
RIFTED |
| Time to execute Levenshtein function - 0.255466 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.429578 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.030142 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.041109 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.000959 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. |