Unambiguous triggers
Unambiguous triggers
复制标题
DOI：
10.1162/002438998553644
复制
发表时间：
1998-12-01
影响因子：
1.6
通讯作者：
Fodor, JD
中科院分区：
文献类型：
--
作者：
Fodor, JD
参数设置的触发可能不明确。处理歧义的策略包括猜测、并行处理和等待明确的输入。吉布森和Wexler（1994）的触发学习算法是一个猜测系统。吉布森和韦克斯勒指出，在某些合理的假设下，它可能永远不会达到目标语法。我提出了一个确定性的设备，等待明确的触发器设置参数。这个学习器必须能够检测参数歧义。这在触发器作为触发参数开关的句子的经典概念中是不可能的。如果一个触发器（以及它触发的参数值）是一个树结构，也许是一个单一的特征，由通用语法提供，并且如果没有它就不能解析输入句子，则被采用到学习者的语法中，这是可能的。
Triggers for parameter setting may be ambiguous. Strategies for dealing with ambiguity include guessing, parallel processing, and waiting for unambiguous input. The Trigger Learning Algorithm of Gibson and Wexler (1994) is a guessing system. Gibson and Wexler show that under some reasonable assumptions it may never attain the target grammar. I propose instead a deterministic device that waits for unambiguous triggers to set parameters. This learner must be able to detect parametric ambiguity. This is not possible on the classical conception of triggers as sentences that flip parameter switches. It is possible if a trigger (and the parameter value it triggers) is a piece of tree structure, perhaps a single feature, made available by Universal Grammar, and adopted into the learner's grammar if input sentences cannot be parsed without it.