n带加权可编程状态机的选择运算、算法和应用
Selected Operations, Algorithms, and Applications of n-Tape Weighted Finite-State Machines
摘要：
n带加权有限状态机（n-WFSM）定义了n个字符串上的有理关系。它是加权受体（一个磁带）和传感器（两个磁带）的推广。在回顾了n元加权有理关系和n-WFSM的一些基本定义之后，我们总结了这些关系和机器上的一些中心操作，如连接和自相交。不幸的是，由于Post的对应问题，完全通用的连接或自动相交算法不存在。我们回顾了一类n-WFSMs的限制算法。通过一系列的实际应用，我们最后调查的增强描述能力的n-WFSM和他们的加入，相比经典的传感器和他们的组成。有些应用程序是不可行的后者。该系列包括：闪米特语言的形态分析，在转换器级联中保存中间结果，从语料库中归纳形态规则，词典条目的对齐，从语料库中自动提取首字母缩略词及其含义，以及在双语词典中搜索同源词。所有描述的操作和应用程序都已使用Xerox的WFSC工具实现。
英文摘要：
A weighted finite-state machine with n tapes (n-WFSM) defines a rational relation on n strings. It is a generalization of weighted acceptors (one tape) and transducers (two tapes). After recalling some basic definitions about n-ary weighted rational relations and n-WFSMs, we summarize some central operations on these relations and machines, such as join and auto-intersection. Unfortunately, due to Post's Correspondence Problem, a fully general join or auto-intersection algorithm cannot exist. We recall a restricted algorithm for a class of n-WFSMs. Through a series of practical applications, we finally investigate the augmented descriptive power of n-WFSMs and their join, compared to classical transducers and their composition. Some applications are not feasible with the latter. The series includes: the morphological analysis of Semitic languages, the preservation of intermediate results in transducer cascades, the induction of morphological rules from corpora, the alignment of lexicon entries, the automatic extraction of acronyms and their meaning from corpora, and the search for cognates in a bilingual lexicon. All described operations and applications have been implemented with Xerox's WFSC tool.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
