| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unionists (0) - 20 freq unionists' (1) - 1 freq unionist (1) - 35 freq unionised (2) - 1 freq unconiss (2) - 1 freq unionism (2) - 8 freq colonists (3) - 1 freq union's (3) - 1 freq unions (3) - 8 freq unhonest (3) - 1 freq unionig (3) - 1 freq arsonists (3) - 1 freq agonists (3) - 1 freq unions (3) - 1 freq unsonsie (4) - 1 freq urbanisms (4) - 1 freq ninians (4) - 3 freq unionlib (4) - 1 freq meinits (4) - 12 freq motorists (4) - 3 freq airtists (4) - 20 freq intonit (4) - 1 freq endoits (4) - 1 freq anatomists (4) - 1 freq enseeists (4) - 1 freq |
unionists (0) - 20 freq unionist (2) - 35 freq unionists' (2) - 1 freq unionism (4) - 8 freq agonists (4) - 1 freq unconiss (4) - 1 freq unionised (4) - 1 freq colonists (5) - 1 freq union's (5) - 1 freq insists (5) - 5 freq sneists (5) - 1 freq noosts (5) - 2 freq unions (5) - 1 freq unhonest (5) - 1 freq unions (5) - 8 freq enseeists (5) - 1 freq arsonists (5) - 1 freq minnits (6) - 1 freq vainist (6) - 1 freq nests (6) - 27 freq onions (6) - 17 freq unkist (6) - 2 freq onsets (6) - 2 freq brieists (6) - 1 freq pianist (6) - 1 freq |
SoundEx code - U552 unhinged - 3 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 - UNNSTS unionists - 20 freq unionists' - 1 freq |
UNIONISTS |
| Time to execute Levenshtein function - 0.213849 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.343736 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.026952 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.036817 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.000859 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. |