| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| finery (0) - 5 freq fiery (1) - 28 freq finely (1) - 3 freq jinery (1) - 1 freq finer (1) - 14 freq fifer (2) - 11 freq feery (2) - 1 freq finerie (2) - 2 freq miner (2) - 7 freq fiter (2) - 1 freq einer (2) - 1 freq fierdy (2) - 1 freq fine (2) - 1603 freq finest (2) - 59 freq fikey (2) - 1 freq fiver (2) - 46 freq wintry (2) - 5 freq kinely (2) - 4 freq ivery (2) - 188 freq fifers (2) - 8 freq fines' (2) - 1 freq fivers (2) - 3 freq wintery (2) - 5 freq joinery (2) - 5 freq finger (2) - 202 freq |
finery (0) - 5 freq finer (1) - 14 freq jinery (2) - 1 freq finerie (2) - 2 freq fiery (2) - 28 freq finely (2) - 3 freq fakery (3) - 1 freq fiere (3) - 4 freq liner (3) - 4 freq ainer (3) - 2 freq finlay (3) - 18 freq diner (3) - 1 freq fooner (3) - 4 freq binary (3) - 4 freq refinery (3) - 1 freq fine' (3) - 1 freq fined (3) - 12 freq faery (3) - 2 freq hinry (3) - 1 freq jiner (3) - 7 freq fines (3) - 7 freq henery (3) - 1 freq fier (3) - 6 freq firey (3) - 2 freq fioory (3) - 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 - FNR finer - 14 freq vanir - 5 freq finerie - 2 freq fooner - 4 freq finery - 5 freq funner - 1 freq funnier - 7 freq venera - 2 freq veneer - 1 freq fnaar - 2 freq |
FINERY |
| Time to execute Levenshtein function - 0.221651 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.519228 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.027135 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.071204 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.000913 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. |