| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| liable (0) - 4 freq viable (1) - 11 freq mable (2) - 2 freq lik'able (2) - 1 freq fable (2) - 8 freq libbie (2) - 1 freq arable (2) - 8 freq limbie (2) - 1 freq yable (2) - 7 freq yibble (2) - 3 freq nimble (2) - 1 freq lile (2) - 1 freq dibble (2) - 1 freq feable (2) - 1 freq liddle (2) - 1 freq bible (2) - 93 freq tibble (2) - 18 freq fixable (2) - 1 freq table (2) - 674 freq gibble (2) - 1 freq disable (2) - 1 freq gable (2) - 8 freq unable (2) - 19 freq ible (2) - 1 freq kibble (2) - 1 freq |
liable (0) - 4 freq viable (2) - 11 freq sable (3) - 2 freq cable (3) - 10 freq -able (3) - 1 freq unable (3) - 19 freq gable (3) - 8 freq label (3) - 56 freq ible (3) - 1 freq ladle (3) - 8 freq libre (3) - 1 freq enable (3) - 4 freq aible (3) - 2 freq able (3) - 430 freq table (3) - 674 freq likeable (3) - 2 freq reliable (3) - 5 freq amiable (3) - 1 freq libbie (3) - 1 freq fable (3) - 8 freq lile (3) - 1 freq arable (3) - 8 freq yibble (3) - 3 freq yable (3) - 7 freq feable (3) - 1 freq |
SoundEx code - L140 label - 56 freq lovely - 162 freq level - 146 freq lively - 10 freq law-plea - 2 freq lawfully - 3 freq lawful - 3 freq luvely - 9 freq luvelie - 3 freq luvlee - 2 freq laybil - 2 freq luvuly - 1 freq luvulee - 1 freq lapel - 3 freq livvel - 2 freq luv'ly - 1 freq liable - 4 freq 'lovely - 1 freq luvly - 5 freq laevil - 1 freq lavell - 2 freq leafully - 1 freq lovel - 1 freq lvl - 1 freq lovell - 1 freq loaf'll - 1 freq luffly - 3 freq luvvly - 1 freq llvl - 1 freq |
MetaPhone code - LBL label - 56 freq laybil - 2 freq liable - 4 freq |
LIABLE |
| Time to execute Levenshtein function - 0.198815 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.409964 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.029739 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.039084 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.000785 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. |