Finite State Transducers with Predicates and Identities
Finite State Transducers with Predicates and Identities
复制标题
具有谓词和恒等式的有限状态转换器
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
D. Gerdemann
中科院分区：
文献类型：
--
作者：
Gertjan van Noord;D. Gerdemann
提出了有限状态换能器的扩展，其中原子符号被符号上的任意谓词替换。该扩展的动机是自然语言处理中的应用（但可能更广泛适用）以及具有谓词的换能器通常具有更少的状态和更少的转换的观察。尽管扩展对于有限状态接受器来说相当简单，但谓词的引入对于转换器来说更有趣。展示了如何实现对换能器的各种操作（例如组合），以及如何将换能器确定算法推广到谓词增强有限状态换能器。
An extension to finite state transducers is presented, in which atomic symbols are replaced by arbitrary predicates over symbols. The extension is motivated by applications in natural language processing (but may be more widely applicable) as well as by the observation that transducers with predicates generally have fewer states and fewer transitions. Although the extension is fairly trivial for finite state acceptors, the introduction of predicates is more interesting for transducers. It is shown how various operations on transducers (e.g., composition) can be implemented, as well as how the transducer determinization algorithm can be generalized for predicate-augmented finite state transducers.