| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| efforts (0) - 50 freq efforts' (1) - 1 freq effort (1) - 99 freq effart (2) - 1 freq effects (2) - 23 freq escorts (2) - 1 freq effirt (2) - 3 freq effert (2) - 1 freq forts (2) - 3 freq effecks (3) - 21 freq escort (3) - 3 freq offers (3) - 59 freq effairs (3) - 3 freq effect's (3) - 1 freq export (3) - 10 freq forte (3) - 5 freq foosts (3) - 2 freq imports (3) - 2 freq frosts (3) - 3 freq dorts (3) - 8 freq coorts (3) - 9 freq offert (3) - 38 freq endoits (3) - 1 freq effie's (3) - 1 freq experts (3) - 25 freq |
efforts (0) - 50 freq effort (2) - 99 freq efforts' (2) - 1 freq effert (3) - 1 freq effirt (3) - 3 freq forts (3) - 3 freq effart (3) - 1 freq effects (3) - 23 freq effeirs (4) - 13 freq affects (4) - 9 freq effairs (4) - 3 freq offers (4) - 59 freq farts (4) - 5 freq escorts (4) - 1 freq offert (4) - 38 freq effeks (5) - 1 freq enfants (5) - 1 freq effies (5) - 1 freq ports (5) - 10 freq soorts (5) - 2 freq flotts (5) - 1 freq forss (5) - 3 freq erts (5) - 11 freq informs (5) - 8 freq frets (5) - 2 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 - EFRTS efforts - 50 freq efforts' - 1 freq |
EFFORTS effort - 99 freq efforts - 50 freq |
| Time to execute Levenshtein function - 0.183761 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.354688 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.027379 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.043459 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.000989 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. |