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)
1 I n t r o d u c t i o n Using the same grammar formalism, or even the same grammar, for both analysis and synthesis is usually regarded as an elegant, efficient and sometimes even as the psychologically most plausible approach to natural language parsing and generation. In this paper we want to show tha t this approach can be realized within the(More)
The ScandSum research network (ScandSum 2003) has helped coordinate Nordic research on summarization, especially for the Scandinavian languages. Such a research effort was badly needed, since at present there is a lack of usable tools for summarization targeted at those languages. In today’s information society, the overflow of textual information,(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)
This paper describes a classical logic for attribute-value (or feature description) languages which ate used in urfification grammar to describe a certain kind of linguistic object commonly called attribute-value structure (or feature structure). Tile algorithm which is used for deciding satisfiability of a feature description is based on a restricted(More)
To find an appropriate utterance for a semantic representation is a problem normally treated in the domain of (tactical) natural language generation. For unification-based approaches, like LFG, PATR, or HPSG (Kaplan and Bresnan 1982; Shieber et al. 1983; Pollard and Sag 1994), this problem turns out to be a formal problem of the underlying grammar(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 contextfree 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)