The Strong, Weak, and Very Weak Finite Context and Kernel Properties
The Strong, Weak, and Very Weak Finite Context and Kernel Properties
复制标题
强、弱和极弱有限上下文和核属性
DOI：
10.1007/978-3-319-53733-7_5
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Ryo Yoshinaka
中科院分区：
文献类型：
--
作者：
Makoto Kanazawa;Ryo Yoshinaka
我们确定了上下文无关语法的属性，这些属性与Clark和Yoshinaka的分布式学习算法的对偶和原始版本的行为完全对应，并将它们称为非常弱的有限上下文/内核属性。我们表明，非常弱的有限上下文属性并不意味着Yoshinaka的弱有限上下文属性，这被认为是双重算法成功的目标语言。我们还表明弱有限上下文属性确实比Clark的强有限上下文属性弱，解决了Yoshinaka提出的问题。
We identify the properties of context-free grammars that exactly correspond to the behavior of the dual and primal versions of Clark and Yoshinaka’s distributional learning algorithm and call them the very weak finite context/kernel property. We show that the very weak finite context property does not imply Yoshinaka’s weak finite context property, which has been assumed to hold of the target language for the dual algorithm to succeed. We also show that the weak finite context property is genuinely weaker than Clark’s strong finite context property, settling a question raised by Yoshinaka.