| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rivening (0) - 1 freq evening (2) - 75 freq ripenin (2) - 5 freq ravenin (2) - 1 freq rinning (2) - 7 freq wisening (2) - 1 freq evenings (3) - 1 freq rinnin (3) - 330 freq grinning (3) - 5 freq rivlin (3) - 5 freq evenins (3) - 10 freq raining (3) - 5 freq ringing (3) - 4 freq rinnin' (3) - 3 freq mining (3) - 5 freq giving (3) - 25 freq rite-in (3) - 2 freq reviving (3) - 1 freq sickening (3) - 2 freq rivened (3) - 1 freq ravelings (3) - 1 freq winning (3) - 13 freq piecing (3) - 1 freq reeking (3) - 1 freq rivlins (3) - 2 freq |
rivening (0) - 1 freq ravenin (3) - 1 freq rinning (3) - 7 freq evening (3) - 75 freq vining (4) - 17 freq ruining (4) - 2 freq reviving (4) - 1 freq raining (4) - 5 freq revealing (4) - 2 freq ironing (4) - 3 freq wisening (4) - 1 freq running (4) - 47 freq raving (4) - 2 freq ripenin (4) - 5 freq inning (5) - 1 freq ravelin (5) - 3 freq reing (5) - 2 freq develing (5) - 1 freq lining (5) - 1 freq ripping (5) - 1 freq renting (5) - 2 freq pining (5) - 1 freq governing (5) - 1 freq driving (5) - 19 freq divinin (5) - 1 freq |
SoundEx code - R155 repeyment - 1 freq refinement - 3 freq ripenin - 5 freq reponin - 2 freq ravenin - 1 freq refinin - 2 freq reponents - 1 freq ruifmemmers - 1 freq rpmmomthvo - 1 freq rivening - 1 freq robbiemenzies - 8 freq |
MetaPhone code - RFNNK rivening - 1 freq |
RIVENING |
| Time to execute Levenshtein function - 0.203886 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.373447 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.029860 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.038838 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.001048 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. |