This paper present a rule based pronunciaton generator for bangla words. It takes a words and finds the pronunciations for the graphemes of the word. A grapheme is a unit in writing that cannot be analyzed into smaller components. Resolving the pronunciation of a polyphone grapheme(i.e grapheme that generates more than one phoneme) is the major hurdle that the automated pronunciation generator (APG) encounters. Bangla is partially phonetic in nature, thus we can define rules to handle most of the cases. besides, up till now we lack a balanced corpus which could be used for a statistical pronunciation generator. As a result, for the time being a rule-based approach towards implementing the APG for banglaturnsn out to be effocient.