Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
neoliberal (0) - 4 freq neoliberalism (3) - 1 freq illiberal (3) - 1 freq liberal (3) - 26 freq neteral (4) - 1 freq nellie'll (4) - 1 freq leiberat (4) - 1 freq literal (4) - 7 freq leeberal (4) - 3 freq deliveran (4) - 2 freq naiteral (4) - 6 freq deliberate (4) - 19 freq liberals (4) - 5 freq neipers (5) - 2 freq nellie- (5) - 1 freq neibor (5) - 3 freq neeber (5) - 2 freq joolsbell (5) - 1 freq deliverer (5) - 7 freq liberty (5) - 31 freq neilgray (5) - 1 freq politiecal (5) - 5 freq delivers (5) - 2 freq seeveral (5) - 1 freq neiver (5) - 1 freq |
neoliberal (0) - 4 freq illiberal (4) - 1 freq liberal (4) - 26 freq leeberal (5) - 3 freq neoliberalism (5) - 1 freq naiteral (6) - 6 freq liberals (6) - 5 freq unilateral (6) - 1 freq deliberate (6) - 19 freq neteral (6) - 1 freq leiberat (6) - 1 freq literal (6) - 7 freq liberally (7) - 1 freq liberate (7) - 3 freq numeral (7) - 5 freq libra (7) - 2 freq neiborin (7) - 1 freq libert (7) - 1 freq lateral (7) - 3 freq deleiberate (7) - 3 freq naitral (7) - 35 freq neutral (7) - 17 freq cerebral (7) - 1 freq deliberately (7) - 22 freq falderal (7) - 1 freq |
SoundEx code - N416 neoliberal - 4 freq neoliberalism - 1 freq €˜neo-laboural - 1 freq nlferries - 3 freq |
MetaPhone code - NLBRL neoliberal - 4 freq €˜neo-laboural - 1 freq |
NEOLIBERAL |
Time to execute Levenshtein function - 0.340208 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.609941 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.027801 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.059799 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.000795 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. |