A Concept of Derivation for LFG. - Jürgen Wedekind (COLING, 1986)

Generation as structure driven derivation. - Jürgen Wedekind (COLING, 1988)

Translation By Structural Correspondences. - Ronald M. Kaplan; Klaus Netter; Jürgen Wedekind; Annie Zaenen (EACL, 1989)

Classical Logics For Attribute-Value Languages. - Jürgen Wedekind (EACL, 1991)

Restriction and Correspondence-based Translation. - Ronald M. Kaplan; Jürgen Wedekind (EACL, 1993)

Type-Driven Semantic Interpretation of f-Structures. - Jürgen Wedekind; Ronald M. Kaplan (EACL, 1993)

Some Remarks on the Decidability of the Generation Problem in LFG- and PATR-Style Unification Grammars. - Jürgen Wedekind (EACL, 1995)

On Inference-Based Procedures for Lexical Disambiguation. - Jürgen Wedekind (COLING, 1996)

Ambiguity-preserving Generation with LFG- and PATR-style Grammars. - Jürgen Wedekind; Ronald M. Kaplan (Comput. Linguistics, 1996)

Semantic-driven Generation with LFG- and PATR-style Grammars. - Jürgen Wedekind (Comput. Linguistics, 1999)

LFG Generation Produces Context-free Languages. - Ronald M. Kaplan; Jürgen Wedekind (COLING, 2000)

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 001; Jürgen Wedekind (LREC, 2012)

LFG Generation by Grammar Specialization. - Jürgen Wedekind; Ronald M. Kaplan (Comput. Linguistics, 2012)

On the Universal Generation Problem for Unification Grammars. - Jürgen Wedekind (Comput. Linguistics, 2014)

Towards the Automatic Classification of Speech Subjects in the Danish Parliament Corpus. - Dorte Haltrup Hansen; Costanza Navarretta; Lene Offersgaard; Jürgen Wedekind (DHN, 2019)

KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion. - Manex Agirrezabal; Jürgen Wedekind (SIGMORPHON, 2020)

Tractable Lexical-Functional Grammar. - Jürgen Wedekind; Ronald M. Kaplan (Comput. Linguistics, 2020)

LFG Generation from Acyclic F-Structures is NP-Hard. - Jürgen Wedekind; Ronald M. Kaplan (Comput. Linguistics, 2021)