非幂等半环的A*最短字符串解码
A* shortest string decoding for non-idempotent semirings
AI总结:
针对非幂等半环上加权有限状态自动机无最短路径定义的问题,提出以等价DFA反向最短距离为启发式、在配套幂等半环上执行按需A*搜索的算法,可高效求解最短字符串且具备正确性保证。
摘要:
对于非幂等半环上的加权有限状态自动机,单源最短路径算法是未定义的,因为这类半环无法保证最短路径存在。不过,在满足单调性条件的有序非幂等半环(如加乘半环或对数半环)中,最短字符串的概念是良定义的。我们提出一种算法,可在这类半环上的加权非确定性自动机中找出最短字符串:该算法以等价确定性自动机(DFA)的反向最短距离作为A*搜索的启发式函数,在配套的幂等半环上执行搜索,且已被证明能返回最短字符串。尽管DFA的状态数可能呈指数级增长,但如果采用“按需”确定化方式,该算法只需访问其中极小一部分状态。
英文摘要:
The single shortest path algorithm is undefined for weighted finite-state automata over non-idempotent semirings because such semirings do not guarantee the existence of a shortest path. However, in non-idempotent semirings admitting an order satisfying a monotonicity condition (such as the plus-times or log semirings), the notion of shortest string is well-defined. We describe an algorithm which finds the shortest string for a weighted non-deterministic automaton over such semirings using the backwards shortest distance of an equivalent deterministic automaton (DFA) as a heuristic for A* search performed over a companion idempotent semiring, which is proven to return the shortest string. While there may be exponentially more states in the DFA, this algorithm needs to visit only a small fraction of them if determinization is performed "on the fly".
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。