| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fareweills (0) - 1 freq fareweill (1) - 6 freq farewell (2) - 13 freq fareweels (2) - 1 freq 'fareweill' (2) - 1 freq foretells (3) - 2 freq fareweel (3) - 31 freq harebells (3) - 2 freq furtells (4) - 1 freq firewirks (4) - 8 freq atweill (4) - 27 freq alsweill (4) - 1 freq reveille (4) - 1 freq fire-bells (4) - 1 freq ayewils (4) - 1 freq marseilles (4) - 1 freq forsweirs (4) - 1 freq asweill (4) - 2 freq frills (4) - 1 freq foreheids (4) - 1 freq marinells (4) - 1 freq ayeweis (4) - 4 freq fare-ye-weills (4) - 1 freq farrell (4) - 1 freq farmville (4) - 1 freq |
fareweills (0) - 1 freq fareweill (2) - 6 freq fareweels (3) - 1 freq farewell (3) - 13 freq foretells (4) - 2 freq 'fareweill' (4) - 1 freq frills (5) - 1 freq fireballs (5) - 1 freq harebells (5) - 2 freq fareweel (5) - 31 freq furtells (5) - 1 freq foretellt (6) - 1 freq faills (6) - 1 freq farrell (6) - 1 freq foretell (6) - 4 freq futehills (6) - 1 freq fare-ye-weills (6) - 1 freq refills (6) - 1 freq fitehills (6) - 7 freq farrels (6) - 1 freq retells (6) - 1 freq marseilles (6) - 1 freq fire-bells (6) - 1 freq firewirks (6) - 8 freq marinells (6) - 1 freq |
SoundEx code - F642 ferlies - 61 freq ferlie's - 3 freq foreleg - 1 freq furloughed - 4 freq fearlessly - 2 freq fearless - 9 freq fareweels - 1 freq farls - 5 freq fower-leggit - 2 freq four-leggit - 1 freq frail-lookin - 1 freq frolic - 1 freq fireless - 3 freq firelichtin - 1 freq frillies - 1 freq frills - 1 freq forelegs - 1 freq firelicht - 2 freq fare-ye-weills - 1 freq fareweills - 1 freq farrels - 1 freq four-legged - 1 freq frolicking - 1 freq fairlookingforwardtoit - 1 freq frolicked - 1 freq |
MetaPhone code - FRWLS fareweels - 1 freq fareweills - 1 freq |
FAREWEILLS |
| Time to execute Levenshtein function - 0.209845 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.406276 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.027647 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.037593 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.000823 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. |