| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unrewardit (0) - 1 freq regardit (3) - 1 freq unwarkit (3) - 1 freq breardit (3) - 2 freq unguardit (3) - 1 freq rewairdit (3) - 2 freq rewardin (3) - 2 freq unreddit (3) - 1 freq unbardit (3) - 1 freq unrelatit (3) - 2 freq forewaelit (4) - 1 freq breardin (4) - 3 freq dreadit (4) - 1 freq unlearnin (4) - 1 freq remarkit (4) - 5 freq treadit (4) - 1 freq unneedit (4) - 1 freq forewarnin (4) - 2 freq unrecorded (4) - 1 freq unnerfit (4) - 5 freq regardin (4) - 2 freq reweirdit (4) - 1 freq perswaddit (4) - 1 freq regairdit (4) - 33 freq recordit (4) - 27 freq |
unrewardit (0) - 1 freq rewairdit (4) - 2 freq rewardin (5) - 2 freq reweirdit (5) - 1 freq unbardit (5) - 1 freq unreddit (5) - 1 freq regardit (5) - 1 freq unguardit (5) - 1 freq breardit (5) - 2 freq unwarkit (5) - 1 freq unrecorded (6) - 1 freq rewarded (6) - 2 freq regairdit (6) - 33 freq breirdit (6) - 2 freq recordit (6) - 27 freq rewairdin (6) - 1 freq reward (6) - 47 freq forwardin (6) - 1 freq norward (6) - 1 freq unrelatit (6) - 2 freq untaeward (6) - 1 freq untoward (6) - 1 freq norwards (6) - 1 freq awardit (6) - 4 freq rewards (6) - 6 freq |
SoundEx code - U566 un-rehearsed - 1 freq unnerwear - 1 freq unnerworld - 1 freq unnerwarld - 4 freq unrewardit - 1 freq |
MetaPhone code - UNRWRTT unrewardit - 1 freq |
UNREWARDIT |
| Time to execute Levenshtein function - 0.254215 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.507959 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.030100 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.039260 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.000905 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. |