| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| resumption (0) - 1 freq presumption (1) - 3 freq redemption (2) - 4 freq assumption (2) - 12 freq regulation (3) - 4 freq assumptions (3) - 6 freq consumption (3) - 8 freq resolution (3) - 19 freq descrption (3) - 1 freq gumption (3) - 12 freq reduction (3) - 3 freq refutation (3) - 1 freq eruption (3) - 2 freq reception (3) - 30 freq demption (3) - 1 freq exemption (3) - 2 freq reputation (3) - 30 freq resultin (3) - 7 freq resumin (3) - 1 freq presumpcioun (3) - 2 freq resumt (4) - 1 freq respectin (4) - 4 freq education (4) - 421 freq resumet (4) - 2 freq repitition (4) - 1 freq |
resumption (0) - 1 freq presumption (2) - 3 freq assumption (3) - 12 freq redemption (3) - 4 freq presumpcioun (5) - 2 freq eruption (5) - 2 freq resultin (5) - 7 freq demption (5) - 1 freq reception (5) - 30 freq resolution (5) - 19 freq assumptions (5) - 6 freq consumption (5) - 8 freq exemption (5) - 2 freq resumin (5) - 1 freq gumption (5) - 12 freq presumptuous (6) - 1 freq eruptin (6) - 2 freq restin (6) - 31 freq unsurpation (6) - 1 freq kempton (6) - 4 freq temptin (6) - 11 freq casumptious (6) - 1 freq usurpation (6) - 3 freq resuman (6) - 1 freq rumplin (6) - 1 freq |
SoundEx code - R251 resumption - 1 freq reassembled - 1 freq resembles - 8 freq rognvald - 6 freq rosin-fite - 1 freq reasonable - 21 freq resembled - 6 freq resemble - 3 freq resemblin - 6 freq resemblance - 6 freq resemblence - 1 freq reasonably - 5 freq raisonable - 1 freq resembling - 1 freq raesonable-sized - 1 freq recompense - 3 freq resemblances - 2 freq raisonablie - 1 freq resounable - 1 freq raesonable - 1 freq recumbent - 2 freq re-convenes - 1 freq reconvened - 1 freq reassemblet - 1 freq reassemble - 1 freq reasonablie - 1 freq recompance - 2 freq recompence - 2 freq €˜recompance - 1 freq €˜recompence - 1 freq recompensed - 1 freq rzmpm - 1 freq rossmable - 1 freq rogjnfx - 1 freq |
MetaPhone code - RSMPXN resumption - 1 freq |
RESUMPTION |
| Time to execute Levenshtein function - 0.215020 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.392001 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.035506 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.037676 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.001131 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. |