Jürgen Wedekind

Learn More
We sketch and illustrate an approach to machine translation that exploits the potential of simultaneous correspondences between separate levels of linguistic representation, as formalized in the LFG notion of codescriptions. The approach is illustrated with examples from English, German and French where the source and the target language sentence show(More)
This paper describes two algorithms which construct two different types of generators for lexical functional grammars (LFGs). The first type generates sentences from functional structures and the second from semantic structures. The latter works on the basis of extended LFGs, which contain a mapping from f-structures into semantic structures. Both(More)
ESICT (Experience-oriented Sharing of health knowledge via Information and Communication Technology) is an ongoing research project funded by the Danish Council for Strategic Research. It aims at developing a health/disease related information system based on information technology, language technology, and formalized medical knowledge. The formalized(More)
To find an appropriate utterance for a semantic representation is a problem normally treated in the domain of (tactical) natural language generation., this problem turns out to be a formal problem of the underlying grammar formalism, when the mapping between strings and semantic representations is defined by the grammar. Semantic representations are then(More)
The widespread ambiguity of natural language presents a particular challenge for machine translation. The translation of an ambiguous source sentence may depend on first determining which reading of the sentence is contextually appropriate and then producing a target sentence that accurately expresses that reading. This may be difficult or even impossible(More)
In this paper, we prove the decidability of the generation problem for those unification grammars which are based on context-free phrase structure rule skeletons, like e.g. LFG and PATR-II. The result shows a perhaps unexpected asymmetry, since it is valid also for those unification grammars whose parsing problem is undecidable, e.g. grammars which do not(More)