Abstract
While unification grammars have been in existence for some time and have given birth to grammar formalisms such as Generalized Phrase Structure Grammar (GPSG), it is only recently that computational tools such as Prolog Definite Clause Grammars (DCG) have allowed direct implementation of such grammars on personal computers. A very promising new formalism Referent Grammar is an outgrowth of these events. Referent Grammar (RG) is a sub‐class of GPSG which can be directly implemented in Prolog DCG and provides weak generative power at least equal to GPSG. This paper describes the Referent Grammar formalism and the research MT system developed using RG and anaphoric pronoun resolution extensions to RG. It also describes plans for combining sublanguage analysis with RG.
Sign-in/Register to access full text options 
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
