| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leeberal (0) - 3 freq leeteral (1) - 2 freq leiberat (2) - 1 freq leebrar (2) - 1 freq leeberty (2) - 4 freq leetral (2) - 1 freq seeveral (2) - 1 freq liberal (2) - 26 freq leeterar (2) - 14 freq neebra (3) - 3 freq leeterally (3) - 2 freq federal (3) - 5 freq liberals (3) - 5 freq leeterary (3) - 19 freq leeterati (3) - 1 freq neteral (3) - 1 freq cerebral (3) - 1 freq aldeberan (3) - 1 freq leeberatin (3) - 1 freq general (3) - 200 freq leebrary (3) - 4 freq literal (3) - 7 freq laebrak (3) - 1 freq neeber (3) - 2 freq lee-er (3) - 1 freq |
leeberal (0) - 3 freq leeteral (2) - 2 freq liberal (2) - 26 freq leeberty (3) - 4 freq leetral (3) - 1 freq leebrar (3) - 1 freq leiberat (3) - 1 freq liberals (4) - 5 freq leebrary (4) - 4 freq illiberal (4) - 1 freq leeterar (4) - 14 freq seeveral (4) - 1 freq literal (4) - 7 freq lateral (4) - 3 freq laebrak (4) - 1 freq leebrality (5) - 1 freq lebor (5) - 1 freq liberally (5) - 1 freq leesurely (5) - 1 freq laabered (5) - 1 freq neoliberal (5) - 4 freq beryl (5) - 2 freq leibertie (5) - 1 freq libra (5) - 2 freq liberty (5) - 32 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 |
LEEBERAL |
| Time to execute Levenshtein function - 0.346607 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.437580 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.034827 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.049739 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.001498 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. |