An efficient alghorithm for maximum probablity segmentation using Suffix Array

DOI

Bibliographic Information

Other Title
  • 最大確率分割のSuffix Arrayを用いた高速なアルゴリズム

Abstract

<p>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.</p>

Journal

Keywords

Details 詳細情報について

Report a problem

Back to top