| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adoptid (0) - 1 freq adopted (1) - 13 freq adoptit (1) - 14 freq adoptin (1) - 5 freq adaptit (2) - 6 freq adoptive (2) - 1 freq adoption (2) - 16 freq adaptin (2) - 1 freq adapted (2) - 2 freq adopts (2) - 1 freq adoptin' (2) - 2 freq adoptet (2) - 1 freq adoppit (2) - 1 freq adopt (2) - 11 freq adorin (3) - 1 freq frostid (3) - 1 freq doped (3) - 2 freq dottin (3) - 1 freq dotin (3) - 2 freq avoid (3) - 57 freq aolthd (3) - 1 freq adorned (3) - 2 freq dobbid (3) - 1 freq dotie (3) - 1 freq dootin (3) - 5 freq |
adoptid (0) - 1 freq adopted (1) - 13 freq adapted (2) - 2 freq adoptin (2) - 5 freq adoptit (2) - 14 freq adopts (3) - 1 freq adoptet (3) - 1 freq adopt (3) - 11 freq adaptin (3) - 1 freq adaptit (3) - 6 freq adoption (3) - 16 freq adoptive (3) - 1 freq adapt (4) - 6 freq adeptly (4) - 2 freq adaption (4) - 1 freq opted (4) - 5 freq doted (4) - 1 freq dotted (4) - 11 freq dooted (4) - 4 freq doited (4) - 2 freq doated (4) - 1 freq adept (4) - 2 freq douted (4) - 1 freq adoptin' (4) - 2 freq doped (4) - 2 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 |
ADOPTID |
| Time to execute Levenshtein function - 0.256273 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.413481 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.029214 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.040032 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.001298 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. |