Dependency syntax analysis using grammar induction and a lexical categories precedence system
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
| Hi-index | 0.00 |
Two methods are given for converting grammars belonging to different systems. One converts a šimple (context-free) phrase structure grammar (ŠPG) into a corresponding dependency grammar (DG); the other converts a DG into a corresponding SPG. The structures assigned to a string by a source grammar will correspond systematically, though a symmetrically, to those assigned by the target grammar resulting from its conversion. Since both systems are weakly equivalent, generating exactly the CF languages, the methods facilitate experimentation with either notation in devising rules for any CF language or any CF set of strings designed to undergo subsequent transformation.