Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
taigilment (0) - 1 freq raivelment (3) - 3 freq taigilt (3) - 2 freq ailment (3) - 2 freq taiglet (3) - 1 freq argiment (3) - 2 freq airgiment (3) - 1 freq argiement (3) - 25 freq airgiement (3) - 2 freq bainishment (4) - 1 freq airgyment (4) - 6 freq argiements (4) - 11 freq argument (4) - 80 freq pairlament (4) - 180 freq tailend (4) - 1 freq airgiements (4) - 1 freq taigle (4) - 10 freq tanglet (4) - 1 freq iniment (4) - 1 freq devilment (4) - 3 freq taigilsum (4) - 1 freq pairchment (4) - 4 freq taigelt (4) - 12 freq derailment (4) - 2 freq taiglin (4) - 3 freq |
taigilment (0) - 1 freq airgiment (5) - 1 freq argiement (5) - 25 freq argiment (5) - 2 freq airgiement (5) - 2 freq taiglet (5) - 1 freq raivelment (5) - 3 freq taigilt (5) - 2 freq ailment (5) - 2 freq airgument (6) - 6 freq augment (6) - 2 freq pairliament (6) - 68 freq divilmint (6) - 2 freq vigilant (6) - 3 freq regiment (6) - 21 freq taiglit (6) - 2 freq twalmont (6) - 1 freq ailmint (6) - 1 freq argyment (6) - 2 freq parliament (6) - 77 freq talent (6) - 65 freq taiglt (6) - 2 freq paliament (6) - 1 freq habiliment (6) - 1 freq alignment (6) - 2 freq |
SoundEx code - T245 taiglin - 3 freq tag-alongs - 1 freq ticklin - 6 freq tacklin - 4 freq tecklin - 1 freq teuch-limbed - 1 freq taigilment - 1 freq touchline - 14 freq taklimakan - 7 freq taislin - 3 freq tagline - 2 freq tackling - 2 freq thesalon - 1 freq tsqlnpxprc - 1 freq theislandreview - 3 freq thesilent - 1 freq tsalne - 1 freq |
MetaPhone code - TJLMNT taigilment - 1 freq |
TAIGILMENT |
Time to execute Levenshtein function - 0.190503 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.373745 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.050691 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.040037 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.037034 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. |