The universal generation problem for LFG grammars is the problem of determining whether a given grammar derives any terminal string with a given f-structure. It is known that this problem is decidable for acyclic f-structures. In this brief note, we show that for those f-structures the problem is nonetheless intractable. This holds even for grammars that are off-line parsable.
Department of Nordic Studies and Linguistics, Emil Holms Kanal 2, 2300 Copenhagen S, Denmark. E-mail: email@example.com.
Linguistics Department,Margaret Jacks Hall Building 460, Stanford, CA 94305, USA. E-mail: firstname.lastname@example.org.