Abstract

Two methods are given for converting grammars belonging to different systems. One converts a simple (context-free) phrase structure grammar (SPG) 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call