| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unionism (0) - 8 freq unionist (1) - 35 freq union's (2) - 1 freq unconiss (2) - 1 freq unionists (2) - 20 freq unionised (2) - 1 freq unions (2) - 8 freq unionig (2) - 1 freq union' (3) - 1 freq unionists' (3) - 1 freq unions (3) - 1 freq onions (3) - 17 freq inions (3) - 1 freq unionlib (3) - 1 freq unionisers (3) - 1 freq unhonest (3) - 1 freq hedonism (3) - 1 freq union (3) - 192 freq bunions (3) - 2 freq unis (4) - 2 freq urbanisms (4) - 1 freq bisniss (4) - 4 freq feminism (4) - 3 freq sikhism (4) - 2 freq minis (4) - 1 freq |
unionism (0) - 8 freq unionist (2) - 35 freq unionised (3) - 1 freq unions (3) - 8 freq inions (4) - 1 freq onions (4) - 17 freq unionig (4) - 1 freq union's (4) - 1 freq unionists (4) - 20 freq unconiss (4) - 1 freq bunions (5) - 2 freq union (5) - 192 freq nondum (5) - 1 freq nines (5) - 12 freq hedonism (5) - 1 freq noons (5) - 1 freq unionisers (5) - 1 freq unionlib (5) - 1 freq union' (5) - 1 freq unhonest (5) - 1 freq ations (6) - 1 freq innimy (6) - 1 freq finnish (6) - 11 freq noisy (6) - 13 freq uranium (6) - 2 freq |
SoundEx code - U552 unhinged - 3 freq unionisers - 1 freq unionist - 35 freq unionists - 20 freq unionism - 8 freq unionig - 1 freq unionists' - 1 freq unimagineable - 1 freq unions - 8 freq unimagined - 1 freq unanswerability - 1 freq unanswered - 3 freq unmankit - 1 freq unanswert - 1 freq unimaginable - 1 freq unhonest - 1 freq un-inglis - 1 freq unmanaged - 1 freq union's - 1 freq unionist-designed - 1 freq unionscenes - 2 freq unions - 1 freq unionised - 1 freq uninspiring - 1 freq |
MetaPhone code - UNNSM unionism - 8 freq |
UNIONISM |
| Time to execute Levenshtein function - 0.181981 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.373749 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.027880 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.037132 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.000899 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. |