| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ash-filled (0) - 1 freq gas-filled (2) - 1 freq shit-filled (3) - 1 freq shevelled (4) - 1 freq filled (4) - 152 freq 'chilled (4) - 1 freq fire-filled (4) - 1 freq so-called (4) - 3 freq ashmill (4) - 3 freq thrilled (4) - 8 freq skilled (4) - 12 freq spilled (4) - 4 freq cork-filled (4) - 2 freq shovelled (4) - 1 freq fullfilled (4) - 1 freq o'erfilled (4) - 1 freq swilled (4) - 1 freq shuffled (4) - 12 freq fulfilled (4) - 3 freq shelled (4) - 2 freq stilled (4) - 7 freq skeilled (4) - 1 freq assailed (4) - 2 freq chilled (4) - 9 freq achilles (4) - 5 freq |
ash-filled (0) - 1 freq shit-filled (4) - 1 freq gas-filled (4) - 1 freq so-called (6) - 3 freq shelled (6) - 2 freq fire-filled (6) - 1 freq shuffled (6) - 12 freq shovelled (6) - 1 freq shevelled (6) - 1 freq chilled (7) - 9 freq stilled (7) - 7 freq skeilled (7) - 1 freq shawfield (7) - 1 freq shiffllin (7) - 1 freq sugar-filled (7) - 1 freq shrivelled (7) - 1 freq sae-called (7) - 2 freq shackelled (7) - 1 freq unfufilled (7) - 1 freq sheffield (7) - 3 freq ashmill (7) - 3 freq skilled (7) - 12 freq fulfilled (7) - 3 freq thrilled (7) - 8 freq spilled (7) - 4 freq |
SoundEx code - A214 asphalt - 3 freq axfil - 1 freq ash-filled - 1 freq aqpltwfrbg - 1 freq aqblqxhlgb - 1 freq ajblch - 1 freq ashvale - 3 freq agapelove - 1 freq |
MetaPhone code - AXFLT ash-filled - 1 freq |
ASH-FILLED |
| Time to execute Levenshtein function - 0.379536 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.615393 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.030044 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.037582 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.000851 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. |