Paper: A Context-Free Grammar Of French

ACL ID C80-1007
Title A Context-Free Grammar Of French
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1980

The CF grammar I have proposed contains the information that establishes relationships between sentences, but it does not contain the operations or the metalinguistic assertions that make the transformation explicit. By a small extension of the CF framework I can also obtain the equivalent of a transformation, as follows. As an example, I consider the passive transformation. The passive transformation consists in matching an active phrase with its passive counterpart. part. The statement of the transformation can stop there, as does Harris 'I~, or one can add the specification of the computer operations needed to create the active and passive trees, as in generative grammar. In the CF grammar presented here, I have two independent rules, one for the active form, and another for the passive...