| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adopt (0) - 11 freq adept (1) - 2 freq adopts (1) - 1 freq adapt (1) - 6 freq aloat (2) - 8 freq doft (2) - 1 freq alot (2) - 18 freq about (2) - 686 freq idot (2) - 1 freq doot (2) - 573 freq dope (2) - 11 freq adobe (2) - 2 freq dort (2) - 2 freq appt (2) - 1 freq aboit (2) - 1 freq aboat (2) - 2 freq aboot (2) - 10010 freq atop (2) - 6 freq dowt (2) - 6 freq adoptet (2) - 1 freq dont (2) - 76 freq doit (2) - 3 freq addet (2) - 25 freq ajolt (2) - 1 freq adornt (2) - 1 freq |
adopt (0) - 11 freq adapt (1) - 6 freq adept (1) - 2 freq dopyt (2) - 1 freq dept (2) - 7 freq adopts (2) - 1 freq dout (3) - 167 freq doat (3) - 1 freq dost (3) - 39 freq admit (3) - 100 freq adroit (3) - 2 freq apt (3) - 45 freq dop (3) - 1 freq doyt (3) - 1 freq dot (3) - 47 freq adoptit (3) - 14 freq adoppit (3) - 1 freq hopt (3) - 1 freq adopted (3) - 13 freq doupit (3) - 1 freq depot (3) - 1 freq apoot (3) - 1 freq adult (3) - 64 freq adoptin (3) - 5 freq adoptid (3) - 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 - ATPT adopt - 11 freq adapt - 6 freq adoppit - 1 freq adept - 2 freq |
ADOPT |
| Time to execute Levenshtein function - 0.184267 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.380758 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.028169 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.039956 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.000920 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. |