| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| girlfreins (0) - 1 freq girlfreen (2) - 1 freq girlfreend (2) - 4 freq girlfriends (3) - 1 freq girlfiend (3) - 1 freq girlfrien (3) - 1 freq girlfriend (3) - 18 freq wilfred's (4) - 1 freq githerins (4) - 1 freq birlins (4) - 1 freq greins (4) - 1 freq illdeeins (4) - 1 freq 'girlfriend (4) - 1 freq freins (4) - 45 freq girlfriend's (4) - 2 freq garrins (4) - 1 freq giraffes (4) - 3 freq refrains (4) - 1 freq yirlins (4) - 1 freq gillgreeny (4) - 1 freq mirrens (4) - 1 freq girseruits (4) - 1 freq yiblins (5) - 1 freq gillians (5) - 1 freq orleans (5) - 5 freq |
girlfreins (0) - 1 freq girlfreend (3) - 4 freq girlfreen (3) - 1 freq girlfrien (4) - 1 freq girlfriends (4) - 1 freq girlfriend (4) - 18 freq girlfiend (5) - 1 freq girlfriend's (6) - 2 freq refrains (6) - 1 freq 'girlfriend (6) - 1 freq garrins (6) - 1 freq yirlins (7) - 1 freq gillgreeny (7) - 1 freq mirrens (7) - 1 freq golfers (7) - 2 freq githerins (7) - 1 freq girseruits (7) - 1 freq giraffes (7) - 3 freq freins (7) - 45 freq birlins (7) - 1 freq greins (7) - 1 freq glares (8) - 8 freq gaitherins (8) - 13 freq herrins (8) - 2 freq earrins (8) - 2 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 - JRLFRNS girlfreins - 1 freq |
GIRLFREINS |
| Time to execute Levenshtein function - 0.994816 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 - 1.815306 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.183929 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.109113 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.000926 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. |