| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| library (0) - 167 freq libary (1) - 1 freq librars (1) - 3 freq leibrary (1) - 1 freq librar (1) - 8 freq libarry (2) - 1 freq libra (2) - 2 freq leebrary (2) - 4 freq literary (2) - 63 freq librarie (2) - 1 freq libran (2) - 1 freq lit'rary (2) - 1 freq leibrars (2) - 1 freq piracy (3) - 1 freq libraries (3) - 26 freq linear (3) - 3 freq libert (3) - 1 freq liprosy (3) - 2 freq hilary (3) - 2 freq hillary (3) - 1 freq librarian (3) - 10 freq birry (3) - 2 freq libre (3) - 1 freq literar (3) - 3 freq lubbard (3) - 2 freq |
library (0) - 167 freq librar (1) - 8 freq leibrary (1) - 1 freq librarie (2) - 1 freq leebrary (2) - 4 freq libarry (2) - 1 freq libary (2) - 1 freq librars (2) - 3 freq laborare (3) - 2 freq leibrars (3) - 1 freq leebrar (3) - 1 freq literary (3) - 63 freq libran (3) - 1 freq leibrarie (3) - 4 freq libra (3) - 2 freq february (4) - 41 freq liberate (4) - 3 freq liberty (4) - 31 freq libree (4) - 4 freq laebrir (4) - 1 freq libr (4) - 1 freq lorry (4) - 14 freq leiterary (4) - 3 freq larry (4) - 105 freq liberal (4) - 26 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 - LBRR library - 167 freq leibrarie - 4 freq leibrary - 1 freq labourer - 7 freq leebrary - 4 freq librar - 8 freq laborare - 2 freq labourer- - 1 freq leebrar - 1 freq laebrir - 1 freq librarie - 1 freq |
LIBRARY |
| Time to execute Levenshtein function - 0.258706 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.576721 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.027463 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.068454 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.000850 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. |