| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fineries (0) - 1 freq finerie (1) - 2 freq liveries (2) - 1 freq fieres (2) - 3 freq sindries (2) - 1 freq intries (2) - 1 freq fierie (2) - 2 freq fisheries (2) - 6 freq inemies (2) - 3 freq miseries (2) - 2 freq faeries (2) - 14 freq kintries (2) - 4 freq nineties (2) - 7 freq kintrie's (3) - 1 freq fingirs (3) - 58 freq fiddies (3) - 1 freq finnins (3) - 1 freq fripperies (3) - 3 freq lingerie (3) - 1 freq kintraes (3) - 8 freq peeries (3) - 2 freq inehes (3) - 1 freq flurries (3) - 2 freq diaries (3) - 5 freq sindrie (3) - 39 freq |
fineries (0) - 1 freq finerie (2) - 2 freq fieres (3) - 3 freq faeries (3) - 14 freq fivers (4) - 3 freq figures (4) - 48 freq jiners (4) - 6 freq fifers (4) - 8 freq nories (4) - 25 freq henries (4) - 1 freq fingers (4) - 255 freq flooeries (4) - 1 freq fibres (4) - 2 freq miners (4) - 41 freq fancies (4) - 27 freq foondries (4) - 2 freq finer (4) - 14 freq fairies (4) - 39 freq fires (4) - 48 freq liners (4) - 2 freq fines (4) - 7 freq diners (4) - 1 freq fixers (4) - 1 freq funcies (4) - 5 freq finders (4) - 2 freq |
SoundEx code - F562 fineries - 1 freq fun-raisin - 1 freq fanners - 1 freq fmrj - 1 freq |
MetaPhone code - FNRS fineries - 1 freq veneers - 1 freq fanners - 1 freq |
FINERIES |
| Time to execute Levenshtein function - 0.519585 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.996173 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.081376 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.100083 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.001305 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. |