| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gas-filled (0) - 1 freq ash-filled (2) - 1 freq sugar-filled (3) - 1 freq filled (4) - 152 freq spilled (4) - 4 freq cork-filled (4) - 2 freq assailed (4) - 2 freq stilled (4) - 7 freq skilled (4) - 12 freq o'erfilled (4) - 1 freq skeilled (4) - 1 freq pastilles (4) - 1 freq fire-filled (4) - 1 freq distilled (4) - 5 freq shit-filled (4) - 1 freq instilled (4) - 1 freq fullfilled (4) - 1 freq swilled (4) - 1 freq grilled (4) - 2 freq unfufilled (4) - 1 freq fulfilled (4) - 3 freq sae-called (4) - 2 freq spieled (5) - 1 freq gaffed (5) - 13 freq ae-sided (5) - 2 freq |
gas-filled (0) - 1 freq ash-filled (4) - 1 freq sugar-filled (5) - 1 freq fire-filled (6) - 1 freq sae-called (6) - 2 freq swilled (7) - 1 freq fullfilled (7) - 1 freq instilled (7) - 1 freq grilled (7) - 2 freq unfufilled (7) - 1 freq so-called (7) - 3 freq cork-filled (7) - 2 freq fulfilled (7) - 3 freq shit-filled (7) - 1 freq filled (7) - 152 freq skilled (7) - 12 freq distilled (7) - 5 freq o'erfilled (7) - 1 freq stilled (7) - 7 freq spilled (7) - 4 freq skeilled (7) - 1 freq scrolled (8) - 2 freq stifled (8) - 1 freq fulled (8) - 36 freq mid-field (8) - 1 freq |
SoundEx code - G214 gospel - 29 freq gowkflooers - 1 freq gas-filled - 1 freq gospels - 9 freq gospellin - 1 freq guessable - 1 freq |
MetaPhone code - KSFLT gas-filled - 1 freq |
GAS-FILLED |
| Time to execute Levenshtein function - 0.228999 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.400309 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.032275 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.039952 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. |