| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| effort (0) - 99 freq effirt (1) - 3 freq effert (1) - 1 freq effart (1) - 1 freq efforts (1) - 50 freq escort (2) - 3 freq fort (2) - 38 freq eoort (2) - 1 freq export (2) - 10 freq offert (2) - 38 freq effect (2) - 94 freq afford (2) - 84 freq efforts' (2) - 1 freq port (3) - 70 freq seaforth (3) - 4 freq formt (3) - 2 freq afront (3) - 3 freq 'for' (3) - 2 freq €œfor (3) - 6 freq binort (3) - 1 freq efier (3) - 1 freq egfdqt (3) - 1 freq fowrt (3) - 3 freq aflot (3) - 2 freq ekurt (3) - 1 freq |
effort (0) - 99 freq effart (1) - 1 freq effirt (1) - 3 freq effert (1) - 1 freq offert (2) - 38 freq efforts (2) - 50 freq fort (3) - 38 freq afford (3) - 84 freq effect (3) - 94 freq oaffirt (3) - 2 freq offerit (3) - 1 freq oafurt (4) - 1 freq offer't (4) - 1 freq fdrt (4) - 1 freq suffert (4) - 9 freq affect (4) - 10 freq affset (4) - 2 freq effeirs (4) - 13 freq forit (4) - 1 freq afft (4) - 1 freq flirt (4) - 6 freq feart (4) - 537 freq affordit (4) - 3 freq buffert (4) - 4 freq effairs (4) - 3 freq |
SoundEx code - E163 everything - 96 freq efforts - 50 freq everythin - 113 freq everythin's - 3 freq everytime - 10 freq effort - 99 freq everywhaut - 1 freq everyday - 32 freq everything's - 3 freq everday - 2 freq eupboards - 1 freq effert - 1 freq effirt - 3 freq everything'll - 1 freq effart - 1 freq everyday' - 1 freq ever-decreasing - 1 freq €œeveryday - 2 freq effortlessly - 4 freq everthin - 2 freq €œeverything - 2 freq everythin' - 1 freq €™everything - 1 freq eberdeen - 3 freq evertype - 2 freq everthings - 1 freq efforts' - 1 freq everythins - 3 freq everton - 3 freq everydaysaschoolday - 1 freq |
MetaPhone code - EFRT effort - 99 freq everyday - 32 freq everday - 2 freq effert - 1 freq effirt - 3 freq effart - 1 freq everyday' - 1 freq €œeveryday - 2 freq |
EFFORT effort - 99 freq efforts - 50 freq |
| Time to execute Levenshtein function - 0.205380 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.337063 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.027827 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.038204 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.000838 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. |