基于语法的代码的词汇量
On vocabulary size of grammar-based codes
摘要：
我们讨论的词汇量之间的不平等，即，在基于语法的字符串压缩中不同的非终结符符号的数量，以及相应通用码的多余长度，即，算法互信息的基于代码的模拟。其目的是加强在语言学中以较弱形式讨论的不平等，但对有效可计算代码的冗余性有一定的启示。本文的主要贡献是构造了一种通用的基于文法的码，这种码的多余长度可以很容易地被限制。
英文摘要：
We discuss inequalities holding between the vocabulary size, i.e., the number of distinct nonterminal symbols in a grammar-based compression for a string, and the excess length of the respective universal code, i.e., the code-based analog of algorithmic mutual information. The aim is to strengthen inequalities which were discussed in a weaker form in linguistics but shed some light on redundancy of efficiently computable codes. The main contribution of the paper is a construction of universal grammar-based codes for which the excess lengths can be bounded easily.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
