| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deid-thraw (0) - 1 freq deid-thraws (1) - 1 freq deid-thraa (1) - 1 freq heidstrap (4) - 1 freq heid-the-baw (4) - 4 freq wind-thrawn (4) - 1 freq reid-tap (4) - 1 freq deid-a (4) - 1 freq win-thrawn (4) - 1 freq reid-hoat (4) - 1 freq bridgehaw (5) - 1 freq see-throwe (5) - 1 freq deidpan (5) - 1 freq deith' (5) - 1 freq bird-craw (5) - 1 freq dis-the (5) - 1 freq dreid-na (5) - 1 freq efteraw (5) - 17 freq heid-furst (5) - 1 freq eco-trow (5) - 1 freq deith (5) - 103 freq pent-braw (5) - 1 freq reed-raa (5) - 1 freq withdraw (5) - 3 freq heid-a (5) - 1 freq |
deid-thraw (0) - 1 freq deid-thraws (2) - 1 freq deid-thraa (2) - 1 freq wind-thrawn (7) - 1 freq see-throwe (7) - 1 freq win-thrawn (7) - 1 freq heid-the-baw (7) - 4 freq heathrow (8) - 2 freq thraw (8) - 45 freq deid-house (8) - 1 freq mind-thrawin (8) - 1 freq ice-thrawn (8) - 1 freq drive-thru (8) - 1 freq deid-purpie (8) - 1 freq athraw (8) - 1 freq inthrow (8) - 1 freq eco-trow (8) - 1 freq reid-hoat (8) - 1 freq desthroy (8) - 6 freq deid-a (8) - 1 freq reid-tap (8) - 1 freq heidstrap (8) - 1 freq dis-the (8) - 1 freq bethray (9) - 2 freq dule-tree (9) - 1 freq |
SoundEx code - D360 dother - 37 freq doatery - 1 freq dither - 2 freq dooter - 3 freq detour - 7 freq dowter - 8 freq deter - 4 freq dietary - 1 freq doddery - 5 freq deid-thraw - 1 freq dotir - 1 freq dudder - 1 freq dithery - 1 freq deid-thraa - 1 freq daither - 1 freq dotterie - 1 freq dater - 1 freq doddieweir - 1 freq dottir - 1 freq doiter - 1 freq |
MetaPhone code - TT0R deid-thraw - 1 freq deid-thraa - 1 freq |
DEID-THRAW |
| Time to execute Levenshtein function - 0.220941 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.566750 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.071579 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.090067 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.001049 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. |