| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| apdatin (0) - 2 freq updatin (1) - 4 freq poatin (2) - 1 freq updatit (2) - 13 freq updating (2) - 2 freq adaptin (2) - 1 freq a-daein (2) - 1 freq abatin (2) - 1 freq aatin (2) - 1 freq datin (2) - 11 freq spottin (3) - 4 freq donatin (3) - 1 freq pentin (3) - 23 freq parin (3) - 4 freq appearin (3) - 22 freq gyratin (3) - 1 freq optin (3) - 1 freq sedarin (3) - 1 freq agitatin (3) - 2 freq spitin (3) - 2 freq aakin (3) - 3 freq speanin (3) - 1 freq dalin (3) - 4 freq sweatin (3) - 15 freq pastin (3) - 2 freq |
apdatin (0) - 2 freq updatin (1) - 4 freq updating (3) - 2 freq datin (3) - 11 freq updatit (3) - 13 freq poatin (3) - 1 freq patina (4) - 1 freq pautin (4) - 1 freq postin (4) - 21 freq peltin (4) - 6 freq pawtin (4) - 1 freq operatin (4) - 9 freq putin (4) - 4 freq pettin (4) - 3 freq datn (4) - 4 freq pyntin (4) - 80 freq pantin (4) - 9 freq updaetit (4) - 2 freq partin (4) - 5 freq audition (4) - 8 freq dautin (4) - 2 freq editin (4) - 22 freq pittin (4) - 392 freq puntin (4) - 5 freq addition (4) - 17 freq |
SoundEx code - A133 appetite - 19 freq abided - 1 freq avoidit - 8 freq appetites - 2 freq avoidet - 1 freq apathetic - 1 freq apdatin - 2 freq aabody'd - 1 freq appiteits - 1 freq aptitudes - 1 freq avoided - 5 freq abated - 1 freq afftaethecludgie - 1 freq |
MetaPhone code - APTTN apdatin - 2 freq |
APDATIN |
| Time to execute Levenshtein function - 0.228190 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.370441 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.027487 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.037526 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.000776 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. |