| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wrap (0) - 49 freq wap (1) - 3 freq drap (1) - 265 freq trap (1) - 62 freq whap (1) - 2 freq wramp (1) - 1 freq crap (1) - 85 freq wran (1) - 2 freq wrak (1) - 3 freq wraps (1) - 5 freq prap (1) - 3 freq wrapt (1) - 3 freq wrat (1) - 14 freq rap (1) - 20 freq krap (1) - 1 freq weat (2) - 1 freq cray (2) - 1 freq mrp (2) - 1 freq rat (2) - 58 freq whup (2) - 8 freq qrp (2) - 1 freq brat (2) - 15 freq dram (2) - 115 freq raa (2) - 38 freq frae (2) - 4566 freq |
wrap (0) - 49 freq prap (2) - 3 freq wraps (2) - 5 freq wrapt (2) - 3 freq krap (2) - 1 freq warp (2) - 9 freq wrak (2) - 3 freq rap (2) - 20 freq wrat (2) - 14 freq wap (2) - 3 freq wran (2) - 2 freq drap (2) - 265 freq whap (2) - 2 freq trap (2) - 62 freq crap (2) - 85 freq wramp (2) - 1 freq whaap (3) - 3 freq hrp (3) - 1 freq wr (3) - 7 freq trep (3) - 2 freq welp (3) - 1 freq rape (3) - 19 freq prep (3) - 5 freq unwrap (3) - 2 freq wp (3) - 4 freq |
SoundEx code - W610 whaur've - 3 freq whaurby - 8 freq wrap - 49 freq warp - 9 freq where've - 3 freq wharf - 2 freq whaarby - 2 freq €œwrap - 1 freq whereby - 1 freq |
MetaPhone code - RP ripe - 28 freq rowp - 4 freq rip - 57 freq raip - 32 freq rope - 118 freq rep - 3 freq rape - 19 freq roup - 24 freq wrap - 49 freq rippa - 4 freq reep - 2 freq roap - 3 freq ropey - 1 freq reap - 10 freq rop - 6 freq rap - 20 freq rap' - 1 freq rype - 5 freq repey - 1 freq ropp - 7 freq 'rip' - 1 freq rawp - 1 freq raep - 2 freq repay - 1 freq rp - 8 freq rape- - 2 freq €œrope - 1 freq rapa - 1 freq €œwrap - 1 freq €˜rp - 1 freq €™rip - 1 freq hraip - 1 freq rpp - 1 freq rapp - 1 freq hrp - 1 freq |
WRAP |
| Time to execute Levenshtein function - 0.203943 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.336497 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.027504 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.036933 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.000887 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. |