| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| freelance (0) - 6 freq seelance (2) - 1 freq greeance (2) - 18 freq reelan (3) - 3 freq feelan (3) - 18 freq freench (3) - 3 freq freezan (3) - 2 freq feelans (3) - 2 freq grievance (3) - 1 freq trublance (3) - 2 freq reliance (3) - 4 freq forderance (3) - 2 freq relevance (3) - 5 freq fragrance (3) - 5 freq freelie (3) - 3 freq france (3) - 85 freq replace (3) - 21 freq freeman (3) - 3 freq greeances (3) - 1 freq seelence (3) - 73 freq fireplace (3) - 25 freq veelence (3) - 1 freq brilliance (4) - 11 freq feline (4) - 16 freq abeyance (4) - 1 freq |
freelance (0) - 6 freq reliance (4) - 4 freq france (4) - 85 freq greeance (4) - 18 freq seelance (4) - 1 freq veelence (5) - 1 freq frequency (5) - 4 freq fraince (5) - 1 freq fireplace (5) - 25 freq fraunce (5) - 29 freq parlance (5) - 2 freq francie (5) - 2 freq franc (5) - 6 freq flunce (5) - 1 freq freeman (5) - 3 freq frunce (5) - 1 freq seelence (5) - 73 freq grievance (5) - 1 freq freench (5) - 3 freq franca (5) - 8 freq freezan (5) - 2 freq feelans (5) - 2 freq trublance (5) - 2 freq feelan (5) - 18 freq reelan (5) - 3 freq |
SoundEx code - F645 forelands - 2 freq fur-lined - 2 freq furlin - 15 freq furlongs - 2 freq furlen - 1 freq freelance - 6 freq fairlan' - 1 freq fairyland - 1 freq farland - 1 freq ferliein - 3 freq faireland - 1 freq feorlean - 3 freq |
MetaPhone code - FRLNS freelance - 6 freq |
FREELANCE freelance - 6 freq |
| Time to execute Levenshtein function - 0.514738 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.898902 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.075271 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.094715 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.001034 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. |