The normal method for representing anaphoric dependencies in Unification Based grammar formalisms is that of re-entrance. In this paper, we address the problems that this representational device poses when such formalisms are used for translation. We demonstrate the inadequacies of existing proposals, and describe an approach which exploits the expressive possibilities of the equational constraint language in LFG and involves an inferential procedure combining underspecification in the statement of bilingual correspondences with the use of target language knowledge.
['Louisa Sadler', 'Doug Arnold']
A constraint-based approach to translating anaphoric dependencies