| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| faemier (0) - 2 freq faemen (2) - 1 freq faevir (2) - 2 freq fancier (2) - 3 freq faeder (2) - 4 freq faetter (2) - 1 freq fae'iver (2) - 2 freq faether (2) - 11 freq premier (2) - 7 freq naemer (2) - 3 freq faemin (2) - 1 freq famie (2) - 1 freq faercer (2) - 1 freq farrier (2) - 2 freq faeries (2) - 14 freq farmer (2) - 9 freq aesier (2) - 13 freq faerie (2) - 8 freq fayer (3) - 3 freq aisier (3) - 12 freq naether (3) - 5 freq bremmer (3) - 1 freq earlier (3) - 109 freq fairie (3) - 4 freq faniver (3) - 1 freq |
faemier (0) - 2 freq naemer (3) - 3 freq faemin (3) - 1 freq faerie (3) - 8 freq famour (3) - 1 freq farmer (3) - 9 freq famie (3) - 1 freq faevir (3) - 2 freq faemen (3) - 1 freq faeder (3) - 4 freq firmer (4) - 4 freq haimer (4) - 2 freq femlie (4) - 25 freq famed (4) - 9 freq feeder (4) - 5 freq tamer (4) - 2 freq feir (4) - 7 freq faemly (4) - 1 freq fayter (4) - 1 freq femlee (4) - 1 freq faimily (4) - 189 freq fairer (4) - 12 freq faeman (4) - 1 freq famine (4) - 15 freq caumer (4) - 1 freq |
SoundEx code - F560 finer - 14 freq finerie - 2 freq fooner - 4 freq finery - 5 freq funner - 1 freq faemier - 2 freq famour - 1 freq funnier - 7 freq fweohnor - 1 freq fnaar - 2 freq fwmre - 1 freq |
MetaPhone code - FMR faemier - 2 freq famour - 1 freq vimmer - 3 freq fwmre - 1 freq |
FAEMIER |
| Time to execute Levenshtein function - 0.191621 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.374113 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.027504 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.037752 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.000896 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. |