Presentation information

General Session

General Session » GS-1 Fundamental AI, theory

[1H4-GS-1c] 基礎・理論:アルゴリズム

Tue. Jun 8, 2021 5:20 PM - 7:00 PM Room H (GS room 3)

座長:荒井 幸代(千葉大学)

6:40 PM - 7:00 PM

[1H4-GS-1c-05] An efficient alghorithm for maximum probablity segmentation using Suffix Array

〇Kyoji Umemura1, Yuto Kohara1, Mitsuo Yoshida1 (1. Toyohashi University of Technology)

Keywords:Algorithm, Maximum Probability Segmentation, suffix array

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.

Authentication for paper PDF access

A password is required to view paper PDFs. If you are a registered participant, please log on the site from Participant Log In.
You could view the PDF with entering the PDF viewing password bellow.