| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alluvial (0) - 3 freq allusion (3) - 2 freq alcudia (3) - 1 freq alludit (3) - 2 freq albanian (4) - 1 freq fiducial (4) - 1 freq auldhill (4) - 26 freq colonial (4) - 8 freq allourin (4) - 1 freq allies (4) - 8 freq ill-will (4) - 6 freq albania (4) - 1 freq asturian (4) - 1 freq bilabial (4) - 3 freq alleviated (4) - 1 freq bolivia (4) - 2 freq alivin (4) - 1 freq ullvi (4) - 1 freq ahlsrihl (4) - 1 freq jovial (4) - 1 freq alloa (4) - 4 freq oliviag (4) - 1 freq luvit (4) - 1 freq burial (4) - 12 freq aural (4) - 1 freq |
alluvial (0) - 3 freq llvl (4) - 1 freq allover (5) - 3 freq alll (5) - 1 freq alleluia (5) - 2 freq ullvi (5) - 1 freq illegal (5) - 31 freq allusion (5) - 2 freq alludit (5) - 2 freq allavolie (5) - 1 freq laevil (5) - 1 freq lyvia (6) - 2 freq anvil (6) - 5 freq allotit (6) - 1 freq a'luv (6) - 1 freq aleevin (6) - 1 freq allouit (6) - 1 freq trivial (6) - 3 freq allay (6) - 1 freq plural (6) - 56 freq allyie (6) - 1 freq alva (6) - 2 freq beluvit (6) - 7 freq helluva (6) - 25 freq palatial (6) - 1 freq |
SoundEx code - A414 'ally-bally - 1 freq ally-bally-be - 1 freq allie-ballie - 2 freq allie-ballie-bee - 2 freq alveolars - 1 freq alveolar - 10 freq a-levels - 1 freq allavolie - 1 freq alluvial - 3 freq |
MetaPhone code - ALFL allavolie - 1 freq alluvial - 3 freq |
ALLUVIAL |
| Time to execute Levenshtein function - 0.262540 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.587658 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.029497 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.069280 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.000922 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. |