| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| geordietta (0) - 17 freq geordies (3) - 4 freq geordie (3) - 373 freq geordie's (3) - 31 freq geordie' (3) - 4 freq 'geordie's (4) - 1 freq gordie (4) - 1 freq georgie (4) - 2 freq georgina (4) - 2 freq geordic (4) - 1 freq vendetta (4) - 1 freq eordie (4) - 1 freq serviette (4) - 1 freq beeriett (4) - 2 freq 'geordie (4) - 8 freq geodie (4) - 1 freq georgia (4) - 6 freq recordit (5) - 27 freq beiriet (5) - 3 freq gloried (5) - 1 freq goriot (5) - 1 freq ferriet (5) - 1 freq geerie (5) - 1 freq guardiantv (5) - 1 freq biretta (5) - 1 freq |
geordietta (0) - 17 freq geordie' (5) - 4 freq geordie's (5) - 31 freq geordies (5) - 4 freq geordie (5) - 373 freq guardit (6) - 1 freq greitt (6) - 1 freq grett (6) - 34 freq beeriett (6) - 2 freq gairdit (6) - 6 freq gradient (6) - 1 freq serviette (6) - 1 freq gordie (6) - 1 freq geordic (6) - 1 freq gritty (6) - 5 freq vendetta (6) - 1 freq gritt (6) - 1 freq forgett (7) - 1 freq gerda (7) - 4 freq weirdest (7) - 2 freq corbitt (7) - 1 freq gertie (7) - 39 freq gerdin (7) - 2 freq geordo (7) - 4 freq gorbilt (7) - 1 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 |
GEORDIETTA |
| Time to execute Levenshtein function - 0.434152 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.854924 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.028497 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.093458 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.000946 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. |