| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| warpelt (0) - 1 freq warselt (1) - 2 freq warped (2) - 5 freq dappelt (2) - 1 freq warsel (2) - 3 freq carpet (2) - 52 freq waggelt (2) - 1 freq hirpelt (2) - 2 freq garpel (2) - 1 freq warpit (2) - 1 freq wareit (2) - 1 freq marbelt (2) - 1 freq warmest (2) - 5 freq warple (2) - 1 freq warp-let (2) - 1 freq spelt (3) - 46 freq wantet (3) - 82 freq waxwell (3) - 1 freq sarpents (3) - 1 freq waste't (3) - 1 freq waarmest (3) - 1 freq bardet (3) - 1 freq unspelt (3) - 1 freq sarely (3) - 1 freq barrel (3) - 42 freq |
warpelt (0) - 1 freq warselt (2) - 2 freq warpit (3) - 1 freq warple (3) - 1 freq hirpelt (3) - 2 freq warp-let (3) - 1 freq hirplt (4) - 1 freq warpaint (4) - 1 freq warplan (4) - 1 freq wumpilt (4) - 1 freq hirpilt (4) - 4 freq warslet (4) - 6 freq warmest (4) - 5 freq warsel (4) - 3 freq dappelt (4) - 1 freq warped (4) - 5 freq marbelt (4) - 1 freq carpet (4) - 52 freq garpel (4) - 1 freq wareit (4) - 1 freq waggelt (4) - 1 freq sarpint (5) - 3 freq rimpelt (5) - 1 freq marple (5) - 2 freq wirset (5) - 1 freq |
SoundEx code - W614 warple - 1 freq warblin - 1 freq warbled - 1 freq warbles - 3 freq warp-let - 1 freq warplan - 1 freq warbling - 1 freq warpelt - 1 freq warble-flee - 1 freq warbler - 1 freq |
MetaPhone code - WRPLT warp-let - 1 freq warpelt - 1 freq |
WARPELT |
| Time to execute Levenshtein function - 0.271766 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.450507 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.030541 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.040697 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.000950 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. |