| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forbid (0) - 9 freq forbad (1) - 5 freq forbids (1) - 1 freq forrid (1) - 1 freq morbid (1) - 3 freq fobbin (2) - 3 freq forrit (2) - 527 freq forcit (2) - 2 freq formin (2) - 16 freq formed (2) - 47 freq forwird (2) - 2 freq forrad (2) - 5 freq forged (2) - 3 freq firwid (2) - 1 freq fornin (2) - 1 freq worsid (2) - 2 freq forkin (2) - 7 freq fortig (2) - 1 freq forked (2) - 3 freq corbie (2) - 27 freq forcin (2) - 20 freq horrid (2) - 9 freq forit (2) - 1 freq dobbid (2) - 1 freq fobie (2) - 32 freq |
forbid (0) - 9 freq forbad (1) - 5 freq forrid (2) - 1 freq morbid (2) - 3 freq forbids (2) - 1 freq fraid (3) - 3 freq forby (3) - 491 freq forgied (3) - 2 freq forked (3) - 3 freq forced (3) - 72 freq forbeir (3) - 3 freq forbes (3) - 10 freq forbye (3) - 427 freq forred (3) - 1 freq forbae (3) - 1 freq ford (3) - 13 freq forged (3) - 3 freq forrad (3) - 5 freq firwid (3) - 1 freq formed (3) - 47 freq furby (4) - 29 freq furled (4) - 11 freq furbye (4) - 6 freq forbye- (4) - 1 freq forbye' (4) - 1 freq |
SoundEx code - F613 forbid - 9 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 - FRBT forbid - 9 freq forbad - 5 freq forbïd - 1 freq |
FORBID |
| Time to execute Levenshtein function - 0.178369 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.329236 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.027368 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.037285 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.000833 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. |