![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Jürgen Wedekind
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j6]Jürgen Wedekind, Ronald M. Kaplan:
LFG Generation from Acyclic F-Structures is NP-Hard. Comput. Linguistics 47(4): 939-946 (2021) - 2020
- [j5]Jürgen Wedekind, Ronald M. Kaplan:
Tractable Lexical-Functional Grammar. Comput. Linguistics 46(3): 515-569 (2020) - [c12]Manex Agirrezabal
, Jürgen Wedekind:
KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion. SIGMORPHON 2020: 111-116
2010 – 2019
- 2019
- [c11]Dorte Haltrup Hansen, Costanza Navarretta, Lene Offersgaard, Jürgen Wedekind:
Towards the Automatic Classification of Speech Subjects in the Danish Parliament Corpus. DHN 2019: 166-174 - 2014
- [j4]Jürgen Wedekind:
On the Universal Generation Problem for Unification Grammars. Comput. Linguistics 40(3): 533-538 (2014) - 2012
- [j3]Jürgen Wedekind, Ronald M. Kaplan:
LFG Generation by Grammar Specialization. Comput. Linguistics 38(4): 867-915 (2012) - [c10]Ulrich Andersen, Anna Braasch, Lina Henriksen, Csaba Huszka, Anders Johannsen, Lars Kayser, Bente Maegaard, Ole Norgaard, Stefan Schulz, Jürgen Wedekind:
Creation and use of Language Resources in a Question-Answering eHealth System. LREC 2012: 2536-2542
2000 – 2009
- 2000
- [c9]Ronald M. Kaplan, Jürgen Wedekind:
LFG Generation Produces Context-free Languages. COLING 2000: 425-431
1990 – 1999
- 1999
- [j2]Jürgen Wedekind:
Semantic-driven Generation with LFG- and PATR-style Grammars. Comput. Linguistics 25(2): 277-281 (1999) - 1996
- [j1]Jürgen Wedekind, Ronald M. Kaplan:
Ambiguity-preserving Generation with LFG- and PATR-style Grammars. Comput. Linguistics 22(4): 555-558 (1996) - [c8]Jürgen Wedekind:
On Inference-Based Procedures for Lexical Disambiguation. COLING 1996: 980-985 - 1995
- [c7]Jürgen Wedekind:
Some Remarks on the Decidability of the Generation Problem in LFG- and PATR-Style Unification Grammars. EACL 1995: 45-52 - 1993
- [c6]Ronald M. Kaplan, Jürgen Wedekind:
Restriction and Correspondence-based Translation. EACL 1993: 193-202 - [c5]Jürgen Wedekind, Ronald M. Kaplan:
Type-Driven Semantic Interpretation of f-Structures. EACL 1993: 404-411 - 1991
- [c4]Jürgen Wedekind:
Classical Logics For Attribute-Value Languages. EACL 1991: 204-209
1980 – 1989
- 1989
- [c3]Ronald M. Kaplan, Klaus Netter, Jürgen Wedekind, Annie Zaenen:
Translation By Structural Correspondences. EACL 1989: 272-281 - 1988
- [c2]Jürgen Wedekind:
Generation as structure driven derivation. COLING 1988: 732-737 - 1986
- [c1]Jürgen Wedekind:
A Concept of Derivation for LFG. COLING 1986: 487-489
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint