| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adopted (0) - 13 freq adapted (1) - 2 freq adoptid (1) - 1 freq adoptet (1) - 1 freq adoptit (2) - 14 freq adopt (2) - 11 freq doated (2) - 1 freq adopts (2) - 1 freq doited (2) - 2 freq adored (2) - 5 freq adorned (2) - 2 freq doped (2) - 2 freq doted (2) - 1 freq aborted (2) - 1 freq dooted (2) - 4 freq dotted (2) - 11 freq opted (2) - 5 freq douted (2) - 1 freq adoptin (2) - 5 freq outed (3) - 2 freq stotted (3) - 8 freq stoated (3) - 3 freq hoped (3) - 42 freq hosted (3) - 3 freq shouted (3) - 250 freq |
adopted (0) - 13 freq adoptid (1) - 1 freq adapted (1) - 2 freq adoptet (2) - 1 freq dooted (3) - 4 freq dotted (3) - 11 freq doted (3) - 1 freq douted (3) - 1 freq doped (3) - 2 freq opted (3) - 5 freq adoptin (3) - 5 freq doated (3) - 1 freq adopt (3) - 11 freq adopts (3) - 1 freq adoptit (3) - 14 freq doited (3) - 2 freq dusted (4) - 6 freq adapt (4) - 6 freq adoptive (4) - 1 freq doatted (4) - 1 freq spooted (4) - 1 freq adaptit (4) - 6 freq disted (4) - 1 freq edited (4) - 6 freq darted (4) - 5 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 |
ADOPTED |
| Time to execute Levenshtein function - 0.332073 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.563260 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.030135 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.070880 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.000999 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. |