| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| girlfreend (0) - 4 freq girlfreen (1) - 1 freq girlfriend (1) - 18 freq girlfriends (2) - 1 freq girlfiend (2) - 1 freq 'girlfriend (2) - 1 freq girlfreins (2) - 1 freq girlfrien (2) - 1 freq girlfriend's (3) - 2 freq gillgreeny (3) - 1 freq €œfreend (4) - 1 freq defreend (4) - 1 freq €˜freend (4) - 1 freq wilfred (4) - 12 freq freend (4) - 153 freq boyfreend (4) - 1 freq fifteent (5) - 3 freq unfreen (5) - 1 freq gruneens (5) - 1 freq boyfriend (5) - 39 freq winifred (5) - 34 freq wilfred's (5) - 1 freq airland (5) - 2 freq erlend (5) - 4 freq pirled (5) - 3 freq |
girlfreend (0) - 4 freq girlfriend (1) - 18 freq girlfreen (2) - 1 freq girlfrien (3) - 1 freq 'girlfriend (3) - 1 freq girlfreins (3) - 1 freq girlfriends (3) - 1 freq girlfiend (3) - 1 freq girlfriend's (5) - 2 freq gillgreeny (6) - 1 freq boyfreend (7) - 1 freq freend (7) - 153 freq garland (7) - 5 freq wilfred (7) - 12 freq gairland (7) - 1 freq defreend (7) - 1 freq €œfreend (7) - 1 freq €˜freend (7) - 1 freq €˜freand (8) - 1 freq frend (8) - 1 freq gloried (8) - 1 freq refereed (8) - 1 freq gurled (8) - 10 freq gable-end (8) - 1 freq 'friend (8) - 1 freq |
SoundEx code - G641 girlfriend - 18 freq girlfriend's - 2 freq girlfrien - 1 freq girlfreend - 4 freq girlfiend - 1 freq girlfriends - 1 freq girlfreins - 1 freq grillaberdeen - 1 freq 'girlfriend - 1 freq girlfreen - 1 freq |
MetaPhone code - JRLFRNT girlfriend - 18 freq girlfreend - 4 freq 'girlfriend - 1 freq |
GIRLFREEND freen - 220 freq friend - 87 freq freens - 241 freq friends - 79 freq freends - 181 freq freend - 153 freq freendly - 36 freq freenship - 14 freq freendship - 15 freq freenly - 22 freq freen's - 10 freq girlfreend - 4 freq freen' - 2 freq unfreends - 3 freq freends-and-faimly - 2 freq freendlie - 3 freq freendlier - 2 freq freenships - 3 freq befreendit - 1 freq |
| Time to execute Levenshtein function - 0.228764 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.381983 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.027921 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.001001 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. |