| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| liberals (0) - 5 freq liberal (1) - 26 freq librars (2) - 3 freq minerals (2) - 4 freq liberally (2) - 1 freq liberate (2) - 3 freq literal (2) - 7 freq numerals (3) - 4 freq libra (3) - 2 freq library (3) - 174 freq literati (3) - 3 freq libertie (3) - 3 freq literary (3) - 63 freq liberated (3) - 3 freq literar (3) - 3 freq liners (3) - 2 freq mineral (3) - 8 freq gomerals (3) - 1 freq liberland (3) - 2 freq libertees (3) - 1 freq liberty (3) - 32 freq mieras (3) - 5 freq liberatin (3) - 2 freq literacy (3) - 34 freq funerals (3) - 14 freq |
liberals (0) - 5 freq liberal (2) - 26 freq liberally (3) - 1 freq librars (3) - 3 freq leeberal (4) - 3 freq libertees (4) - 1 freq almerals (4) - 1 freq leibrars (4) - 1 freq labels (4) - 6 freq literal (4) - 7 freq minerals (4) - 4 freq liberate (4) - 3 freq liberties (4) - 7 freq liveries (5) - 1 freq lateral (5) - 3 freq liver's (5) - 2 freq generals (5) - 2 freq liberace's (5) - 2 freq nibals (5) - 1 freq tiberius (5) - 1 freq leiberat (5) - 1 freq barls (5) - 1 freq burls (5) - 5 freq laurels (5) - 2 freq birls (5) - 31 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 - LBRLS liberals - 5 freq |
LIBERALS |
| Time to execute Levenshtein function - 0.192135 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.331452 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.027350 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.038161 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.000909 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. |