Application of Quotient Space Granularity Computation Theory in Pinyin-Chinese Character Conversion

At present the most widely used technology of pinyin-Chinese character conversion combines statistics with linguistic rules. Although it basically solves such problems as long distance restriction and language recursion phenomenon, it relies on a great deal of computation because there are too many candidate paths. This paper tries to simplify the candidate paths by using quotient space granularity computation theory, first obtains the scope of the best path in the coarser granularity world, and then uses more language rules to obtain the best path. The experiments indicate that this method can reduce the computation, speed up the conversion, and enhance the rate of accuracy by nearly 2%