Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
actit (0) - 9 freq ectit (1) - 1 freq actis (1) - 1 freq antit (1) - 1 freq actin (1) - 58 freq pactit (1) - 3 freq ackit (1) - 1 freq att (2) - 451 freq agait (2) - 1 freq satit (2) - 1 freq mantit (2) - 2 freq acair (2) - 1 freq ait (2) - 138 freq reactit (2) - 2 freq rackit (2) - 7 freq cait (2) - 2 freq santit (2) - 2 freq arctic (2) - 21 freq acts (2) - 43 freq maetit (2) - 1 freq cit (2) - 4 freq sattit (2) - 1 freq akkit (2) - 1 freq hantit (2) - 3 freq abit (2) - 1 freq |
actit (0) - 9 freq ectit (1) - 1 freq ackit (2) - 1 freq pactit (2) - 3 freq citit (2) - 2 freq actin (2) - 58 freq actis (2) - 1 freq antit (2) - 1 freq enactit (3) - 3 freq 'tit (3) - 1 freq act' (3) - 2 freq sautit (3) - 2 freq cott (3) - 4 freq saatit (3) - 1 freq inactit (3) - 4 freq coatit (3) - 5 freq ditit (3) - 1 freq cutt (3) - 3 freq waitit (3) - 79 freq mutit (3) - 1 freq cantit (3) - 1 freq act (3) - 240 freq facetit (3) - 1 freq optit (3) - 1 freq fautit (3) - 3 freq |
SoundEx code - A233 actit - 9 freq agitated - 6 freq assiduity - 1 freq astute - 1 freq agitatin' - 1 freq acted - 9 freq aesthetic - 4 freq agitators - 1 freq agitation - 5 freq agitatin - 2 freq astutehess - 1 freq 'astute - 1 freq ae-sided - 2 freq agitatit - 2 freq assautit - 1 freq ae-siditness - 1 freq agitaitit - 1 freq azitoadcff - 1 freq |
MetaPhone code - AKTT actit - 9 freq acted - 9 freq agtd - 1 freq |
ACTIT |
Time to execute Levenshtein function - 0.198144 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.396190 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.027925 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.038333 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.000928 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. |