A new unsupervised method for boundary perception and word-like segmentation of sequence. (25th November 2020)

• Record Type: Journal Article
• Authors: Banerjee, Arko; Pujari, Arun K.; Pati, Bibudhendu; Panigrahi, Chhabi Rani
• Is Part Of: International journal of computational science and engineering. Volume 23:Number 3(2020)
• Page Start: 286
• Page End: 295
• Publication Date: 2020-11-25
• Subjects: boundary perception -- sequence segmentation -- trie datastructure; Computer science -- Mathematics -- Periodicals; Computer simulation -- Mathematical aspects -- Periodicals; Computational intelligence -- Periodicals; 004.015105
• Languages: English
• ISSNs: 1742-7185

Abstract

In cognitive science research on natural language processing, motor learning and visual perception, perceiving boundary points and segmenting a continuous string or sequence is one of the fundamental problems. Boundary perception can also be viewed as a machine learning problem; supervised or unsupervised learning. In supervised learning approach for determining boundary points for segmentation of a sequence, it is necessary to have some pre-segmented training examples. In unsupervised mode, the learning is accomplished without any training data hence, the frequency of occurence of symbols within the sequence is normally used as the cue. Most of earlier algorithms use this cue while scanning the sequence in forward direction. In this paper we propose a novel approach of extracting the possible boundary points by using bi-directional scanning of the sequence. We show here that such an extension from unidirectional to bi-directional is not trivial and requires judicious consideration of datastructure and algorithm. We here propose a new algorithm which traverses the sequence unidirectionally but extracts the information bi-directionally. Our method yields better segmentation which is demonstrated by rigorous experimentation on several datasets.