| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rid-baunded (0) - 1 freq rid-haunded (1) - 1 freq rig-bane (4) - 2 freq reid-haundit (4) - 2 freq rid-haired (4) - 1 freq rig-banes (4) - 1 freq disbanded (4) - 2 freq rid-faced (4) - 4 freq tin-canned (5) - 1 freq fine-baned (5) - 1 freq daunced (5) - 18 freq heid-butted (5) - 1 freq raed-blooded (5) - 1 freq rigbane (5) - 7 freq reid-haindit (5) - 1 freq bounded (5) - 7 freq rain-daunce (5) - 1 freq rigbane' (5) - 1 freq re-added (5) - 1 freq mid-paced (5) - 1 freq ridiculed (5) - 4 freq daunder (5) - 40 freq demanded (5) - 10 freq refunded (5) - 1 freq haunded (5) - 30 freq |
rid-baunded (0) - 1 freq rid-haunded (2) - 1 freq raed-blooded (6) - 1 freq disbanded (6) - 2 freq reid-haundit (6) - 2 freq reid-haindit (7) - 1 freq rid-tongued (7) - 1 freq rid-faced (7) - 4 freq rig-bane (7) - 2 freq rid-haired (7) - 1 freq rig-banes (7) - 1 freq reid-heided (7) - 3 freq rounded (8) - 9 freq remanded (8) - 1 freq wire-baned (8) - 1 freq reidhaundit (8) - 1 freq riband (8) - 1 freq reed-ringed (8) - 1 freq reid-beirdit (8) - 1 freq ribbands (8) - 1 freq ribboned (8) - 1 freq reid-faced (8) - 3 freq reid-avised (8) - 1 freq heid-banger (8) - 1 freq demanded (8) - 10 freq |
SoundEx code - R315 radfan - 1 freq ruthven - 6 freq rid-baunded - 1 freq rüthbünker - 1 freq redefine - 1 freq redfunnel - 1 freq |
MetaPhone code - RTBNTT rid-baunded - 1 freq |
RID-BAUNDED |
| Time to execute Levenshtein function - 0.386231 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.496441 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.034817 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.047456 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.000908 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. |