| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| librarian (0) - 10 freq librarie (2) - 1 freq libraries (2) - 26 freq librars (3) - 3 freq leibraries (3) - 1 freq vibratin (3) - 1 freq liberation (3) - 3 freq leibrarie (3) - 4 freq vibration (3) - 4 freq librar (3) - 8 freq siberian (3) - 3 freq library (3) - 167 freq liberatin (3) - 1 freq libran (3) - 1 freq lingerin (4) - 12 freq burrian (4) - 1 freq ealibraries (4) - 6 freq salibraries (4) - 1 freq lizbain (4) - 1 freq brain (4) - 151 freq vibrations (4) - 4 freq horatian (4) - 1 freq 'brian (4) - 1 freq 'arabian (4) - 1 freq invariant (4) - 8 freq |
librarian (0) - 10 freq librarie (3) - 1 freq libraries (3) - 26 freq librar (4) - 8 freq library (4) - 167 freq leibrarie (4) - 4 freq liberatin (4) - 1 freq libran (4) - 1 freq librars (4) - 3 freq liberation (4) - 3 freq leibraries (4) - 1 freq vibration (5) - 4 freq birrin (5) - 4 freq libarry (5) - 1 freq leibrary (5) - 1 freq ealibraries (5) - 6 freq burrian (5) - 1 freq siberian (5) - 3 freq vibratin (5) - 1 freq leibrars (5) - 1 freq labourin (5) - 3 freq lorrain (5) - 1 freq 'barman (6) - 1 freq learin (6) - 8 freq gibran (6) - 1 freq |
SoundEx code - L166 library - 167 freq leibrarie - 4 freq leibrary - 1 freq labourers - 4 freq labourer - 7 freq librarian - 10 freq libraries - 26 freq leebrary - 4 freq librar - 8 freq leibrars - 1 freq laborare - 2 freq leibraries - 1 freq lawbourers - 3 freq librars - 3 freq labourer- - 1 freq leebrar - 1 freq laebrir - 1 freq librarie - 1 freq librarianship - 1 freq |
MetaPhone code - LBRRN librarian - 10 freq |
LIBRARIAN |
| Time to execute Levenshtein function - 0.202097 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.517194 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.027444 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.073964 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.000798 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. |