LFG Generation from Acyclic F-Structures is NP-Hard

IF 3.7 2区计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Computational Linguistics Pub Date : 2021-08-11 DOI:10.1162/coli_a_00419

Jürgen Wedekind, R. Kaplan

引用次数: 1

Abstract

Abstract 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.

查看原文本刊更多论文

从非循环F结构生成LFG是NP难的

摘要LFG语法的通用生成问题是确定给定语法是否派生出具有给定f结构的任何终端字符串的问题。众所周知，这个问题对于非循环f结构是可判定的。在这个简短的说明中，我们表明，对于那些f结构，这个问题仍然是棘手的。这甚至适用于离线可解析的语法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Computational Linguistics 工程技术-计算机：跨学科应用

CiteScore

15.80

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Computational Linguistics, the longest-running publication dedicated solely to the computational and mathematical aspects of language and the design of natural language processing systems, provides university and industry linguists, computational linguists, AI and machine learning researchers, cognitive scientists, speech specialists, and philosophers with the latest insights into the computational aspects of language research.