A dynamic programming algorithm for linear text segmentation

DOI10.1023/B:JIIS.0000039534.65423.00MaRDI QIDQ1769549zbMATH OpenOpenAlexFDO

Authors Xianqiang Yang

Publication date 22 March 2005

Published in Journal of Intelligent Information Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:jiis.0000039534.65423.00

zbMATH Keywords

machine learningdocument retrievalinformation retrievaltext segmentation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20)

Recommendations

• Text segmentation by product partition models and dynamic programming
• Statistical models for text segmentation
• Fast sequence segmentation using log-linear models
• An efficient, probabilistically sound algorithm for segmentation and word discovery
• AI 2003: Advances in Artificial Intelligence

Cited in

(6)

• Homogeneous string segmentation using trees and weighted independent sets
• scientific article; zbMATH DE number 1897854 (Why is no real title available?)
• Greedy Gaussian segmentation of multivariate time series
• Segmenting Strings Homogeneously Via Trees
• AI 2003: Advances in Artificial Intelligence
• Text segmentation by product partition models and dynamic programming

This page was built for publication: A dynamic programming algorithm for linear text segmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1769549)