Departement of Linguistics, University of Maryland at College Park, 1401 Marie Mount Hall, College Park, MD 20742-5031, USA.
Philos Trans R Soc Lond B Biol Sci. 2020 Jan 6;375(1789):20190050. doi: 10.1098/rstb.2019.0050. Epub 2019 Nov 18.
We consider the Phonological Continuity Hypothesis (PCH) of Fitch (2018) in light of a broader range of formal systems. A consideration of the learning and generalization of simple patterns such as AAB from Marcus (Marcus 2000 . , 145-147(doi:10.1111/1467-8721.00080)) shows that finite-state automata defined in the standard way fail to generalize in a compatible fashion. However, pushdown automata with finite-memory limits do show compatible generalization capabilities. The third class of formal systems-tree automata-provide yet another possibility for the processing of words within sentences. We conclude that there are additional possible formal differences between sound patterns and sentence patterns, which will make testing the PCH even more difficult. This article is part of the theme issue 'What can animal communication teach us about human language?'
我们从更广泛的形式系统的角度考虑了菲奇（Fitch）（2018 年）的音韵连续性假说（PCH）。对马库斯（Marcus）（Marcus 2000 ，145-147（doi：10.1111/1467-8721.00080））中简单模式（如 AAB）的学习和泛化的考虑表明，以标准方式定义的有限状态自动机无法以兼容的方式进行泛化。但是，具有有限内存限制的下推自动机确实显示出兼容的泛化能力。第三类形式系统——树自动机——为句子内的单词处理提供了另一种可能性。我们的结论是，语音模式和句子模式之间存在其他可能的形式差异，这将使 PCH 的测试更加困难。本文是主题为“动物交流能教给我们什么关于人类语言？”的一部分。
