Jurgen Wedekind

Also published as: Jürgen Wedekind


2020

pdf bib
Tractable Lexical-Functional Grammar
Jürgen Wedekind | Ronald M. Kaplan
Computational Linguistics, Volume 46, Issue 3 - September 2020

The formalism for Lexical-Functional Grammar (LFG) was introduced in the 1980s as one of the first constraint-based grammatical formalisms for natural language. It has led to substantial contributions to the linguistic literature and to the construction of large-scale descriptions of particular languages. Investigations of its mathematical properties have shown that, without further restrictions, the recognition, emptiness, and generation problems are undecidable, and that they are intractable in the worst case even with commonly applied restrictions. However, grammars of real languages appear not to invoke the full expressive power of the formalism, as indicated by the fact that algorithms and implementations for recognition and generation have been developed that run—even for broad-coverage grammars—in typically polynomial time. This article formalizes some restrictions on the notation and its interpretation that are compatible with conventions and principles that have been implicit or informally stated in linguistic theory. We show that LFG grammars that respect these restrictions, while still suitable for the description of natural languages, are equivalent to linear context-free rewriting systems and allow for tractable computation.

pdf bib
KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion
Manex Agirrezabal | Jürgen Wedekind
Proceedings of the 17th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology

We present a model for the unsupervised dis- covery of morphological paradigms. The goal of this model is to induce morphological paradigms from the bible (raw text) and a list of lemmas. We have created a model that splits each lemma in a stem and a suffix, and then we try to create a plausible suffix list by con- sidering lemma pairs. Our model was not able to outperform the official baseline, and there is still room for improvement, but we believe that the ideas presented here are worth considering.

2014

pdf bib
Squibs: On the Universal Generation Problem for Unification Grammars
Jürgen Wedekind
Computational Linguistics, Volume 40, Issue 3 - September 2014

2012

pdf bib
LFG Generation by Grammar Specialization
Jürgen Wedekind | Ronald M. Kaplan
Computational Linguistics, Volume 38, Issue 4 - December 2012

pdf bib
Creation and use of Language Resources in a Question-Answering eHealth System
Ulrich Andersen | Anna Braasch | Lina Henriksen | Csaba Huszka | Anders Johannsen | Lars Kayser | Bente Maegaard | Ole Norgaard | Stefan Schulz | Jürgen Wedekind
Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC'12)

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 medical knowledge consists partly of the terminology database SNOMED CT and partly of authorized medical texts on the domain. The system will allow users to ask questions in Danish and will provide natural language answers. Currently, the project is pursuing three basically different methods for question answering, and they are all described to some extent in this paper. A system prototype will handle questions related to diabetes and heart diseases. This paper concentrates on the methods employed for question answering and the language resources that are utilized. Some resources were existing, such as SNOMED CT, others, such as a corpus of sample questions, have had to be created or constructed.

2000

pdf bib
LFG Generation Produces Context-free Languages
Ronald M. Kaplan | Jurgen Wedekind
COLING 2000 Volume 1: The 18th International Conference on Computational Linguistics

1999

pdf bib
Semantic-driven Generation with LFG- and PATR-style Grammars
Jürgen Wedekind
Computational Linguistics, Volume 25, Number 2, June 1999

1996

pdf bib
On Inference-Based Procedures for Lexical Disambiguation
Jurgen Wedekind
COLING 1996 Volume 2: The 16th International Conference on Computational Linguistics

pdf bib
Ambiguity-preserving Generation with LFG- and PATR-style Grammars
Jurgen Wedekind | Ronald M. Kaplan
Computational Linguistics, Volume 22, Number 4, December 1996

1995

pdf bib
Some Remarks on the Decidability of the Generation Problem in LFG- and PATR-Style Unification Grammars
Jurgen Wedekind
Seventh Conference of the European Chapter of the Association for Computational Linguistics

1993

pdf bib
Type-Driven Semantic Interpretation of f-Structures
Jurgen Wedekind | Ronald M. Kaplan
Sixth Conference of the European Chapter of the Association for Computational Linguistics

1991

pdf bib
Classical Logics for Attribute-Value Languages
Jurgen Wedekind
Fifth Conference of the European Chapter of the Association for Computational Linguistics

1989

pdf bib
Translation by Structural Correspondences
Ronald M. Kaplan | Klaus Netter | Jurgen Wedekind | Annie Zaenen
Fourth Conference of the European Chapter of the Association for Computational Linguistics

1988

pdf bib
Generation as Structure Driven Derivation
Jurgen Wedekind
Coling Budapest 1988 Volume 2: International Conference on Computational Linguistics

1986

pdf bib
A Concept of Derivation for LFG
Jurgen Wedekind
Coling 1986 Volume 1: The 11th International Conference on Computational Linguistics