<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></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.

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

Computer Science Department, University of Craiova, Romania, 200585 Craiova, Alexandru Ioan Cuza, 13

Computer Science Department University of Craiova Romania, 200585 Craiova, Alexandru Ioan Cuza, 13

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

The concept of labeled stratified graph (LSG) introduces some method of knowledge representation. The inference process developed for this structures uses the...

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

Publié en ligne: 20 oct. 2015

Pages: 57 - 68

Reçu: 01 janv. 2014

Accepté: 01 mars 2014

DOI: https://doi.org/10.2478/auom-2014-0031

Mots clés
Peano algebra, labeled graph, stratified graph, structured path, accepted structured path, inference process, natural language generation

© 2014 Dana Dănciulescu et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

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

Publié en ligne: 20 oct. 2015

Pages: 57 - 68

Reçu: 01 janv. 2014

Accepté: 01 mars 2014

DOI: https://doi.org/10.2478/auom-2014-0031

Mots clésPeano algebra, labeled graph, stratified graph, structured path, accepted structured path, inference process, natural language generation

© 2014 Dana Dănciulescu et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Mots clés
Peano algebra, labeled graph, stratified graph, structured path, accepted structured path, inference process, natural language generation