Splitting the structured paths in stratified graphs. Application in Natural Language Generation

Abstract

The concept of labeled stratified graph (LSG) introduces some method of knowledge representation. The inference process developed for this structures uses the paths of the stratified graphs, an order between the elementary arcs of a path and some results of universal algebras. The order is defined by considering a structured path instead of a regular path. The application described in this paper interprets the symbolic elements of a LSG with natural language constructions. In this manner we obtained a mechanism for generation coherent texts in a natural language (for this approach, Romanian). The generation method is based on labeled stratified graph representation and the inference mechanism is guided by the structured paths of these representations.

Keywords

• peano algebra
• labeled graph
• stratified graph
• structured path
• accepted structured path
• inference process
• natural language generation
• primary 08a55
• secondary 68w30