| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| albapartytime (0) - 2 freq albaparty (4) - 9 freq part-time (5) - 2 freq lear-time (6) - 4 freq pairt-time (6) - 5 freq backartywise (6) - 1 freq bairntime (6) - 3 freq bathtime (6) - 1 freq pert-time (6) - 1 freq playtime (6) - 24 freq dalbeattie (6) - 2 freq flattie (7) - 3 freq apparition (7) - 3 freq pattie (7) - 2 freq taytime (7) - 1 freq suppertime (7) - 6 freq bonaparte (7) - 2 freq quaarantine (7) - 1 freq alternative (7) - 46 freq backarty-wise (7) - 1 freq wartime (7) - 7 freq daytime (7) - 7 freq flytime (7) - 2 freq beattie (7) - 6 freq lamantation (7) - 1 freq |
albapartytime (0) - 2 freq albaparty (6) - 9 freq part-time (8) - 2 freq bairntime (9) - 3 freq pert-time (9) - 1 freq pairt-time (9) - 5 freq lear-time (9) - 4 freq bairntyme (10) - 1 freq albertina (10) - 1 freq suppertime (10) - 6 freq partition (10) - 4 freq supper-time (10) - 1 freq bathtime (10) - 1 freq dalbeattie (10) - 2 freq playtime (10) - 24 freq spartit (11) - 2 freq raportit (11) - 2 freq boattum (11) - 4 freq elaboration (11) - 4 freq lazaretto (11) - 1 freq alberta (11) - 1 freq alberto (11) - 2 freq evaporatit (11) - 1 freq departit (11) - 5 freq deportation (11) - 1 freq |
SoundEx code - A411 alphabet - 15 freq alphabetic - 2 freq alphabetti - 1 freq alphabee - 9 freq alphabets - 1 freq alphabetical - 2 freq albaparty - 9 freq alphabetties - 1 freq alfieboe - 1 freq albapartytime - 2 freq alfiehfc - 1 freq |
MetaPhone code - ALBPRTTM albapartytime - 2 freq |
ALBAPARTYTIME |
| Time to execute Levenshtein function - 0.220655 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.412877 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.028146 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.037370 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.000819 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. |