The Strong, Weak, and Very Weak Finite Context and Kernel Properties.
Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings,
, pp.77-88
(2017), [peer-reviewed]
Event Date:
March 6-9, 2017
Abstract / 概要
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…