| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wrapt (0) - 3 freq prapt (1) - 1 freq wrait (1) - 6 freq wrat (1) - 14 freq rapt (1) - 1 freq wrap (1) - 49 freq wraps (1) - 5 freq wrappt (1) - 2 freq drapt (1) - 35 freq soapt (2) - 1 freq 'rat (2) - 1 freq weant (2) - 1 freq wast (2) - 139 freq wrang (2) - 832 freq krap (2) - 1 freq crait (2) - 1 freq wudpt (2) - 1 freq drapit (2) - 1 freq brat (2) - 15 freq drapd (2) - 1 freq trait (2) - 11 freq wrut (2) - 1 freq rant (2) - 26 freq weat (2) - 1 freq rapet (2) - 16 freq |
wrapt (0) - 3 freq wrappt (2) - 2 freq drapt (2) - 35 freq wrap (2) - 49 freq wraps (2) - 5 freq rapt (2) - 1 freq prapt (2) - 1 freq wrait (2) - 6 freq wrat (2) - 14 freq gript (3) - 1 freq writ (3) - 51 freq wept (3) - 7 freq crept (3) - 33 freq rapet (3) - 16 freq whipt (3) - 2 freq whapit (3) - 1 freq grupt (3) - 2 freq erupt (3) - 3 freq warpit (3) - 1 freq wrate (3) - 47 freq wrowt (3) - 4 freq wrut (3) - 1 freq wrot (3) - 8 freq krept (3) - 1 freq wrist (3) - 22 freq |
SoundEx code - W613 wrapped - 55 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 - 55 freq repeat - 80 freq rapped - 4 freq ripped - 41 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 raped - 6 freq wrapt - 3 freq rap-id - 1 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 |
WRAPT |
| Time to execute Levenshtein function - 0.356497 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.349267 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.028100 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.037711 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.000956 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. |