Ambiguity-preserving generation with LFG-and PATR-style grammars

As ambiguity-preserving translations of the type John saw the man with the telescope & its German equivalent Hans sah den Mann mit dem Fernrohr relieve a machine translation procedure of the costly process of disambiguation, the possibility of deciding whether an ambiguity-preserving equivalent...

Full description

Saved in:
Bibliographic Details
Published in:Computational linguistics - Association for Computational Linguistics 1996-12, Vol.22 (4), p.555-558
Main Authors: WEDEKIND, J, KAPLAN, R. M
Format: Article
Language:English
Subjects:
Applied linguistics
Computational linguistics
Linguistics
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:As ambiguity-preserving translations of the type John saw the man with the telescope & its German equivalent Hans sah den Mann mit dem Fernrohr relieve a machine translation procedure of the costly process of disambiguation, the possibility of deciding whether an ambiguity-preserving equivalent exists in the target language is investigated with respect to unification grammars of the lexical functional grammar type, where a binary relation is defined between feature structures & terminal strings. A formal proof shows that for an arbitrary set of feature structures it is undecidable whether a terminal string can be derived. 4 References. J. Hitchcock
ISSN:0891-2017
1530-9312