Thou hath always asked me, “O Mighty Shriram, wherefore doth thou beckon thy doggo with different names each day?”. Well there is a certain format to generating these names and indeed an algorithm which can list out all those names. The format specifies that a valid name for stewie shall consist of consonant + accessory consonant + vowel + bridging consonant + ‘y’(phonetic alphabet \i\ ).

All names that are not mentioned in these 1500 names are invalid and can only be made valid by permission on yours trule.

Namelist dump:

You can check out the generator implemented in c++ here:

this snippet shows each part of the names:

  std::vector<std::string>conso = { "p","b","m","t","d","n","k","g","f","s","j","sh","ch","h","" };
	std::vector<std::string>mixable = { "","r","l","w","y" };
	std::vector<std::string>vowel = { "a","e","i","o","u" };
	std::vector<std::string>tail = { "mb","mp","bb","pp" };

Finally, we can calculate that there are in total 15 x 5 x 5 x 4 valid names that can be generated.

Hope this helps, ciao ciao!