| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alveolars (0) - 1 freq alveolar (1) - 10 freq velars (3) - 1 freq adveisars (3) - 1 freq votars (4) - 4 freq alleyways (4) - 1 freq sellars (4) - 1 freq voars (4) - 3 freq adventirs (4) - 12 freq clears (4) - 19 freq adventurs (4) - 2 freq pedlars (4) - 1 freq avengers (4) - 2 freq angela's (4) - 2 freq ledars (4) - 1 freq aventurs (4) - 2 freq leopard (4) - 5 freq allstars (4) - 1 freq allowans (4) - 1 freq 'leonard (4) - 1 freq scholars (4) - 35 freq avatars (4) - 3 freq calendars (4) - 3 freq €˜violaris (4) - 1 freq lears (4) - 2 freq |
alveolars (0) - 1 freq alveolar (2) - 10 freq velars (4) - 1 freq allers (5) - 1 freq uvulars (5) - 1 freq adveisars (5) - 1 freq revellers (6) - 1 freq leears (6) - 6 freq allays (6) - 1 freq velar (6) - 7 freq altars (6) - 2 freq foveoles (6) - 1 freq cellars (6) - 1 freq ashlars (6) - 2 freq levers (6) - 6 freq luvers (6) - 12 freq loveless (6) - 1 freq livers (6) - 1 freq lalors (6) - 1 freq leavers (6) - 1 freq luveless (6) - 1 freq reevlers (6) - 4 freq bevellers (6) - 1 freq lovers (6) - 20 freq blears (6) - 2 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 - ALFLRS alveolars - 1 freq |
ALVEOLARS |
| Time to execute Levenshtein function - 0.228950 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.420984 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.030579 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.038768 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.000927 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. |