| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| atlas (0) - 28 freq alas (1) - 43 freq arras (2) - 24 freq pallas (2) - 2 freq allus (2) - 4 freq aquas (2) - 2 freq allays (2) - 1 freq asdas (2) - 1 freq aglay (2) - 1 freq staas (2) - 4 freq areas (2) - 94 freq teas (2) - 3 freq gallas (2) - 1 freq ataa (2) - 8 freq atlows (2) - 1 freq taas (2) - 1 freq alps (2) - 2 freq ails (2) - 9 freq las (2) - 8 freq ats (2) - 126 freq tles (2) - 1 freq ghlas (2) - 1 freq dallas (2) - 1 freq arles (2) - 5 freq atae (2) - 1 freq |
atlas (0) - 28 freq alas (2) - 43 freq tles (2) - 1 freq at's (3) - 423 freq als (3) - 27 freq atoms (3) - 8 freq 'las (3) - 4 freq thas (3) - 2 freq alles (3) - 1 freq colas (3) - 1 freq kailas (3) - 1 freq tras (3) - 1 freq atl (3) - 2 freq btls (3) - 1 freq atli (3) - 1 freq atal (3) - 2 freq twas (3) - 16 freq tiles (3) - 16 freq tials (3) - 1 freq ootlaas (3) - 1 freq tails (3) - 54 freq tels (3) - 4 freq tyles (3) - 1 freq taels (3) - 2 freq ootlays (3) - 2 freq |
SoundEx code - A342 atlas - 28 freq atlows - 1 freq audiologist - 2 freq adolescent - 4 freq atlukkan - 1 freq atlas's - 1 freq athelstane - 1 freq ayatollahs - 1 freq adolescence - 1 freq |
MetaPhone code - ATLS atlas - 28 freq atlows - 1 freq |
ATLAS |
| Time to execute Levenshtein function - 0.214337 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.339923 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.027140 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.037339 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.000899 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. |