Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Computational understanding: analysis of sentences and context.
Computational understanding: analysis of sentences and context.
| Hi-index | 0.00 |
String grammars have been found in many ways inadequate for parsing inflectional languages with "free" word order. To overcome these problems we have replaced linear string grammars and tree transformations by their multidimensional generalization, graph grammars. In our approach parsing is seen as a transformation between two graph languages, namely the sets of morphological and semantic representations of natural language sentences. An experimental Finnish question-answering system SUVI based on graph grammars has been implemented. In SUVI the role of individual words is active. Each word is associated to a syntactico-senantic constituent type that is represented by a transition network - like graph whose transitions correspond to transformations in the derivation graph. Parsing is performed by interpreting the constituent type graphs corresponding to the words of the current sentence.