| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forebodin (0) - 4 freq forebodins (1) - 2 freq torebodin (1) - 1 freq forebodin' (1) - 1 freq foreboding (1) - 2 freq forbodin (1) - 4 freq forecomin (2) - 1 freq forenuin (3) - 11 freq forenoon (3) - 6 freq forwardin (3) - 1 freq somebodie (3) - 12 freq forederin (3) - 1 freq forbiddin (3) - 2 freq omebodie (3) - 1 freq gordin (4) - 2 freq reconin (4) - 1 freq foresaken (4) - 1 freq fardin (4) - 1 freq brendin (4) - 1 freq furein (4) - 1 freq foredaw (4) - 2 freq fookin (4) - 2 freq precedin (4) - 1 freq foregone (4) - 1 freq gorblin (4) - 2 freq |
forebodin (0) - 4 freq forbodin (1) - 4 freq torebodin (2) - 1 freq forebodins (2) - 2 freq foreboding (2) - 2 freq forebodin' (2) - 1 freq forbiddin (4) - 2 freq forecomin (4) - 1 freq forbad (5) - 5 freq forbidden (5) - 15 freq forbid (5) - 10 freq fordoun (5) - 3 freq fardin (5) - 1 freq freudian (5) - 1 freq forbids (5) - 1 freq fireburn (5) - 1 freq freeborn (5) - 1 freq froadin (5) - 1 freq forederin (5) - 1 freq forwardin (5) - 1 freq fourdin (5) - 1 freq forenoon (5) - 6 freq forenuin (5) - 11 freq forgin (6) - 1 freq ayebydin (6) - 2 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 |
FOREBODIN |
| Time to execute Levenshtein function - 0.225480 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.601247 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.028198 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.067068 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.000984 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. |