A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
A General Computational Method for Grammar Inversion
[chapter]
1994
Reversible Grammar in Natural Language Processing
A reversible grammar is usually understood as a computational or linguistic system that can be used both for analysis ~nd generation of the language it defines. For example, a directive pars_gen (Sent,For~n) would assign, depending upon the binding status Of its arguments, the representation in (Toronto,chased (Fido,John )) to the sentence Fido chased John in To~onto, or it would produce one of the several possib!e paraphrases of this sentence given its represen~tion. Building such
doi:10.1007/978-1-4615-2722-0_8
fatcat:dvqb2e7dgrh4npa452q5kfycv4