| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| riper (0) - 4 freq ripen (1) - 8 freq riped (1) - 2 freq ripper (1) - 10 freq piper (1) - 31 freq rimer (1) - 1 freq riter (1) - 1 freq viper (1) - 1 freq river (1) - 270 freq iper (1) - 7 freq ripe (1) - 28 freq rider (1) - 10 freq liper (1) - 1 freq tripe (2) - 17 freq niver (2) - 851 freq diver (2) - 5 freq rupes (2) - 1 freq biker (2) - 3 freq rippet (2) - 7 freq rie (2) - 1 freq tripper (2) - 1 freq kuiper (2) - 11 freq rior (2) - 1 freq rasper (2) - 1 freq rivers (2) - 30 freq |
riper (0) - 4 freq ripe (2) - 28 freq iper (2) - 7 freq rider (2) - 10 freq rapier (2) - 2 freq reaper (2) - 20 freq river (2) - 270 freq rpr (2) - 2 freq liper (2) - 1 freq ripen (2) - 8 freq ripper (2) - 10 freq piper (2) - 31 freq riped (2) - 2 freq riter (2) - 1 freq rimer (2) - 1 freq viper (2) - 1 freq ropey (3) - 1 freq rip (3) - 57 freq rape- (3) - 2 freq proper (3) - 184 freq pyper (3) - 4 freq gyper (3) - 1 freq rower (3) - 2 freq reiver (3) - 22 freq hyper (3) - 4 freq |
SoundEx code - R160 river - 270 freq reappear - 6 freq rubber - 54 freq riper - 4 freq reverie - 2 freq referee - 15 freq 'rubber - 1 freq repair - 15 freq rapier - 2 freq rover - 12 freq reiver - 22 freq refer - 37 freq revoir - 5 freq raver - 4 freq rapper - 4 freq raverie - 1 freq ripper - 10 freq reaper - 20 freq riever - 2 freq robbery - 8 freq reviewer - 2 freq rubbery - 7 freq rïver - 5 freq robber - 3 freq ryver - 1 freq reveiry - 1 freq reapir - 1 freq reever - 2 freq re-fere - 1 freq rubbir - 1 freq rpr - 2 freq revere - 1 freq re-appear - 1 freq riviera - 1 freq robfray - 1 freq |
MetaPhone code - RPR reappear - 6 freq riper - 4 freq wrapper - 22 freq repair - 15 freq rapier - 2 freq rapper - 4 freq ripper - 10 freq reaper - 20 freq reapir - 1 freq rpr - 2 freq re-appear - 1 freq |
RIPER |
| Time to execute Levenshtein function - 0.217197 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.364766 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.027185 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.036969 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.000842 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. |