| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reinforces (0) - 2 freq reinforce (1) - 6 freq reinforced (1) - 1 freq reinforcin (2) - 2 freq resoorces (3) - 20 freq enforced (3) - 3 freq enforce (3) - 6 freq ranforced (3) - 1 freq rainforest (3) - 5 freq reforms (4) - 2 freq renfra's (4) - 1 freq enforcin (4) - 1 freq restores (4) - 2 freq resoorce (4) - 4 freq informers (4) - 2 freq uninformed (4) - 1 freq reinges (4) - 5 freq rainforests (4) - 1 freq airforce (4) - 2 freq reinforcement (4) - 2 freq divorces (4) - 2 freq forces (4) - 42 freq referees (4) - 2 freq invoices (4) - 1 freq informs (4) - 9 freq |
reinforces (0) - 2 freq reinforced (2) - 1 freq reinforce (2) - 6 freq reinforcin (3) - 2 freq ranforced (4) - 1 freq renfra's (5) - 1 freq rainforest (5) - 5 freq enforce (5) - 6 freq resoorces (5) - 20 freq enforced (5) - 3 freq referees (6) - 2 freq forces (6) - 42 freq informs (6) - 9 freq renfrew (6) - 8 freq airforce (6) - 2 freq resources (6) - 219 freq infors (6) - 1 freq enforcit (6) - 2 freq enforcin (6) - 1 freq reforms (6) - 2 freq rainforests (6) - 1 freq raindraps (7) - 4 freq bonfires (7) - 8 freq rendirs (7) - 2 freq references (7) - 41 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 - RNFRSS reinforces - 2 freq |
REINFORCES |
| Time to execute Levenshtein function - 0.322618 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.778013 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.076108 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.086071 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.000859 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. |