比较文本分析的复杂性--《第四台机器》说：“园丁总是凶手”
The Complexity of Comparative Text Analysis -- "The Gardener is always the Murderer" says the Fourth Machine
摘要：
有一个激烈的争论是，与整个人类研究团队的能力相比，计算机可以在多大程度上映射文本分析的复杂性。对给定文本的“深入”分析仍然超出了现代计算机的可能性。在现有的计算文本分析算法的核心是实数运算，如根据代数域的规则进行加法和乘法。然而，“比较”的过程有一个非常精确的数学结构，它不同于代数域的结构。“比较”的数学结构可以用布尔环来表示。我们建立在这个结构，并定义相应的代数方程提升算法的比较文本分析到“正确的”代数基础。从这个角度出发，我们可以考察比较文本分析的{ \em计算}复杂性问题。
英文摘要：
There is a heated debate about how far computers can map the complexity of text analysis compared to the abilities of the whole team of human researchers. A "deep" analysis of a given text is still beyond the possibilities of modern computers. In the heart of the existing computational text analysis algorithms there are operations with real numbers, such as additions and multiplications according to the rules of algebraic fields. However, the process of "comparing" has a very precise mathematical structure, which is different from the structure of an algebraic field. The mathematical structure of "comparing" can be expressed by using Boolean rings. We build on this structure and define the corresponding algebraic equations lifting algorithms of comparative text analysis onto the "correct" algebraic basis. From this point of view, we can investigate the question of {\em computational} complexity of comparative text analysis.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
