| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| librarian (0) - 11 freq libraries (2) - 27 freq librarie (2) - 1 freq leibrarie (3) - 4 freq liberatin (3) - 2 freq librar (3) - 8 freq liberation (3) - 3 freq libran (3) - 1 freq siberian (3) - 3 freq librars (3) - 3 freq leibraries (3) - 1 freq vibration (3) - 4 freq library (3) - 174 freq vibratin (3) - 2 freq tiberias (4) - 1 freq barin (4) - 4 freq libarry (4) - 1 freq literarie (4) - 1 freq lingerin (4) - 12 freq listeria (4) - 1 freq birrin (4) - 4 freq labourin (4) - 3 freq bulgarian (4) - 1 freq salibraries (4) - 1 freq tirrin (4) - 3 freq |
librarian (0) - 11 freq libraries (3) - 27 freq librarie (3) - 1 freq librars (4) - 3 freq library (4) - 174 freq leibraries (4) - 1 freq libran (4) - 1 freq leibrarie (4) - 4 freq librar (4) - 8 freq liberatin (4) - 2 freq liberation (4) - 3 freq birrin (5) - 4 freq leibrary (5) - 1 freq labourin (5) - 3 freq lorrain (5) - 1 freq leibrars (5) - 1 freq burrian (5) - 1 freq vibratin (5) - 2 freq vibration (5) - 4 freq libarry (5) - 1 freq ealibraries (5) - 6 freq siberian (5) - 3 freq brian (6) - 581 freq scurrian (6) - 1 freq bearin (6) - 28 freq |
SoundEx code - L166 library - 174 freq leibrarie - 4 freq leibrary - 1 freq labourers - 4 freq labourer - 7 freq libraries - 27 freq librarian - 11 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 - 11 freq |
LIBRARIAN |
| Time to execute Levenshtein function - 0.183369 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.357205 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.027947 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.037932 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.001067 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. |