| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wheeshtit (0) - 7 freq wheeshtie (1) - 3 freq wheeshtin (1) - 2 freq wheesht (2) - 3 freq wheesht' (2) - 1 freq wheeshts (2) - 1 freq wheesht (2) - 192 freq wheeshin (2) - 2 freq 'wheeshtie (2) - 1 freq wheechit (2) - 2 freq hechtit (3) - 5 freq whooshti (3) - 1 freq weichtit (3) - 2 freq wheests (3) - 1 freq 'wheesht (3) - 15 freq wheeplit (3) - 2 freq veesitit (3) - 8 freq weeshin (3) - 1 freq wheechin (3) - 40 freq wheepit (3) - 2 freq weesh't (3) - 1 freq freestit (3) - 1 freq wechtit (3) - 10 freq wheichit (3) - 1 freq wheeshed (3) - 3 freq |
wheeshtit (0) - 7 freq wheeshtin (2) - 2 freq wheeshtie (2) - 3 freq wheeshts (3) - 1 freq wheesht' (3) - 1 freq wheesht (3) - 192 freq wheisht (4) - 7 freq wheechit (4) - 2 freq whooshti (4) - 1 freq 'wheeshtie (4) - 1 freq wheesht (4) - 3 freq wheeshin (4) - 2 freq wheest (5) - 19 freq weesht (5) - 11 freq heistit (5) - 4 freq whoosht (5) - 3 freq heystit (5) - 1 freq wheecht (5) - 10 freq whusht (5) - 1 freq wheichit (5) - 1 freq whisht (5) - 3 freq 'wheesht' (5) - 3 freq wheestle (5) - 1 freq wheeshed (5) - 3 freq hechtit (5) - 5 freq |
SoundEx code - W233 wasted - 24 freq wastit - 21 freq waistit - 4 freq wechted - 1 freq waasht-oot - 1 freq wechtit - 10 freq westwater - 1 freq waste't - 1 freq wechtwaatchers - 1 freq wastet - 2 freq wheeshtit - 7 freq weichtit - 2 freq whistied - 1 freq wawsteids - 1 freq weightwatchers - 1 freq wauchtit - 2 freq washedoot - 1 freq waw-steid - 1 freq weighted - 3 freq waisted - 1 freq wkstott - 1 freq which-heidit - 1 freq wastedducks - 1 freq wztyt - 1 freq |
MetaPhone code - WXTT wechted - 1 freq waasht-oot - 1 freq wechtit - 10 freq wheeshtit - 7 freq weichtit - 2 freq wauchtit - 2 freq washedoot - 1 freq |
WHEESHTIT wheesht - 192 freq weesht - 11 freq weesh - 11 freq wheeshtit - 7 freq wheeshtie - 3 freq wheesht' - 1 freq |
| Time to execute Levenshtein function - 0.301930 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.435523 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.027964 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.038622 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.001254 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. |