| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| antlers (0) - 11 freq anklers (1) - 1 freq anglers (1) - 1 freq anters (1) - 1 freq antlert (1) - 1 freq canters (2) - 1 freq manglers (2) - 1 freq ankles (2) - 24 freq panthers (2) - 3 freq aunters (2) - 1 freq antlered (2) - 1 freq allers (2) - 1 freq afters (2) - 3 freq ankle's (2) - 1 freq mantle's (2) - 2 freq hantles (2) - 1 freq anthems (2) - 5 freq angler (2) - 1 freq mantles (2) - 1 freq answers (2) - 72 freq anders (2) - 1 freq anther (2) - 2 freq aithers (2) - 7 freq anter (2) - 1 freq enters (2) - 10 freq |
antlers (0) - 11 freq anters (2) - 1 freq antlert (2) - 1 freq anglers (2) - 1 freq anklers (2) - 1 freq antlered (3) - 1 freq enters (3) - 10 freq anithers (3) - 5 freq aunters (3) - 1 freq anothers (3) - 1 freq nothers (4) - 1 freq tylers (4) - 1 freq natters (4) - 1 freq panthers (4) - 3 freq manglers (4) - 1 freq angles (4) - 25 freq ootliers (4) - 1 freq canters (4) - 1 freq teylers (4) - 1 freq naters (4) - 1 freq antares (4) - 1 freq nithers (4) - 1 freq nutters (4) - 7 freq entaels (4) - 1 freq ans'ers (4) - 1 freq |
SoundEx code - A534 antlered - 1 freq antlers - 11 freq anthology - 11 freq anthologies - 5 freq anthologised - 2 freq anthologie - 4 freq anti-latinate - 2 freq antlert - 1 freq andyheald - 1 freq andyleith - 1 freq andylaw - 2 freq andalg - 1 freq andalusianirish - 2 freq |
MetaPhone code - ANTLRS antlers - 11 freq |
ANTLERS |
| Time to execute Levenshtein function - 0.185330 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.364517 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.027280 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.041887 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.001025 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. |