arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1911.02889cs.DS
收藏

更好的压缩表示

Towards Better Compressed Representations

Michał Gańczorz

摘要:

我们介绍了计算解析的问题,其中每个短语的长度最多为$m$,并且最小化解析的零阶熵。基于最近的理论结果,我们设计了一个启发式的这个问题。该解决方案在简洁的文本表示中具有直接的应用,并给出了实际的改进。此外,所提出的启发式产生的结构,其大小可以由$|S|H_{m-1}(S)$和由$|S|/m(H_0(S) + \cdots + H_{m-1})$,其中$H_{k}(S)$是$S$的$k$阶经验熵界定。我们还考虑了一个类似的问题,其中一阶熵最小化。

英文摘要:

We introduce the problem of computing a parsing where each phrase is of length at most $m$ and which minimizes the zeroth order entropy of parsing. Based on the recent theoretical results we devise a heuristic for this problem. The solution has straightforward application in succinct text representations and gives practical improvements. Moreover the proposed heuristic yields structure whose size can be bounded both by $|S|H_{m-1}(S)$ and by $|S|/m(H_0(S) + \cdots + H_{m-1})$, where $H_{k}(S)$ is the $k$-th order empirical entropy of $S$. We also consider a similar problem in which the first-order entropy is minimized.

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

↑