使用3-排序自动机进行单词分类
Classifying Words with 3-sort Automata
AI总结:
本文提出通过推断具有3种状态类型的非确定性有限自动机(NFA),并将其转换为概率NFA应用于单词分类任务,实验证明该方法在现实与基准数据集上均有效。
摘要:
语法推断是指从数据中学习语言或语法。在本文中,我们考虑了多个模型,用于推断具有3种状态类型的非确定性有限自动机(NFA),该自动机必须接受某些单词,并拒绝给定样本中的其他单词。然后,我们提出了一种将该3-排序NFA转换为加权频率和概率NFA的变换方法,并将后者应用于分类任务。对我们方法的实验评估表明,概率NFA可以成功应用于现实生活与表面基准数据集上的分类任务。
英文摘要:
Grammatical inference consists in learning a language or a grammar from data. In this paper, we consider a number of models for inferring a non-deterministic finite automaton (NFA) with 3 sorts of states, that must accept some words, and reject some other words from a given sample. We then propose a transformation from this 3-sort NFA into weighted-frequency and probabilistic NFA, and we apply the latter to a classification task. The experimental evaluation of our approach shows that the probabilistic NFAs can be successfully applied for classification tasks on both real-life and superficial benchmark data sets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。