Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
librar (0) - 8 freq librars (1) - 3 freq libran (1) - 1 freq libra (1) - 2 freq library (1) - 174 freq libyan (2) - 1 freq leibrars (2) - 1 freq leebrar (2) - 1 freq gibran (2) - 1 freq limpar (2) - 1 freq librarie (2) - 1 freq liar (2) - 24 freq libre (2) - 1 freq libary (2) - 1 freq leibrary (2) - 1 freq liberal (2) - 26 freq libr (2) - 1 freq literar (2) - 3 freq limnar (2) - 1 freq libree (2) - 4 freq linear (2) - 3 freq lycra (3) - 2 freq inbrak (3) - 2 freq 'bear (3) - 1 freq boar (3) - 20 freq |
librar (0) - 8 freq library (1) - 174 freq leebrar (2) - 1 freq librarie (2) - 1 freq leibrary (2) - 1 freq librars (2) - 3 freq libran (2) - 1 freq libra (2) - 2 freq libr (3) - 1 freq literar (3) - 3 freq liberal (3) - 26 freq laebrir (3) - 1 freq leebrary (3) - 4 freq laborare (3) - 2 freq libree (3) - 4 freq libary (3) - 1 freq leibrars (3) - 1 freq leibrarie (3) - 4 freq libarry (3) - 1 freq libre (3) - 1 freq libraries (4) - 27 freq laebrak (4) - 1 freq bruar (4) - 5 freq brer (4) - 2 freq librarian (4) - 11 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 - LBRR library - 174 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 |
LIBRAR |
Time to execute Levenshtein function - 0.333205 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.902489 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.087256 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.100231 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.001079 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. |