| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reinforce (0) - 6 freq reinforces (1) - 2 freq reinforced (1) - 1 freq reinforcin (2) - 1 freq enforce (2) - 6 freq ranforced (3) - 1 freq airforce (3) - 2 freq enforced (3) - 3 freq resoorce (3) - 4 freq referee (4) - 15 freq herefore (4) - 1 freq enforcit (4) - 2 freq pre-norse (4) - 1 freq reminisce (4) - 5 freq reinhard (4) - 4 freq binfire (4) - 1 freq reintroduce (4) - 1 freq reforms (4) - 2 freq rainforest (4) - 5 freq rejoice (4) - 10 freq remorse (4) - 5 freq infor (4) - 1 freq reinge (4) - 26 freq kenmore (4) - 1 freq weirfare (4) - 3 freq |
reinforce (0) - 6 freq reinforced (2) - 1 freq reinforces (2) - 2 freq enforce (3) - 6 freq reinforcin (3) - 1 freq ranforced (4) - 1 freq airforce (4) - 2 freq renfrew (5) - 8 freq resoorce (5) - 4 freq enforced (5) - 3 freq renfra (5) - 10 freq infor (6) - 1 freq warkforce (6) - 1 freq enforcin (6) - 1 freq pinafore (6) - 1 freq minorca (6) - 1 freq resource (6) - 68 freq inform (6) - 17 freq reinhard (6) - 4 freq infors (6) - 1 freq enforcit (6) - 2 freq reform (6) - 42 freq referee (6) - 15 freq force (6) - 126 freq workforce (6) - 2 freq |
SoundEx code - R516 rampart - 2 freq rainforest - 5 freq rainforests - 1 freq reinforcements - 2 freq reinforce - 6 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 reinforcin - 1 freq rhiannaparade - 5 freq rampur - 1 freq |
MetaPhone code - RNFRS reinforce - 6 freq renfra's - 1 freq |
REINFORCE |
| Time to execute Levenshtein function - 0.214728 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.367483 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.027993 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.037355 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.000861 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. |