基于输入变换器的正则语言编辑距离的有效算法
An efficient algorithm for computing the edit distance of a regular language via input-altering transducers
摘要:
我们重新讨论了通过NFA计算正则语言的编辑距离的问题。这个问题与所讨论的语言的固有的最大错误检测能力有关。我们提出了一个有效的算法来解决这个问题,执行时间$O(r^2n^2d)$,其中$r$是基数的字母表所涉及的,$n$是在给定的NFA的过渡的数量,和$d$是计算的编辑距离。我们已经实现了算法,并在这里提出的性能测试。该算法的正确性是基于这样的结果(也在这里),即与我们的问题相关的特定错误检测属性可以通过输入改变换能器来定义。
英文摘要:
We revisit the problem of computing the edit distance of a regular language given via an NFA. This problem relates to the inherent maximal error-detecting capability of the language in question. We present an efficient algorithm for solving this problem which executes in time $O(r^2n^2d)$, where $r$ is the cardinality of the alphabet involved, $n$ is the number of transitions in the given NFA, and $d$ is the computed edit distance. We have implemented the algorithm and present here performance tests. The correctness of the algorithm is based on the result (also presented here) that the particular error-detection property related to our problem can be defined via an input-altering transducer.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。