| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fiefdom (0) - 1 freq fifedom (2) - 1 freq feydom (2) - 2 freq freedom (2) - 110 freq field (3) - 227 freq seldom (3) - 25 freq fifd (3) - 1 freq freddo (3) - 1 freq fwicfdo (3) - 1 freq fandom (3) - 1 freq fiend (3) - 4 freq faersom (3) - 1 freq faddom (3) - 8 freq fields (3) - 148 freq fethom (3) - 1 freq fierdy (3) - 1 freq friedome (3) - 5 freq fifacom (3) - 3 freq wisdom (3) - 43 freq feersom (3) - 2 freq fie'd (3) - 1 freq fido (3) - 1 freq fiends (3) - 2 freq fief (3) - 1 freq gaeldom (3) - 1 freq |
fiefdom (0) - 1 freq fifedom (2) - 1 freq freedom (3) - 110 freq feydom (3) - 2 freq fifacom (4) - 3 freq friedome (4) - 5 freq fandom (4) - 1 freq fredome (4) - 1 freq faddom (4) - 8 freq fifd (4) - 1 freq flaedom (4) - 1 freq gaeldom (5) - 1 freq feddoms (5) - 1 freq aidom (5) - 1 freq field- (5) - 1 freq fuddim (5) - 1 freq faddim (5) - 1 freq feddema (5) - 1 freq fief (5) - 1 freq aisedom (5) - 6 freq freedoms (5) - 13 freq fiends (5) - 2 freq fields (5) - 148 freq fethom (5) - 1 freq fiend (5) - 4 freq |
SoundEx code - F135 fifteen - 98 freq fifteenth - 17 freq fufteen - 5 freq five-tae-nine - 1 freq fiefdom - 1 freq fifedom - 1 freq fifteen-yir-auld - 1 freq fifteent - 3 freq 'fiftene - 2 freq fiftene - 1 freq fiftein - 1 freq fifteeen - 1 freq fifteen-year-auld - 2 freq |
MetaPhone code - FFTM fiefdom - 1 freq fifedom - 1 freq |
FIEFDOM |
| Time to execute Levenshtein function - 0.228875 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.395357 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.030705 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.051046 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.001015 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. |