| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| girlfrien (0) - 1 freq girlfreen (1) - 1 freq girlfriend (1) - 18 freq girlfriends (2) - 1 freq girlfreend (2) - 4 freq girlfiend (2) - 1 freq 'girlfriend (2) - 1 freq girlie (3) - 5 freq girlfreins (3) - 1 freq girlfriend's (3) - 2 freq girnie (4) - 3 freq tirlin (4) - 13 freq giftie (4) - 8 freq tirrin (4) - 3 freq giowerin (4) - 1 freq gollerin (4) - 6 freq airlie (4) - 47 freq gurrie (4) - 1 freq pirlie (4) - 1 freq mirren (4) - 144 freq wirrie (4) - 6 freq girnin (4) - 73 freq girkin (4) - 1 freq girdin (4) - 2 freq frien (4) - 61 freq |
girlfrien (0) - 1 freq girlfreen (1) - 1 freq girlfriend (2) - 18 freq girlfreend (3) - 4 freq girlfreins (4) - 1 freq 'girlfriend (4) - 1 freq girlfiend (4) - 1 freq girlfriends (4) - 1 freq gurlin (6) - 4 freq gurrin (6) - 1 freq garrin (6) - 35 freq gollerin (6) - 6 freq gillgreeny (6) - 1 freq golfin (6) - 2 freq graftin (6) - 6 freq glarin (6) - 7 freq girlie (6) - 5 freq girlfriend's (6) - 2 freq glories (7) - 9 freq gregorian (7) - 2 freq giftin (7) - 2 freq pirlin (7) - 8 freq wilfred (7) - 12 freq gilpin (7) - 1 freq girsin (7) - 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 - JRLFRN girlfrien - 1 freq girlfreen - 1 freq |
GIRLFRIEN |
| Time to execute Levenshtein function - 0.283317 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.427135 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.035127 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.050051 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.001035 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. |