Graph e

1.3 Morpheme alternation

Morphemes can be categorized by its grammatical role, the structures of the morpheme graph and its signifié. The morpheme alternation is done based on this categorization: a morpheme can be alternated with another morpheme which belongs to the same category. This categorization can be represented by labeling the nodes of the morpheme graph. The morpheme alternation is executed according to a certain algorithm based on the graph structure. For example, a sentence ʻWe saw a blue birdʼ can be generated using the directed edges used in generating the sentence ʻI saw a yellow houseʼ.
The following is the flow of the processing in the morpheme alternation.
1. The nodes of the morpheme graph are labelled by a certain algorithm.
2. After the selection of the morphemes which shall construct the sentence, the existence of the path that includes the whole nodes will be checked.
3. If a such path does not exist, search an alternate node which has the same label as the node to which no edges are directed.
4. The sentence generation follows the structure of the graph of the alternate node; and it continues its processing.
This processing can be executed continuously.

1.4 An example of morpheme graph

 The following graph is a subgraph of a morpheme graph of a language.   
Graph f