arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.7315cs.DScs.FL
收藏

语言编辑距离与带评分解析:更快的算法及其与基础图问题的联系

Language Edit Distance & Scored Parsing: Faster Algorithms & Connection to Fundamental Graph Problems

Tomasz Kociumaka, Barna Saha

AI总结:

本文提出首个真正次立方时间的语言编辑距离近似算法,并证明仅插入情形的精确次立方算法将蕴含 APSP 的突破。

摘要:

给定字母表 Σ 上的上下文无关语言 L(G) 以及字符串 s∈Σ*,语言编辑距离问题旨在寻求将 s 转换为 L(G) 的合法成员所需的最小编辑次数(插入、删除和替换)。著名的动态规划算法可在 O(n^3) 时间内解决该问题(忽略文法规模),其中 n 是字符串长度 [Aho, Peterson 1972;Myers 1985]。尽管该问题有众多应用,但迄今为止尚不存在能在真正次立方时间内计算精确或近似语言编辑距离的算法。本文中,我们给出首个此类算法,可在次立方时间内近似计算语言编辑距离。对于任意 ε>0,我们的算法运行时间为 tilde O(n^{2.491}/ε^2),并返回乘法近似因子在 (1+ε) 以内的估计值。此外,还可在 O(n^2/ε^{0.825}) 时间内计算加性 εn 近似。为补充我们的上界结果,我们证明:若能在真正次立方时间内精确计算仅允许插入编辑的语言编辑距离,就将得到全源最短路径问题的真正次立方算法,而后者是计算机科学中长期悬而未决的开放问题。

英文摘要:

Given a context free language $\mathcal{L(G)}$ over alphabet $Σ$ and a string $s \in Σ^*$, {\em the language edit distance} problem seeks the minimum number of edits (insertions, deletions and substitutions) required to convert $s$ into a valid member of $\mathcal{L(G)}$. The well-known dynamic programming algorithm solves this problem in $O(n^3)$ time (ignoring grammar size) where $n$ is the string length [Aho, Peterson 1972, Myers 1985]. Despite its numerous applications, to date there exists no algorithm that computes exact or approximate language edit distance problem in true subcubic time. In this paper we give the first such algorithm that approximates language edit distance in subcubic time. For any arbitrary $ε> 0$, our algorithm runs in $\tilde{O}(\frac{n^{2.491}}{ε^2})$ time and returns an estimate within a multiplicative approximation factor of $(1+ε)$. Moreover, an additive $εn$ approximation can be computed in $O(\frac{n^2}{ε^{0.825}})$ time. To complement our upper bound results, we show that exact computation of language edit distance with insertion-only edits in truly subcubic time will imply a truly subcubic algorithm for all-pairs shortest paths which is a long-standing open question in computer science.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑