Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wrappit (0) - 10 freq wrappt (1) - 2 freq vrappit (1) - 1 freq drappit (1) - 93 freq wrappin (1) - 15 freq wappit (1) - 13 freq crappit (1) - 4 freq rappit (1) - 1 freq trappit (1) - 7 freq wappie (2) - 1 freq wrackit (2) - 2 freq rappin (2) - 6 freq snappit (2) - 32 freq graspit (2) - 3 freq tappit (2) - 6 freq proppit (2) - 3 freq wrapper (2) - 21 freq dappit (2) - 1 freq trappin (2) - 1 freq drappet (2) - 5 freq happit (2) - 102 freq cruppit (2) - 1 freq crampit (2) - 2 freq gruppit (2) - 23 freq whapit (2) - 1 freq |
wrappit (0) - 10 freq wrappt (1) - 2 freq crappit (2) - 4 freq wappit (2) - 13 freq rappit (2) - 1 freq trappit (2) - 7 freq wrappin (2) - 15 freq drappit (2) - 93 freq vrappit (2) - 1 freq grippit (3) - 58 freq croppit (3) - 1 freq whuppit (3) - 2 freq wyppit (3) - 1 freq rappt (3) - 1 freq trappet (3) - 2 freq wippit (3) - 12 freq wrapt (3) - 3 freq whippit (3) - 8 freq trippit (3) - 4 freq drappt (3) - 25 freq wuppit (3) - 3 freq droppit (3) - 1 freq rippit (3) - 15 freq wrapped (3) - 53 freq unwrappit (3) - 2 freq |
SoundEx code - W613 wrapped - 53 freq whauraboots - 5 freq wrappit - 10 freq warped - 5 freq whereaboots - 4 freq wrapt - 3 freq wrappt - 2 freq warbeth - 1 freq whaaraboots - 1 freq €œwhaurabouts - 1 freq warpit - 1 freq whaurabouts - 1 freq 'wrapped - 1 freq waerbdwavy - 1 freq whereabout - 1 freq whauraboot - 1 freq |
MetaPhone code - RPT wrapped - 53 freq repeat - 77 freq rapped - 4 freq ripped - 40 freq repute - 12 freq rapid - 15 freq wrappit - 10 freq rippit - 15 freq riped - 2 freq reipit - 2 freq rippet - 7 freq ripeeoot - 1 freq wrapt - 3 freq rap-id - 1 freq raped - 5 freq wrappt - 2 freq roped - 1 freq repete - 1 freq rappit - 1 freq raiped - 5 freq rapt - 1 freq rapet - 16 freq rappt - 1 freq rypit - 4 freq repaid - 1 freq repaet - 1 freq 'wrapped - 1 freq roupit - 1 freq |
WRAPPIT |
Time to execute Levenshtein function - 0.168700 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.332420 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.029221 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.039740 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.000836 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. |