Sciweavers

10493 search results - page 42 / 2099
» Dynamic Word Problems
Sort
View
AAECC
2004
Springer
87views Algorithms» more  AAECC 2004»
13 years 7 months ago
DFT-based Word Normalization in Finite Supersolvable Groups
Abstract. In this paper we discuss the word normalization problem in pc presented finite supersolvable groups: given two group elements a and b in normal form the normal form of th...
Meinard Müller, Michael Clausen
ACL
2012
11 years 10 months ago
Using Rejuvenation to Improve Particle Filtering for Bayesian Word Segmentation
We present a novel extension to a recently proposed incremental learning algorithm for the word segmentation problem originally introduced in Goldwater (2006). By adding rejuvenat...
Benjamin Börschinger, Mark Johnson
ICDAR
2003
IEEE
14 years 1 months ago
Learning the lexicon from raw texts for open-vocabulary Korean word recognition
In this paper, we propose a novel method of building a language model for open-vocabulary Korean word recognition. Due to the complex morphology of Korean, it is inappropriate to ...
Sungho Ryu, Jin Hyung Kim
EACL
2003
ACL Anthology
13 years 9 months ago
Combining Clues for Word Alignment
In this paper, a word alignment approach is presented which is based on a combination of clues. Word alignment clues indicate associations between words and phrases. They can be b...
Jörg Tiedemann
ACL
2009
13 years 5 months ago
Bayesian Unsupervised Word Segmentation with Nested Pitman-Yor Language Modeling
In this paper, we propose a new Bayesian model for fully unsupervised word segmentation and an efficient blocked Gibbs sampler combined with dynamic programming for inference. Our...
Daichi Mochihashi, Takeshi Yamada, Naonori Ueda