Minimum entropy approach to word segmentation problems
From MaRDI portal
Abstract: Given a sequence composed of a limit number of characters, we try to "read" it as a "text". This involves to segment the sequence into "words". The difficulty is to distinguish good segmentation from enormous number of random ones.Aiming at revealing the nonrandomness of the sequence as strongly as possible, by applying maximum likelihood method, we find a quantity called Segmentation Entropy that can be used to fulfill the duty. Contrary to commonplace where maximum entropy principle was applied to obtain good solution, we choose to {em minimize} the segmentation entropy to obtain good segmentation. The concept developed in this letter can be used to study the noncoding DNA sequences, e.g., for regulatory elements prediction, in eukaryote genomes.
Recommendations
- scientific article; zbMATH DE number 1282446
- scientific article; zbMATH DE number 1952702
- Segmentation of DNA into coding and noncoding regions based on recursive entropic segmentation and stop-codon statistics
- Information Capacity of Symbol Sequences
- The kindest cut: Minimum message length segmentation
Cited in
(6)- An efficient, probabilistically sound algorithm for segmentation and word discovery
- Segmentation of DNA into coding and noncoding regions based on recursive entropic segmentation and stop-codon statistics
- Minimal Discriminating Words Problem Revisited
- The kindest cut: Minimum message length segmentation
- scientific article; zbMATH DE number 884922 (Why is no real title available?)
- Segmentation and context of literary and musical sequences
This page was built for publication: Minimum entropy approach to word segmentation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935197)
