An efficient alghorithm for maximum probablity segmentation using Suffix Array

Abstract

Maximum probability partitioning is a classical problem of string, and the efficiency of the program to obtain the partitioning is important. This paper describes an efficient method for this problem and examine its efficiency by actual code. The efficiency is achieved by examining the behavior of frequency counting using suffix array.