结构无歧义概率文法的学习
Learning of Structurally Unambiguous Probabilistic Grammars
AI总结:
本文针对结构无歧义概率上下文无关文法的拓扑学习问题,提出基于共线性多重性树自动机的多项式查询学习算法,并证明可转换为完整概率文法。
摘要:
识别概率上下文无关文法的问题包含两个方面:一是确定文法的拓扑结构(即文法的规则),二是估计每条规则的概率权重。鉴于一般上下文无关文法以及特别是概率文法的学习难度结果,大多数文献集中在第二个问题上。在本工作中,我们处理第一个问题。我们将注意力限制在结构无歧义加权上下文无关文法(SUWCFG)上,并为结构无歧义概率上下文无关文法(SUPCFG)提供了一种查询学习算法。我们展示了SUWCFG可以用共线性多重性树自动机(CMTA)来表示,并提供了一种多项式学习算法来学习CMTA。我们证明了学习到的CMTA可以转换为概率文法,从而提供了一种完整的算法,通过结构化成员查询和结构化等价查询来学习结构无歧义概率上下文无关文法(包括文法拓扑和概率权重)。本工作的精简版发表于AAAI 21。
英文摘要:
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness results for learning context-free grammars in general, and probabilistic grammars in particular, most of the literature has concentrated on the second problem. In this work we address the first problem. We restrict attention to structurally unambiguous weighted context-free grammars (SUWCFG) and provide a query learning algorithm for \structurally unambiguous probabilistic context-free grammars (SUPCFG). We show that SUWCFG can be represented using \emph{co-linear multiplicity tree automata} (CMTA), and provide a polynomial learning algorithm that learns CMTAs. We show that the learned CMTA can be converted into a probabilistic grammar, thus providing a complete algorithm for learning a structurally unambiguous probabilistic context free grammar (both the grammar topology and the probabilistic weights) using structured membership queries and structured equivalence queries. A summarized version of this work was published at AAAI 21.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。