An efficient alghorithm for maximum probablity segmentation using Suffix Array
-
- UMEMURA Kyoji
- Toyohashi University of Technology
-
- KOHARA Yuto
- Toyohashi University of Technology
-
- YOSHIDA Mitsuo
- Toyohashi University of Technology
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
-
- Proceedings of the Annual Conference of JSAI
-
Proceedings of the Annual Conference of JSAI JSAI2021 (0), 1H4GS1c05-1H4GS1c05, 2021
The Japanese Society for Artificial Intelligence
- Tweet
Details 詳細情報について
-
- CRID
- 1390851320455195776
-
- NII Article ID
- 130008051548
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- CiNii Articles
-
- Abstract License Flag
- Disallowed