| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| girsle (0) - 2 freq hirsle (1) - 3 freq birsle (1) - 1 freq girse (1) - 89 freq girssle (1) - 1 freq girdle (1) - 15 freq gorble (2) - 2 freq girss (2) - 16 freq girssy (2) - 3 freq girsy (2) - 1 freq birssle (2) - 2 freq kirtle (2) - 2 freq girsin (2) - 1 freq girssie (2) - 2 freq girs (2) - 4 freq gibble (2) - 1 freq girl' (2) - 1 freq isle (2) - 85 freq girl (2) - 76 freq tirse (2) - 3 freq girls (2) - 59 freq girlw (2) - 1 freq gurgle (2) - 2 freq girzie (2) - 2 freq birslet (2) - 1 freq |
girsle (0) - 2 freq girssle (2) - 1 freq girse (2) - 89 freq girdle (2) - 15 freq birsle (2) - 1 freq hirsle (2) - 3 freq gurgle (3) - 2 freq gorse (3) - 6 freq girst (3) - 2 freq warsle (3) - 24 freq gisli (3) - 6 freq gargle (3) - 3 freq gerse (3) - 2 freq girly (3) - 1 freq girlie (3) - 5 freq girsey (3) - 2 freq grisly (3) - 4 freq girl (3) - 76 freq girsy (3) - 1 freq girssy (3) - 3 freq girss (3) - 16 freq gorble (3) - 2 freq girssie (3) - 2 freq girsin (3) - 1 freq girs (3) - 4 freq |
SoundEx code - G624 gargles - 1 freq girsle - 2 freq grizzle-beardit - 1 freq grisly - 4 freq gurgled - 3 freq graeco-latin - 1 freq grizel - 15 freq grizel's - 2 freq grizzle - 2 freq grey-cowled - 1 freq garglin - 2 freq groozle - 2 freq groozled - 2 freq groozlin - 1 freq grizzly - 1 freq garishly - 1 freq grizzlin - 1 freq grass-clamped - 1 freq gurglin - 1 freq gurgle - 2 freq gracielie - 2 freq girselowper - 1 freq girssle - 1 freq graisly - 1 freq graceless - 2 freq gresslowpers - 1 freq grissly - 1 freq gracelan - 4 freq grouzilt - 1 freq graizled - 1 freq grouzlin - 1 freq grizelle - 1 freq gargle - 3 freq grossly - 1 freq grassland - 3 freq grizzled - 1 freq gargoyles - 2 freq grizeldagloop - 1 freq grxl - 1 freq greggwylde - 1 freq georgeaylett - 1 freq gurggles - 1 freq goreglen - 2 freq gerriisalsogigi - 1 freq |
MetaPhone code - JRSL girsle - 2 freq girssle - 1 freq |
GIRSLE |
| Time to execute Levenshtein function - 0.190626 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.370111 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.028180 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.038219 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.000868 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. |