This paper gives a computational characterisation of opaque interactions in phonology. Specifically, a range of opaque interactions are shown to be Input Strictly Local (ISL) maps (Chandlee 2014), which are string-to-string functions that determine output based only on contiguous sequences of input symbols. Examples from Baković’s (2007) extended typology of counterfeeding, counterbleeding, self-destructive feeding, non-gratuitous feeding and cross-derivational feeding, as well as a case of fed counterfeeding from Kavitskaya & Staroverov (2010), are all given ISL analyses, which show that these interactions can be computed based on sequences of bounded length in the input. It is discussed how ISL maps are restrictive in their typological predictions, have guaranteed learning results and known methods for generation and recognition, and thus compare favourably to rule-based and constraint-based approaches to these interactions.

中文翻译：

---

输入严格局部不透明贴图

本文给出了语音学中不透明相互作用的计算特征。具体来说，一系列不透明的交互显示为输入严格局部 (ISL) 映射 (Chandlee 2014)，它是字符串到字符串的函数，仅根据输入符号的连续序列确定输出。Baković (2007) 的反喂食、反流血、自毁喂养、非无偿喂养和交叉衍生喂养的扩展类型学的例子，以及来自 Kavitskaya 和 Staroverov (2010) 的反喂食案例，都给出了 ISL 分析，这表明这些交互可以基于输入中的有界长度序列来计算。讨论了 ISL 地图如何限制其类型预测、保证学习结果以及生成和识别的已知方法，