Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ealibraries (0) - 6 freq salibraries (1) - 1 freq libraries (2) - 26 freq librarie (3) - 1 freq cpklibraries (3) - 3 freq leibraries (3) - 1 freq eairriet (4) - 1 freq leibrarie (4) - 4 freq salaries (4) - 3 freq librarian (4) - 10 freq cairries (4) - 36 freq calvaries (4) - 1 freq mairries (4) - 8 freq librars (4) - 3 freq vagaries (5) - 1 freq ellerberries (5) - 1 freq airdrie (5) - 9 freq realities (5) - 9 freq cairried (5) - 143 freq delicacies (5) - 2 freq easterlies (5) - 1 freq dairies (5) - 3 freq library (5) - 167 freq alreadies (5) - 1 freq airteries (5) - 1 freq |
ealibraries (0) - 6 freq libraries (2) - 26 freq salibraries (2) - 1 freq leibraries (3) - 1 freq librars (4) - 3 freq librarie (4) - 1 freq librarian (5) - 10 freq leibrars (5) - 1 freq leibrarie (5) - 4 freq liberties (6) - 7 freq larries (6) - 8 freq librar (6) - 8 freq library (6) - 167 freq lorries (6) - 5 freq mairries (6) - 8 freq elaborates (6) - 1 freq lauborris (6) - 1 freq barries (6) - 1 freq cpklibraries (6) - 3 freq cairries (6) - 36 freq luminaries (7) - 2 freq obeituaries (7) - 1 freq alibis (7) - 2 freq bairdies (7) - 1 freq libbards (7) - 1 freq |
SoundEx code - E416 elaborate - 7 freq eelebrate - 1 freq elaboration - 4 freq elvire - 4 freq elvire's - 1 freq elaborates - 1 freq elframoagain - 1 freq ealibraries - 6 freq |
MetaPhone code - ELBRRS ealibraries - 6 freq |
EALIBRARIES |
Time to execute Levenshtein function - 0.231860 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.468951 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.028210 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.037912 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.000813 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. |