There are many English names that follow a similar pattern: consonant, vowel, double consonant, vowel, double consonant. For instance, Bennett, Garrett, Doggett, Carroll, Farrell, Bissell etc. Most of these names seem to end in double t or double l. Now since I’m an algorithmist, naturally, I want to apply this algorithm to all other letters of the alphabet to come up with hypothetical names that no one has ever thought of yet. Then maybe I could patent those names and sell them to people who were in search of a reasonable sounding but unique English name. For instance, let us take the name Carroll and retain the double r and double l. Now we work our way down the alphabet as follows:
Now you can see we could do this more systematically going through every vowel for the second letter. The second vowel wouldn’t matter as much since any old vowel would be pronounced pretty much the same. Even a “y” would work as in Merryll Streep? Except her name ends in only one “l.” Too bad. This gives you an idea how a naming algorithm would work.
Back to Home Page