| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reinforcin (0) - 2 freq reinforce (2) - 6 freq reinforced (2) - 1 freq reinforces (2) - 2 freq enforcin (2) - 1 freq reformin (3) - 3 freq informin (3) - 4 freq enforcit (3) - 2 freq reportin (4) - 15 freq remorsin (4) - 1 freq inferrin (4) - 1 freq enforce (4) - 6 freq informing (4) - 2 freq conformin (4) - 3 freq resourcin (4) - 5 freq reminiscin (4) - 4 freq ranforced (4) - 1 freq rein-in (4) - 1 freq renderin (4) - 5 freq recordin (4) - 21 freq neiborin (4) - 1 freq refarin (4) - 1 freq rainforest (4) - 5 freq performin (4) - 12 freq deifferin (4) - 1 freq |
reinforcin (0) - 2 freq reinforce (3) - 6 freq enforcin (3) - 1 freq reinforces (3) - 2 freq reinforced (3) - 1 freq ranforced (5) - 1 freq enforcit (5) - 2 freq informin (5) - 4 freq reformin (5) - 3 freq infoarmin (6) - 1 freq rainforest (6) - 5 freq refarin (6) - 1 freq forcin (6) - 22 freq reinforcement (6) - 2 freq renderin (6) - 5 freq refrain (6) - 13 freq referin (6) - 1 freq referrin (6) - 11 freq enforced (6) - 3 freq resourcin (6) - 5 freq conformin (6) - 3 freq enforce (6) - 6 freq inferrin (6) - 1 freq rannerin (7) - 1 freq confirmin (7) - 1 freq |
SoundEx code - R516 rampart - 2 freq rainforest - 5 freq rainforests - 1 freq reinforcements - 2 freq reinforce - 6 freq reinforcin - 2 freq reimbursed - 1 freq rembrandt - 4 freq rembrancer - 1 freq renfra - 10 freq renfrew - 8 freq renfrewshire - 6 freq renfra's - 1 freq remover - 3 freq room-fresh' - 1 freq reinforcement - 2 freq ramversit - 1 freq ramparts - 2 freq reinforced - 1 freq reinforces - 2 freq remberance - 1 freq ranforced - 1 freq rhiannaparade - 5 freq rampur - 1 freq |
MetaPhone code - RNFRSN reinforcin - 2 freq |
REINFORCIN |
| Time to execute Levenshtein function - 0.228326 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.355775 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.027580 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.040941 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.001163 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. |