| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vanisht (0) - 4 freq vainisht (1) - 5 freq vanish (1) - 6 freq manisht (1) - 1 freq vanishit (1) - 1 freq banisht (1) - 1 freq varnish (2) - 6 freq vainist (2) - 1 freq vainish (2) - 9 freq famisht (2) - 1 freq danicht (2) - 4 freq manish (2) - 4 freq vanishin (2) - 5 freq vanishes (2) - 1 freq finisht (2) - 14 freq nanicht (2) - 1 freq danish (2) - 19 freq vanishan (2) - 1 freq punisht (2) - 2 freq bainisht (2) - 5 freq vanished (2) - 39 freq danight (2) - 9 freq verish (3) - 1 freq vainished (3) - 10 freq parish (3) - 30 freq |
vanisht (0) - 4 freq vanishit (1) - 1 freq vainisht (1) - 5 freq manisht (2) - 1 freq banisht (2) - 1 freq vanish (2) - 6 freq finisht (3) - 14 freq vanishes (3) - 1 freq vanishan (3) - 1 freq vanished (3) - 39 freq vanishin (3) - 5 freq punisht (3) - 2 freq bainisht (3) - 5 freq vainist (3) - 1 freq vainish (3) - 9 freq vainishes (4) - 5 freq manish (4) - 4 freq varnish (4) - 6 freq vashti (4) - 2 freq feenisht (4) - 43 freq panshit (4) - 1 freq feinisht (4) - 32 freq vainished (4) - 10 freq snasht (4) - 1 freq danicht (4) - 4 freq |
SoundEx code - V523 vainished - 10 freq vanished - 39 freq vanisht - 4 freq vainisht - 5 freq vanishit - 1 freq vainist - 1 freq venstre - 2 freq |
MetaPhone code - FNXT feenished - 166 freq vainished - 10 freq feenisht - 43 freq feeneesht - 9 freq feeneeshed - 20 freq vanished - 39 freq vanisht - 4 freq vainisht - 5 freq finished - 127 freq feinisht - 32 freq feenishd - 3 freq feinished - 5 freq finisht - 14 freq feeneshed - 2 freq finshed - 1 freq feeneesh'd - 1 freq ghunched - 1 freq vanishit - 1 freq feinish't - 1 freq fÃnished - 1 freq feenishit - 2 freq fÃnisht - 4 freq €œfeenisht - 1 freq €˜finished - 1 freq finechty - 2 freq finishit - 1 freq |
VANISHT |
| Time to execute Levenshtein function - 0.224114 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.358516 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.028941 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.037983 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.000796 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. |