| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| liberal (0) - 26 freq liberals (1) - 5 freq literal (1) - 7 freq illiberal (2) - 1 freq liberally (2) - 1 freq librar (2) - 8 freq libert (2) - 1 freq lateral (2) - 3 freq liberate (2) - 3 freq gineral (2) - 3 freq liberty (2) - 31 freq leeberal (2) - 3 freq mineral (2) - 8 freq libra (2) - 2 freq literar (2) - 3 freq libran (2) - 1 freq leiberat (2) - 1 freq general (3) - 200 freq livers (3) - 1 freq liver's (3) - 2 freq mieras (3) - 5 freq librars (3) - 3 freq liberatin (3) - 1 freq tiber (3) - 1 freq livery (3) - 13 freq |
liberal (0) - 26 freq liberals (2) - 5 freq literal (2) - 7 freq leeberal (2) - 3 freq liberty (3) - 31 freq libra (3) - 2 freq libran (3) - 1 freq leiberat (3) - 1 freq liberate (3) - 3 freq liberally (3) - 1 freq lateral (3) - 3 freq librar (3) - 8 freq libert (3) - 1 freq illiberal (3) - 1 freq libree (4) - 4 freq libr (4) - 1 freq libre (4) - 1 freq library (4) - 167 freq libarry (4) - 1 freq libertie (4) - 3 freq leetral (4) - 1 freq label (4) - 56 freq libary (4) - 1 freq beryl (4) - 2 freq neoliberal (4) - 4 freq |
SoundEx code - L164 leebrality - 1 freq liberal - 26 freq liberally - 1 freq leeberal - 3 freq labour-liberal - 1 freq leibral-lik - 1 freq laberleithen - 1 freq liberland - 2 freq liberals - 5 freq labour-led - 1 freq laverell - 1 freq luverly - 4 freq labourleft - 1 freq |
MetaPhone code - LBRL liberal - 26 freq liberally - 1 freq leeberal - 3 freq |
LIBERAL |
| Time to execute Levenshtein function - 0.178742 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.347819 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.027597 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.037816 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.000823 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. |