| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gregjkerr (0) - 4 freq gregjames (4) - 1 freq greener (4) - 12 freq breaker (4) - 4 freq gregory (4) - 9 freq brekkers (4) - 1 freq greater (4) - 20 freq greasier (4) - 1 freq gregor (4) - 7 freq grey-derk (4) - 1 freq greter (4) - 1 freq greer (4) - 6 freq greenery (4) - 7 freq greyer (4) - 1 freq geggery (4) - 1 freq brekker (4) - 2 freq breakers (4) - 2 freq gretter (4) - 2 freq greiter (4) - 1 freq gleghke (4) - 1 freq gregoire (4) - 1 freq glegger (4) - 2 freq geekery (4) - 1 freq cretther (5) - 1 freq reuters (5) - 6 freq |
gregjkerr (0) - 4 freq gregor (7) - 7 freq gregory (7) - 9 freq gregoire (7) - 1 freq gregjames (7) - 1 freq ggrr (8) - 1 freq grrrrrr (8) - 1 freq gregorian (8) - 2 freq grigory (8) - 2 freq glegger (8) - 2 freq breaker (8) - 4 freq gregoria (8) - 1 freq grogipher (8) - 1 freq barrykerr (8) - 1 freq braegarr (8) - 2 freq registrar (8) - 2 freq grrr (8) - 2 freq greghunter (8) - 1 freq gleghke (8) - 1 freq geekery (8) - 1 freq grey-derk (8) - 1 freq greter (8) - 1 freq greener (8) - 12 freq greasier (8) - 1 freq brekkers (8) - 1 freq |
SoundEx code - G626 gregorian - 2 freq grocer - 3 freq grey-gorred - 1 freq grocers - 3 freq grocer's - 5 freq gregory - 9 freq gray-green - 1 freq gregory's - 1 freq groceries - 2 freq gressroots - 5 freq groazirs - 1 freq gear-crinchin - 1 freq groceries' - 1 freq grocerman - 1 freq grocery's - 1 freq greasier - 1 freq grossars - 1 freq grocery - 4 freq gregoire - 1 freq grégoire - 1 freq gress-green - 1 freq grassroots - 43 freq grigory - 2 freq gressruits - 2 freq €˜groceries - 1 freq girseruits - 1 freq graysartschool - 1 freq gregorhepburn - 8 freq grasser - 1 freq gregor - 7 freq grazer - 1 freq grazzar - 1 freq gregoria - 1 freq garyshearer - 31 freq gregjkerr - 4 freq |
MetaPhone code - KRKJKR gregjkerr - 4 freq |
GREGJKERR |
| Time to execute Levenshtein function - 0.203590 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.372119 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.030971 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.040227 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.001103 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. |