| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| librarianship (0) - 1 freq librarian (4) - 10 freq libraries (5) - 26 freq chairmanship (6) - 1 freq leibraries (6) - 1 freq workminship (6) - 1 freq relationship (6) - 45 freq freinship (6) - 4 freq workmanship (6) - 3 freq vibrations (6) - 4 freq custodianship (6) - 1 freq brainchis (6) - 2 freq 'relationship (6) - 1 freq frienship (6) - 6 freq horsemanship (6) - 1 freq guairdianship (6) - 1 freq librars (6) - 3 freq sportmanship (6) - 2 freq lairdship (6) - 4 freq seamanship (6) - 1 freq librarie (6) - 1 freq barisic (7) - 3 freq stramashin (7) - 1 freq championship (7) - 12 freq lanskip (7) - 1 freq |
librarianship (0) - 1 freq librarian (7) - 10 freq libraries (8) - 26 freq frienship (9) - 6 freq guairdianship (9) - 1 freq freinship (9) - 4 freq lairdship (9) - 4 freq librars (9) - 3 freq leibraries (9) - 1 freq chairmanship (9) - 1 freq freenship (10) - 14 freq braunishin (10) - 1 freq labyrinth (10) - 22 freq lordship (10) - 1 freq leadership (10) - 21 freq labyrinths (10) - 1 freq labyrinthine (10) - 1 freq ealibraries (10) - 6 freq workmanship (10) - 3 freq librarie (10) - 1 freq 'relationship (10) - 1 freq relationship (10) - 45 freq brainchis (10) - 2 freq custodianship (10) - 1 freq vibrations (10) - 4 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 - LBRRNXP librarianship - 1 freq |
LIBRARIANSHIP |
| Time to execute Levenshtein function - 0.340582 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.543037 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.027491 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.046038 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.000861 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. |