| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| requiring (0) - 2 freq requirin (1) - 1 freq recurring (2) - 1 freq requoting (2) - 1 freq acquiring (2) - 1 freq enquiring (2) - 1 freq retiring (2) - 4 freq requirit (2) - 1 freq enquirin (3) - 3 freq rendering (3) - 1 freq ruining (3) - 3 freq requerit (3) - 1 freq retirin (3) - 10 freq acquirin (3) - 3 freq returning (3) - 9 freq squaring (3) - 1 freq require (3) - 10 freq requiremint (3) - 1 freq recruiting (3) - 1 freq reviving (3) - 1 freq retuirn (3) - 1 freq remaining (3) - 5 freq requirt (3) - 1 freq rewirin' (3) - 1 freq reuniting (3) - 1 freq |
requiring (0) - 2 freq requirin (2) - 1 freq enquiring (3) - 1 freq retiring (3) - 4 freq requoting (3) - 1 freq acquiring (3) - 1 freq retouring (4) - 1 freq squaring (4) - 1 freq requirit (4) - 1 freq recurring (4) - 1 freq rejoicing (5) - 2 freq retuirnt (5) - 3 freq referring (5) - 7 freq requires (5) - 10 freq repairin (5) - 3 freq rewirin (5) - 1 freq receiving (5) - 4 freq roaring (5) - 5 freq raring (5) - 2 freq reuniting (5) - 1 freq refusing (5) - 5 freq restoring (5) - 1 freq reciting (5) - 1 freq required (5) - 28 freq requerit (5) - 1 freq |
SoundEx code - R265 reassurance - 5 freq reassuringly - 2 freq reassurin - 7 freq requirement - 7 freq re-occurrin - 1 freq requirements - 14 freq recriminations - 1 freq reserrin - 1 freq recurrent - 2 freq recurrin - 2 freq requiring - 2 freq reassuran - 1 freq €˜rogerin - 1 freq re-assurance - 1 freq ragoran - 6 freq €œragoran - 1 freq reassuring - 2 freq recurring - 1 freq requirin - 1 freq rwgerruhmw - 1 freq rosgrams - 1 freq rogermiles - 1 freq rczrim - 1 freq requiremint - 1 freq |
MetaPhone code - RKRNK requiring - 2 freq recurring - 1 freq |
REQUIRING |
| Time to execute Levenshtein function - 0.469532 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.830464 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.085517 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.097954 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.001179 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. |