| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adaptabeility (0) - 1 freq adaptabilitee (3) - 1 freq availability (4) - 5 freq stabeility (4) - 1 freq acceptability (4) - 1 freq variabeility (4) - 1 freq capability (4) - 1 freq affabeility (4) - 1 freq instabeelity (5) - 1 freq stability (5) - 3 freq disabeelity (5) - 1 freq aplicability (5) - 1 freq acceptabilty (5) - 1 freq abeility (5) - 4 freq adaptable (5) - 1 freq notability (5) - 1 freq readability (5) - 1 freq disability (5) - 5 freq hability (6) - 2 freq adappable (6) - 1 freq capteevity (6) - 1 freq feasibility (6) - 6 freq faceility (6) - 1 freq adaptation (6) - 4 freq accoontability (6) - 4 freq |
adaptabeility (0) - 1 freq adaptabilitee (3) - 1 freq capability (6) - 1 freq adaptable (6) - 1 freq acceptability (6) - 1 freq stabeility (6) - 1 freq acceptabilty (7) - 1 freq disability (7) - 5 freq notability (7) - 1 freq disabeelity (7) - 1 freq instabeelity (7) - 1 freq variabeility (7) - 1 freq availability (7) - 5 freq stability (7) - 3 freq affabeility (7) - 1 freq debility (8) - 1 freq inevitability (8) - 2 freq adaptit (8) - 6 freq adappable (8) - 1 freq aplicability (8) - 1 freq abeility (8) - 4 freq readability (8) - 1 freq daibelt (9) - 1 freq astabillit (9) - 1 freq respectability (9) - 3 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 - ATPTBLT adaptabeility - 1 freq adaptabilitee - 1 freq |
ADAPTABEILITY |
| Time to execute Levenshtein function - 0.225242 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.457678 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.027684 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.036909 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.000898 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. |