Sciweavers

4 search results - page 1 / 1
» Unsupervised Segmentation of Chinese Text by Use of Branchin...
Sort
View
ACL
2006
13 years 6 months ago
Unsupervised Segmentation of Chinese Text by Use of Branching Entropy
We propose an unsupervised segmentation method based on an assumption about language data: that the increasing point of entropy of successive characters is the location of a word ...
Zhihui Jin, Kumiko Tanaka-Ishii
EMNLP
2010
13 years 2 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura
ACL
2012
11 years 7 months ago
Unsupervized Word Segmentation: the Case for Mandarin Chinese
In this paper, we present an unsupervized segmentation system tested on Mandarin Chinese. Following Harris's Hypothesis in Kempe (1999) and Tanaka-Ishii's (2005) reformu...
Pierre Magistry, Benoît Sagot
DCC
2005
IEEE
14 years 4 months ago
The Markov Expert for Finding Episodes in Time Series
We describe a domain-independent, unsupervised algorithm for refined segmentation of time series data into meaningful episodes, focusing on the problem of text segmentation. The V...
Jimming Cheng, Michael Mitzenmacher