Sequence Modeling via Segmentations

02/24/2017
by   Chong Wang, et al.
0

Segmental structure is a common pattern in many types of sequences such as phrases in human languages. In this paper, we present a probabilistic model for sequences via their segmentations. The probability of a segmented sequence is calculated as the product of the probabilities of all its segments, where each segment is modeled using existing tools such as recurrent neural networks. Since the segmentation of a sequence is usually unknown in advance, we sum over all valid segmentations to obtain the final probability for the sequence. An efficient dynamic programming algorithm is developed for forward and backward computations without resorting to any approximation. We demonstrate our approach on text segmentation and speech recognition tasks. In addition to quantitative results, we also show that our approach can discover meaningful segments in their respective application contexts.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2022

Action parsing using context features

We propose an action parsing algorithm to parse a video sequence contain...
research
06/26/2016

Training LDCRF model on unsegmented sequences using Connectionist Temporal Classification

Many machine learning problems such as speech recognition, gesture recog...
research
11/18/2015

Segmental Recurrent Neural Networks

We introduce segmental recurrent neural networks (SRNNs) which define, g...
research
04/15/2021

Neural Sequence Segmentation as Determining the Leftmost Segments

Prior methods to text segmentation are mostly at token level. Despite th...
research
05/28/2018

Strongly polynomial efficient approximation scheme for segmentation

Partitioning a sequence of length n into k coherent segments is one of t...
research
02/26/2015

A hypothesize-and-verify framework for Text Recognition using Deep Recurrent Neural Networks

Deep LSTM is an ideal candidate for text recognition. However text recog...
research
05/09/2018

Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time

Given a threshold L and a set R = {R_1, ..., R_m} of m haplotype sequenc...

Please sign up or login with your details

Forgot password? Click here to reset