A Map from Entrys to lists of possible pronunciations (Phones), serving as our representation of the CMU Pronouncing Dictionary

Represents an entry word in the cmu pronouncing dictionary (simply an alias for Text to improve type specificity and readability

Represents a string containing the phonetic breakdown of a word, in a similar manner to the EntryWord type

Type alias for a stress pattern, which is a list of integers 0-2 indicating stress.

• 0 -> unstressed
• 1 -> primary stress
• 2 -> secondary stress

We are using the List monad inside the ReaderT monad to perform nondeterministic computations (due to the possibility of multiple Phones patterns per Entry) in the context of the CMU dictionary without having to pass it as an argument to every function.

Contruct a Dictionary Computation based on a selector function on the CMUdict that returns a list of possible results. This is just a synonym for the ReaderT constructor.

Get the possible values resulting from a series of Dictionary Computations by supplying the dictionary to the computation. This is just runReaderT.

Initializes the cmu pronunctiation dictionary into our program, given an optional file name of the dictionary

Default settings for initDict

Options for the initial source of the CMUDict. Currently, we can either parse from plaintext file or load preprocessed binary

Look up the pronunciation (list of possible phones) of a word in the dictionary

Gives the stress pattern for a given word in the dictionary

Strips the stress-indicating numbers off of a phones

Isolates the stress pattern from a sequence of phones

Gives the syllable count of a given pronunciation

A Dictionary Computation that returns a list of all the entry words in the CMUdict

A Dictionary Computation that returns a list of all the lists of phones in the CMUdict

A Dictionary Computation that returns a list of all the (key,value) pairs in the CMUdict@

A class that provides a generalized function filterDict for filtering the CMUdict based on a choice of different "fields"

Filter a the results of a DictComp, taking only those whose corresponing entries conform to the selector function

Given a sequence of phones, find all words that contain that sequence of phones

Given a stress pattern, find all words that satisfy that pattern

Finds the rhyming part of the given phones, where the rhyming part is defined as everything in a word after and including the last stressed or semistressed phone. Note that this is merely one interpretation of what constitutes a rhyme. There exist both stricter and looser definitions that may be suited to different purposes.

Given a function that tells whether or not two sets of phones rhyme, and an entry, find all words that rhyme with that entry according to the provided definition of a rhyme

Given a word, finds all other words that rhyme with it, using the default rhymingPart definition