RUS  ENG
Full version
JOURNALS // Preprints of the Keldysh Institute of Applied Mathematics // Archive

Keldysh Institute preprints, 2012 014, 24 pp. (Mi ipmp32)

Transliteration rules generation and named entities transliteration conducted by a finite-state machine

V. K. Logacheva, E. S. Klyshinsky, V. A. Galaktionov


Abstract: The work proposes a method of cross-lingual transliteration rules generation. The method is based on analysis of a training set. Process of generation is divided into two stages: the first is extraction of simple (initial) rules, the second one is generation of complicated rules. The first stage uses the new alignment algorithm described in the paper. The transliteration is conducted by a finite-state machine constructed from a system of transliteration rules.



© Steklov Math. Inst. of RAS, 2024