A Method for the Expansion and Contraction of Texts Size by Using the String Replacement Algorithm
A Method for the Expansion and Contraction of Texts Size by Using the String Replacement Algorithm
复制标题
一种利用字符串替换算法实现文本大小伸缩的方法
DOI：
10.1016/0020-0255(95)00095-x
复制
发表时间：
1995
期刊：
影响因子：
--
通讯作者：
J. Aoe
中科院分区：
文献类型：
--
作者：
K. Tsuda;J. Aoe
本文描述了一种使用有效的字符串替换算法来扩展文本大小的方法。扩展词素规则支持通过使用词素替换来扩展文本大小的方法。本文以文本约简为例说明了文本扩展方法。词素替换被定义为范畴模式和对词素的限制的组合。通过扩展Aho的字符串模式匹配算法有效地检测可替换模式。这个扩展包括一个匹配算法的应用程序，取代输入语素。几个文本的模拟结果表明，减少的文本是5%和10%之间的时间比原来的同行。此外，通过使用该模式匹配算法检测合适的约简规则，状态转换的数量可以减少到使用Aho的模式匹配算法时的1/7。
This paper describes a method for the expansion of the size of texts using an efficient string replacement algorithm. A method for the expansion of the size of texts by use of morpheme replacements is supported by the rules for expansion morphemes. This paper explains the text expansion method using the example of text reduction. Morpheme replacements are defined as a combination of a pattern of categories and restrictions on morphemes. A replaceable pattern is efficiently detected through an extension of Aho's string pattern-matching algorithm. This extension consists of the application of a matching algorithm that replaces the input morpheme. Results of simulations upon several texts show that reduced texts are between 5% and 10% shorter than their original counterparts. Also, by use of this pattern-matching algorithm for detection of the suitable reducing rules, the number of state translations can be reduced to 1 7 of that when using Aho's pattern-matching algorithm.