| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bed-ridden (0) - 1 freq bedridden (1) - 2 freq red-sodden (3) - 1 freq beiyden (4) - 1 freq bedlinen (4) - 1 freq bethfrieden (4) - 2 freq bed-time (4) - 1 freq ridden (4) - 8 freq bearsden (4) - 5 freq bestrides (4) - 1 freq semi-hidden (4) - 1 freq bevridge (4) - 1 freq bed-syde (4) - 1 freq bridder (4) - 26 freq bedien (4) - 1 freq bedside (4) - 20 freq bidden (4) - 36 freq berryden (4) - 2 freq beveridge (4) - 3 freq behudden (4) - 1 freq bearded (5) - 8 freq ker-side (5) - 1 freq heidded (5) - 1 freq beddie (5) - 3 freq begrutten (5) - 6 freq |
bed-ridden (0) - 1 freq bedridden (2) - 2 freq red-sodden (5) - 1 freq bidden (7) - 36 freq bridder (7) - 26 freq bed-syde (7) - 1 freq berryden (7) - 2 freq behudden (7) - 1 freq semi-hidden (7) - 1 freq midgie-ridden (7) - 1 freq ridden (7) - 8 freq bearsden (7) - 5 freq side-rodds (8) - 1 freq bed-happin (8) - 1 freq biddin (8) - 30 freq beddin (8) - 16 freq bak-hauddin (8) - 1 freq tredden (8) - 2 freq brodded (8) - 1 freq riddin (8) - 1 freq bedded (8) - 8 freq liamrudden (8) - 1 freq dadden (8) - 1 freq dresden (8) - 1 freq boarden (8) - 1 freq |
SoundEx code - B363 bothert - 37 freq buttert - 7 freq bothert- - 1 freq butter'd - 1 freq betrothal - 1 freq bothered - 59 freq boatyaird - 1 freq bathert - 11 freq battered - 37 freq beetroot - 14 freq bathered - 8 freq buttered - 19 freq betrayed - 7 freq battert - 9 freq betteradjistit - 1 freq bedridden - 2 freq bethrayed - 2 freq buddered - 7 freq bettered - 4 freq bother't - 1 freq baithert - 1 freq bithert - 2 freq bed-ridden - 1 freq batthered - 1 freq butter't - 2 freq baitert - 1 freq boathered - 2 freq bettert - 2 freq beetruit - 1 freq betrothit - 1 freq butteret - 1 freq batterit - 1 freq betterthedeilyeken - 1 freq bithered - 2 freq botherd - 1 freq |
MetaPhone code - BTRTN bedridden - 2 freq bed-ridden - 1 freq |
BED-RIDDEN |
| Time to execute Levenshtein function - 0.217573 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.377130 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.027899 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.037215 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.000890 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. |