| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| librars (0) - 3 freq library (1) - 167 freq librar (1) - 8 freq leibrars (1) - 1 freq libary (2) - 1 freq librarie (2) - 1 freq libra (2) - 2 freq libraries (2) - 26 freq leibrary (2) - 1 freq libran (2) - 1 freq liberals (2) - 5 freq liars (2) - 1 freq libbards (2) - 1 freq vibrant (3) - 16 freq literary (3) - 63 freq liberators (3) - 1 freq gibran (3) - 1 freq liberate (3) - 3 freq librarian (3) - 10 freq liar (3) - 24 freq obrans (3) - 1 freq mirrors (3) - 24 freq leebrary (3) - 4 freq airrs (3) - 2 freq libyan (3) - 1 freq |
librars (0) - 3 freq leibrars (1) - 1 freq librar (2) - 8 freq libraries (2) - 26 freq library (2) - 167 freq liberals (3) - 5 freq leibrary (3) - 1 freq librarie (3) - 1 freq leibraries (3) - 1 freq briars (4) - 1 freq leebrary (4) - 4 freq libarry (4) - 1 freq laborare (4) - 2 freq leibrarie (4) - 4 freq librarian (4) - 10 freq ealibraries (4) - 6 freq brurs (4) - 1 freq leebrar (4) - 1 freq labours (4) - 5 freq liars (4) - 1 freq libran (4) - 1 freq libra (4) - 2 freq libary (4) - 1 freq liberators (4) - 1 freq libbards (4) - 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 - LBRRS labourers - 4 freq libraries - 26 freq leibrars - 1 freq leibraries - 1 freq lawbourers - 3 freq librars - 3 freq |
LIBRARS |
| Time to execute Levenshtein function - 0.199070 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.331342 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.027104 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.037101 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.000925 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. |