| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adoptit (0) - 14 freq adoptid (1) - 1 freq adoptin (1) - 5 freq adoppit (1) - 1 freq adaptit (1) - 6 freq adoptet (1) - 1 freq doutit (2) - 4 freq abortit (2) - 2 freq dotit (2) - 1 freq adopts (2) - 1 freq adoptive (2) - 1 freq adaptin (2) - 1 freq adopt (2) - 11 freq adoptin' (2) - 2 freq dootit (2) - 2 freq adoption (2) - 16 freq adopted (2) - 13 freq doitit (2) - 13 freq optit (2) - 1 freq dottit (2) - 11 freq adoptions (3) - 2 freq hootit (3) - 2 freq proppit (3) - 3 freq addit (3) - 97 freq anyntit (3) - 1 freq |
adoptit (0) - 14 freq adaptit (1) - 6 freq adoptet (1) - 1 freq adoppit (2) - 1 freq adoptid (2) - 1 freq adoptin (2) - 5 freq adopted (3) - 13 freq adoption (3) - 16 freq doitit (3) - 13 freq optit (3) - 1 freq dottit (3) - 11 freq adopt (3) - 11 freq dootit (3) - 2 freq dotit (3) - 1 freq doutit (3) - 4 freq adoptive (3) - 1 freq adopts (3) - 1 freq adaptin (3) - 1 freq adapt (4) - 6 freq dippit (4) - 12 freq dentit (4) - 3 freq adaption (4) - 1 freq dartit (4) - 2 freq dystit (4) - 1 freq emptit (4) - 1 freq |
SoundEx code - A313 adoption - 16 freq adapted - 2 freq adoptit - 14 freq adopt - 11 freq adopted - 13 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 |
ADOPTIT |
| Time to execute Levenshtein function - 0.188535 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.332242 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.028373 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.037271 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.001040 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. |