| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reponin (0) - 2 freq reconin (1) - 1 freq reponit (1) - 8 freq repone (2) - 68 freq repond (2) - 1 freq repentin (2) - 1 freq refinin (2) - 2 freq replyin (2) - 9 freq roonin (2) - 1 freq repons (2) - 1 freq respondin (2) - 1 freq reckonin (2) - 13 freq ripenin (2) - 5 freq repones (2) - 59 freq rejoin (2) - 3 freq reasonin (2) - 5 freq repon (2) - 8 freq reportin (2) - 15 freq removin (2) - 5 freq reponse (2) - 1 freq reponed (2) - 60 freq rennin (2) - 6 freq imponin (2) - 1 freq proponin (2) - 3 freq remindin (3) - 19 freq |
reponin (0) - 2 freq reponit (2) - 8 freq reconin (2) - 1 freq ripenin (2) - 5 freq reasonin (3) - 5 freq reponse (3) - 1 freq repon (3) - 8 freq rennin (3) - 6 freq proponin (3) - 3 freq imponin (3) - 1 freq reponed (3) - 60 freq repones (3) - 59 freq refinin (3) - 2 freq repentin (3) - 1 freq repond (3) - 1 freq repone (3) - 68 freq roonin (3) - 1 freq replyin (3) - 9 freq repons (3) - 1 freq rnin (4) - 1 freq reinen (4) - 1 freq reunion (4) - 6 freq reparein (4) - 2 freq rainin (4) - 41 freq deepenin (4) - 3 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 - RPNN ripenin - 5 freq reponin - 2 freq |
REPONIN |
| Time to execute Levenshtein function - 0.293489 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.523258 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.039526 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.048557 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.001021 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. |