| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| last-ditch (0) - 1 freq €˜last-ditch (2) - 1 freq streitch (4) - 12 freq sashatitch (4) - 1 freq lastit (4) - 13 freq partitch (4) - 1 freq stitch (4) - 11 freq lasting (5) - 3 freq leitch (5) - 11 freq stitzch (5) - 1 freq stainch (5) - 3 freq pairritch (5) - 1 freq mastrick (5) - 3 freq cast-oot (5) - 1 freq maist-cited (5) - 1 freq pastit (5) - 1 freq mastic (5) - 2 freq moskovitch (5) - 1 freq plastics (5) - 1 freq post-it (5) - 1 freq least-at (5) - 3 freq garevitch (5) - 1 freq titch (5) - 5 freq €œswitch (5) - 5 freq lastinly (5) - 1 freq |
last-ditch (0) - 1 freq €˜last-ditch (4) - 1 freq stitch (7) - 11 freq streitch (7) - 12 freq stretch (8) - 27 freq streetch (8) - 31 freq least-at (8) - 3 freq luve-daith (8) - 1 freq partitch (8) - 1 freq lastit (8) - 13 freq sashatitch (8) - 1 freq notawitch (9) - 1 freq ostrich (9) - 1 freq latch (9) - 11 freq stairch (9) - 1 freq elastic (9) - 13 freq listit (9) - 7 freq scraitch (9) - 1 freq switch (9) - 55 freq jasonleitch (9) - 5 freq stith (9) - 4 freq stinch (9) - 5 freq elastics (9) - 1 freq elasticity (9) - 1 freq streitcht (9) - 3 freq |
SoundEx code - L233 lichtit - 64 freq lestit - 11 freq lasted - 15 freq lichted - 14 freq licht-heided - 1 freq least-at - 3 freq lastit - 13 freq lassitude - 1 freq licht-heidit - 4 freq listed - 6 freq luistit - 1 freq lichtet - 2 freq 'lichtet - 1 freq located - 5 freq lighted - 3 freq listet - 1 freq liquidation - 2 freq laistit - 2 freq lactatin - 1 freq lested - 4 freq locatit - 7 freq listit - 7 freq lightit - 1 freq laisted - 3 freq €˜last-ditch - 1 freq liquidate - 2 freq light-headed - 1 freq lichtheidit - 1 freq lucky-white-heather - 1 freq last-ditch - 1 freq liquidated - 1 freq 'lactate' - 1 freq looktothesea - 1 freq |
MetaPhone code - LSTTX €˜last-ditch - 1 freq last-ditch - 1 freq |
LAST-DITCH |
| Time to execute Levenshtein function - 0.261991 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.497327 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.030374 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.039934 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.000854 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. |