| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| refurbishment (0) - 4 freq refurbished (3) - 2 freq refurbisht (3) - 1 freq refreshment (3) - 6 freq refreshments (4) - 7 freq nourishment (4) - 3 freq refraishit (5) - 2 freq warnishment (5) - 1 freq nourishmint (5) - 1 freq nirishment (5) - 1 freq establishment (5) - 27 freq ravishment (5) - 1 freq enrichment (5) - 1 freq refinement (5) - 3 freq requirement (5) - 7 freq punishment (5) - 31 freq recruitment (5) - 8 freq referent (6) - 3 freq refraischin (6) - 1 freq debasement (6) - 1 freq refreshes (6) - 1 freq reishelt (6) - 1 freq banishment (6) - 3 freq bemusement (6) - 2 freq establishments (6) - 11 freq |
refurbishment (0) - 4 freq refreshment (4) - 6 freq refurbisht (5) - 1 freq refurbished (6) - 2 freq refreshments (6) - 7 freq nourishment (7) - 3 freq ravishment (8) - 1 freq nirishment (8) - 1 freq warnishment (8) - 1 freq refraishit (8) - 2 freq nourishmint (8) - 1 freq recruitment (9) - 8 freq punishment (9) - 31 freq refreshing (9) - 4 freq refreshin (9) - 6 freq refinement (9) - 3 freq establishment (9) - 27 freq requirement (9) - 7 freq enrichment (9) - 1 freq rearmament (10) - 1 freq plenishment (10) - 9 freq furnishin (10) - 1 freq rearrangement (10) - 1 freq reformist (10) - 1 freq advertisement (10) - 2 freq |
SoundEx code - R161 rhubarb - 10 freq reprobate - 1 freq roobarb - 1 freq reverberates - 1 freq rif-raff - 1 freq rubber-buttoned - 1 freq reprieve - 5 freq reverberated - 2 freq riverbanks - 2 freq riverbank - 4 freq repairable - 1 freq reperable - 1 freq riverbed - 1 freq rhubairb - 2 freq roubrub - 2 freq rhuburb - 4 freq refurbished - 2 freq refurbishment - 4 freq riffraff - 1 freq repruved - 1 freq repreive - 1 freq reverberatin - 1 freq reprobates - 2 freq refurbisht - 1 freq riverebbs - 1 freq riff-raff - 1 freq river-bank - 1 freq rubberpusswillbeoot - 1 freq |
MetaPhone code - RFRBXMNT refurbishment - 4 freq |
REFURBISHMENT |
| Time to execute Levenshtein function - 0.591595 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 - 1.091659 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.038202 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.090680 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.000957 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. |