| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| garrottit (0) - 1 freq parrotit (2) - 1 freq garrotted (2) - 1 freq targettit (3) - 1 freq arrestit (3) - 7 freq barfittit (3) - 1 freq garrot (3) - 1 freq afrrontit (3) - 1 freq garritted (3) - 1 freq rottit (3) - 9 freq trottit (3) - 4 freq grottie (3) - 1 freq ratrettit (3) - 1 freq garotte (3) - 1 freq narratit (3) - 1 freq targetit (4) - 1 freq arrayit (4) - 2 freq raportit (4) - 2 freq catwittit (4) - 1 freq grointit (4) - 3 freq harrit (4) - 1 freq harrouis (4) - 1 freq arreistit (4) - 6 freq warstit (4) - 1 freq gropit (4) - 1 freq |
garrottit (0) - 1 freq garrotted (3) - 1 freq garritted (4) - 1 freq parrotit (4) - 1 freq trottit (5) - 4 freq ratrettit (5) - 1 freq narratit (5) - 1 freq rottit (5) - 9 freq garotte (5) - 1 freq grottie (5) - 1 freq afrrontit (5) - 1 freq arrestit (5) - 7 freq barfittit (5) - 1 freq targettit (5) - 1 freq garrot (5) - 1 freq garret (6) - 4 freq barrett (6) - 1 freq grantit (6) - 30 freq ruttit (6) - 3 freq grotty (6) - 1 freq permittit (6) - 1 freq groattie (6) - 1 freq greittin (6) - 2 freq grittin (6) - 3 freq gluttit (6) - 1 freq |
SoundEx code - G633 guairdit - 6 freq greeted - 28 freq graithed - 12 freq gairdit - 6 freq greetit - 10 freq graduate - 11 freq gairded - 3 freq gratitude - 16 freq guarded - 2 freq garrottit - 1 freq gratetul - 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 - KRTT guairdit - 6 freq credit - 111 freq crowdit - 7 freq coortit - 5 freq croudit - 4 freq creatit - 34 freq greeted - 28 freq cairtit - 11 freq gairdit - 6 freq creaatit - 1 freq greetit - 10 freq cordite - 2 freq graduate - 11 freq crowded - 14 freq croodit - 17 freq created - 27 freq gairded - 3 freq coorted - 2 freq crowdid - 1 freq guarded - 2 freq garrottit - 1 freq quartet - 2 freq crooded - 9 freq gritted - 3 freq corroded - 4 freq cairted - 5 freq crowdet - 2 freq gratet - 1 freq creautit - 2 freq carotid - 1 freq guardit - 1 freq greitit - 1 freq kerted - 1 freq guairded - 3 freq garritted - 1 freq courtit - 1 freq graded - 3 freq garrotted - 1 freq graddad - 1 freq credite - 2 freq creedit - 1 freq carted - 2 freq co-airtit - 1 freq guerded - 1 freq grated - 1 freq gordaidh - 3 freq curatit - 1 freq curated - 1 freq |
GARROTTIT |
| Time to execute Levenshtein function - 0.220523 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.410604 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.028252 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.038333 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.000960 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. |