Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
adaptit (0) - 6 freq adoptit (1) - 14 freq adaptin (1) - 1 freq adoppit (2) - 1 freq dartit (2) - 2 freq adoptet (2) - 1 freq adapt (2) - 6 freq adapted (2) - 2 freq dautit (2) - 1 freq daetit (2) - 1 freq datit (2) - 6 freq awaitit (2) - 3 freq dappit (2) - 1 freq adoptin (2) - 5 freq adaption (2) - 1 freq adoptid (2) - 1 freq haantit (3) - 1 freq inactit (3) - 4 freq dashit (3) - 2 freq satit (3) - 1 freq plantit (3) - 36 freq dytit (3) - 2 freq skartit (3) - 8 freq pactit (3) - 3 freq dampit (3) - 1 freq |
adaptit (0) - 6 freq adoptit (1) - 14 freq adoptet (2) - 1 freq adaptin (2) - 1 freq dappit (3) - 1 freq datit (3) - 6 freq adoptid (3) - 1 freq daetit (3) - 1 freq adaption (3) - 1 freq adoptin (3) - 5 freq dautit (3) - 1 freq adoppit (3) - 1 freq adapt (3) - 6 freq dartit (3) - 2 freq adapted (3) - 2 freq dintit (4) - 3 freq adoption (4) - 16 freq doutit (4) - 4 freq dottit (4) - 11 freq dittit (4) - 1 freq adept (4) - 2 freq optit (4) - 1 freq ditit (4) - 1 freq dystit (4) - 1 freq dairtit (4) - 1 freq |
SoundEx code - A313 adoption - 16 freq adapted - 2 freq adoptit - 14 freq adopt - 11 freq adopted - 13 freq adaptabeility - 1 freq adoptin - 5 freq adapt - 6 freq adoptet - 1 freq adaption - 1 freq adoptin' - 2 freq adaptit - 6 freq adaptin - 1 freq adoptive - 1 freq adoppit - 1 freq adaptation - 4 freq adoptions - 2 freq adaptable - 1 freq adeptly - 2 freq adept - 2 freq adoptid - 1 freq adaptabilitee - 1 freq adoptagreyhound - 1 freq adaptivecoach - 1 freq adopts - 1 freq |
MetaPhone code - ATPTT adapted - 2 freq adoptit - 14 freq adopted - 13 freq adoptet - 1 freq adaptit - 6 freq adoptid - 1 freq |
ADAPTIT |
Time to execute Levenshtein function - 0.179344 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.340334 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.027556 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.037428 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.000876 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. |