16 search results - page 1 / 4 » Automatic Sanskrit Segmentizer Using Finite State Transducer... |
ACL
2010
13 years 2 months ago
2010
In this paper, we propose a novel method for automatic segmentation of a Sanskrit string into different words. The input for our segmentizer is a Sanskrit string either encoded as...
IWRIDL
2006
ACM
13 years 10 months ago
2006
ACM
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
CICLING
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we ne...
NAACL
2010
13 years 2 months ago
2010
We describe a Bayesian inference algorithm that can be used to train any cascade of weighted finite-state transducers on end-toend data. We also investigate the problem of automat...
ACL
2008
13 years 6 months ago
2008
In morphologically rich languages such as Arabic, the abundance of word forms resulting from increased morpheme combinations is significantly greater than for languages with fewer...