Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Generation of finite state machine for named entities transliteration task

Generation of finite state machine for named entities transliteration task The paper suggests the new linear method of cross-lingual named entities transliteration. Strings are processed with an extended finite-state automaton which is constructed from a system of rules with contexts. Transliteration with FSM is equivalent to transliteration with the system of rules. We provide proof of linear complexity of the transliteration procedure. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Automatic Documentation and Mathematical Linguistics Springer Journals

Generation of finite state machine for named entities transliteration task

Loading next page...
 
/lp/springer-journals/generation-of-finite-state-machine-for-named-entities-transliteration-qOb1P0ZqdG
Publisher
Springer Journals
Copyright
Copyright © 2012 by Allerton Press, Inc.
Subject
Computer Science; Information Storage and Retrieval
ISSN
0005-1055
eISSN
1934-8371
DOI
10.3103/S0005105512010049
Publisher site
See Article on Publisher Site

Abstract

The paper suggests the new linear method of cross-lingual named entities transliteration. Strings are processed with an extended finite-state automaton which is constructed from a system of rules with contexts. Transliteration with FSM is equivalent to transliteration with the system of rules. We provide proof of linear complexity of the transliteration procedure.

Journal

Automatic Documentation and Mathematical LinguisticsSpringer Journals

Published: Mar 27, 2012

References