| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forebye (0) - 59 freq forbye (1) - 427 freq foreby (1) - 2 freq for-bye (1) - 2 freq forebyes (1) - 1 freq oorbye (2) - 1 freq forbae (2) - 1 freq forebye's (2) - 1 freq 'forbye (2) - 3 freq foree (2) - 1 freq foresee (2) - 7 freq forbye' (2) - 1 freq foraye (2) - 13 freq forby (2) - 491 freq forbyes (2) - 6 freq firbye (2) - 29 freq forbye- (2) - 1 freq furbye (2) - 6 freq aforesyne (3) - 4 freq freute (3) - 1 freq forsee (3) - 1 freq somewye (3) - 67 freq gorble (3) - 2 freq forkfae (3) - 1 freq fremyt (3) - 2 freq |
forebye (0) - 59 freq foreby (1) - 2 freq forbye (1) - 427 freq firbye (2) - 29 freq forby (2) - 491 freq furbye (2) - 6 freq forbae (2) - 1 freq forebyes (2) - 1 freq for-bye (2) - 2 freq forbye- (3) - 1 freq forbyes (3) - 6 freq furby (3) - 29 freq firby (3) - 1 freq freebee (3) - 1 freq freebie (3) - 2 freq oorbye (3) - 1 freq foraye (3) - 13 freq 'forbye (3) - 3 freq foree (3) - 1 freq foresee (3) - 7 freq forbye' (3) - 1 freq foray (4) - 1 freq forays (4) - 2 freq forgie (4) - 92 freq forgya (4) - 2 freq |
SoundEx code - F610 far-off - 3 freq forbye - 427 freq forby - 491 freq faur-aff - 10 freq furbye - 6 freq 'forby - 1 freq fearfu - 14 freq firbye - 29 freq furby - 29 freq 'forbye - 3 freq forbye' - 1 freq fearfa - 1 freq forebye - 59 freq fearfou - 1 freq foreby - 2 freq frapp - 1 freq firby - 1 freq far-aff - 6 freq fearfae - 1 freq fairfaw - 1 freq freebee - 1 freq forbye- - 1 freq freebie - 2 freq €œforby - 1 freq €œforbye - 1 freq for-bye - 2 freq €˜forby - 1 freq forbae - 1 freq furv - 1 freq fairfaaye - 11 freq freeview - 1 freq |
MetaPhone code - FRBY forbye - 427 freq furbye - 6 freq firbye - 29 freq 'forbye - 3 freq forbye' - 1 freq forebye - 59 freq forbye- - 1 freq €œforbye - 1 freq for-bye - 2 freq |
FOREBYE |
| Time to execute Levenshtein function - 0.192199 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.331074 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.027721 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.040602 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.000837 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. |