Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
legislating (0) - 1 freq legislations (2) - 1 freq legislative (2) - 10 freq legislation (2) - 38 freq legislature (3) - 1 freq legislators (3) - 3 freq legislator (3) - 1 freq legislate (3) - 3 freq legislatioun (3) - 2 freq isolating (4) - 1 freq relating (4) - 1 freq leafleting (4) - 1 freq devastating (4) - 2 freq slating (4) - 1 freq emulating (4) - 1 freq devistatin (4) - 1 freq listing (4) - 4 freq delineating (4) - 1 freq lilting (4) - 1 freq selfisolating (4) - 1 freq translating (4) - 1 freq legislatures (4) - 1 freq existing (4) - 1 freq seed-eating (5) - 1 freq debilitating (5) - 1 freq |
legislating (0) - 1 freq legislations (3) - 1 freq legislation (3) - 38 freq legislatioun (4) - 2 freq legislative (4) - 10 freq legislature (5) - 1 freq legislate (5) - 3 freq legislators (5) - 3 freq legislator (5) - 1 freq selfisolating (6) - 1 freq listing (6) - 4 freq slating (6) - 1 freq legislatures (6) - 1 freq lilting (6) - 1 freq isolating (6) - 1 freq leafleting (6) - 1 freq existing (7) - 1 freq gosling (7) - 1 freq lighting (7) - 2 freq lusting (7) - 1 freq lasting (7) - 3 freq translating (7) - 1 freq emulating (7) - 1 freq devastating (7) - 2 freq relating (7) - 1 freq |
SoundEx code - L224 logical - 11 freq lexical - 25 freq logically - 2 freq legislation - 38 freq loughgiel - 1 freq legislative - 10 freq lochgelly - 18 freq legislatioun - 2 freq legislator - 1 freq legislators - 3 freq legislations - 1 freq lusciously - 1 freq lochgilphead - 2 freq legislate - 3 freq legislatures - 1 freq legislature - 1 freq louiseglen - 2 freq lisajewelluk - 1 freq legislating - 1 freq likegold - 1 freq lokiskywalker - 7 freq |
MetaPhone code - LJSLTNK legislating - 1 freq |
LEGISLATING |
Time to execute Levenshtein function - 0.320204 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.535508 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.031591 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.050131 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.001166 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. |