# Consensus Sequence Segmentation

Source: [Consensus Sequence Segmentation](<https://www.sota2.com/research/paper/68fa612a1e209131ce9f2de2>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T19:53:34.667Z

Authors: Tamal Chowdhury, Rabindra Rakshit, Arko Banerjee

Published: 2013-08-18T07:09:03.000Z

## Abstract

In this paper we introduce a method to detect words or phrases in a given sequence of alphabets without knowing the lexicon. Our linear time unsupervised algorithm relies entirely on statistical relationships among alphabets in the input sequence to detect location of word boundaries. We compare our algorithm to previous approaches from unsupervised sequence segmentation literature and provide superior segmentation over number of benchmarks.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1308.3839>)

[PDF](<https://arxiv.org/pdf/1308.3839.pdf>)
