| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forbiddin (0) - 2 freq forbidden (1) - 15 freq forbodin (2) - 4 freq orbitin (3) - 1 freq riddin (3) - 1 freq biddin (3) - 30 freq oonbidden (3) - 1 freq forbids (3) - 1 freq forbid (3) - 10 freq forwardin (3) - 1 freq co-bidin (3) - 1 freq forgittin (3) - 3 freq forgiein (3) - 3 freq forebodin (3) - 4 freq oreigin (4) - 1 freq freistin (4) - 1 freq worritin (4) - 1 freq wuiddin (4) - 1 freq gorblin (4) - 2 freq forgoatin (4) - 1 freq kiddin (4) - 70 freq formattin (4) - 1 freq hiddin (4) - 1 freq forsakin (4) - 1 freq onwindin (4) - 1 freq |
forbiddin (0) - 2 freq forbidden (1) - 15 freq forbodin (3) - 4 freq forebodin (4) - 4 freq forbid (5) - 10 freq affbidden (5) - 1 freq forbids (5) - 1 freq forwardin (5) - 1 freq oonbidden (5) - 1 freq riddin (5) - 1 freq biddin (5) - 30 freq foreboding (6) - 2 freq treddin (6) - 1 freq fordson (6) - 3 freq floddin (6) - 1 freq fordoun (6) - 3 freq forbad (6) - 5 freq fiddian (6) - 1 freq unbiddan (6) - 1 freq freddie (6) - 23 freq buddin (6) - 11 freq forebodin' (6) - 1 freq bidden (6) - 36 freq embeddin (6) - 1 freq roddin (6) - 8 freq |
SoundEx code - F613 forbid - 10 freq four-bedroom - 1 freq forbidden - 15 freq faraboots - 2 freq forebodins - 2 freq forfeited - 1 freq forfeit - 9 freq forebodin - 4 freq forbodin - 4 freq forfaithers - 2 freq forbad - 5 freq forefeitit - 1 freq faur-fetcht - 1 freq four-foot - 1 freq forefaithers - 5 freq forefaither - 1 freq forbïd - 1 freq forebodin' - 1 freq foreboding - 2 freq fower-fit - 1 freq forfeits - 2 freq forefit - 1 freq forbids - 1 freq foirfaithers - 1 freq forpit - 1 freq forefathers - 5 freq frappid - 1 freq forbiddin - 2 freq farraboots - 1 freq |
MetaPhone code - FRBTN forbidden - 15 freq forebodin - 4 freq forbodin - 4 freq forebodin' - 1 freq forbiddin - 2 freq |
FORBIDDIN |
| Time to execute Levenshtein function - 0.497522 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.909497 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.077460 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.085745 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.000907 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. |