| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| girded (0) - 1 freq girder (1) - 2 freq girned (1) - 33 freq yirded (1) - 4 freq gairded (1) - 3 freq gilded (1) - 3 freq dirded (1) - 1 freq hirded (1) - 1 freq tired (2) - 98 freq birsed (2) - 5 freq girders (2) - 12 freq guairded (2) - 3 freq birzed (2) - 5 freq hired (2) - 27 freq gi'ed (2) - 2 freq girner (2) - 1 freq gurred (2) - 8 freq airmed (2) - 21 freq gelded (2) - 1 freq guarded (2) - 2 freq garden (2) - 67 freq mirled (2) - 2 freq grued (2) - 8 freq sired (2) - 2 freq gissed (2) - 1 freq |
girded (0) - 1 freq gairded (1) - 3 freq guerded (2) - 1 freq guairded (2) - 3 freq hirded (2) - 1 freq guarded (2) - 2 freq graded (2) - 3 freq dirded (2) - 1 freq girned (2) - 33 freq girder (2) - 2 freq yirded (2) - 4 freq gilded (2) - 3 freq gorged (3) - 2 freq worded (3) - 1 freq greed (3) - 58 freq goaded (3) - 1 freq gried (3) - 8 freq guirden (3) - 1 freq gred (3) - 2 freq gird (3) - 48 freq garred (3) - 22 freq gerden (3) - 4 freq gurged (3) - 1 freq girdin (3) - 2 freq girds (3) - 5 freq |
SoundEx code - G633 guairdit - 6 freq greeted - 27 freq graithed - 12 freq gairdit - 6 freq greetit - 10 freq graduate - 11 freq gairded - 3 freq gratitude - 13 freq guarded - 2 freq garrottit - 1 freq gritted - 3 freq graduated - 2 freq gratet - 1 freq geordietta - 17 freq gyrated - 1 freq graduates - 3 freq guardit - 1 freq graduation - 2 freq garthdee - 7 freq greitit - 1 freq graduatin - 2 freq girded - 1 freq gradyooit - 2 freq guairded - 3 freq garritted - 1 freq gradations - 1 freq graded - 3 freq garrotted - 1 freq gratiteid - 2 freq graddad - 1 freq grey-heidit - 1 freq graduatit - 1 freq gratiteed - 1 freq guerded - 1 freq grated - 1 freq graduating - 1 freq gordaidh - 3 freq gerrydotp - 1 freq geordiedentist - 1 freq |
MetaPhone code - JRTT geordietta - 17 freq gyrated - 1 freq girded - 1 freq |
GIRDED |
| Time to execute Levenshtein function - 0.193080 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.349030 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.032067 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.042549 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.000783 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. |