An efficient, probabilistically sound algorithm for segmentation and word discovery

DOI10.1023/A:1007541817488zbMATH Open0917.68167WikidataQ39244966 ScholiaQ39244966MaRDI QIDQ1289003FDOQ1289003

Authors: Michael R. Brent 

Publication date: 24 May 1999

Published in: Machine Learning (Search for Journal in Brave)

Recommendations

• Statistical models for text segmentation
• scientific article; zbMATH DE number 2033338
• A dynamic programming algorithm for linear text segmentation
• Minimum entropy approach to word segmentation problems
• Text segmentation by product partition models and dynamic programming

zbMATH Keywords

segmentationword discovery

Mathematics Subject Classification ID

Natural language processing (68T50)

Cited In (9)

• Title not available (Why is that?)
• Probabilistic segmentation of musical sequences using restricted Boltzmann machines
• A dynamic programming algorithm for linear text segmentation
• Artificial intelligence and language
• Research on a word segmentation algorithm based on the Uyghur phoneme acoustic feature
• Triadic patterns across classical and popular music corpora: stylistic conventions, or characteristic idioms?
• AI 2003: Advances in Artificial Intelligence
• Unsupervised learning of word segmentation rules with genetic algorithms and inductive logic programming
• Title not available (Why is that?)

This page was built for publication: An efficient, probabilistically sound algorithm for segmentation and word discovery

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