Access the full text.
Sign up today, get DeepDyve free for 14 days.
A.V. Aho, J. D. Ullman (1972)
The Theory of Parsing, Translation, and Compiling
K. Knight, J. Graehl (1998)
Machine TransliterationComp. Ling., 24
(2010)
Prakticheskaya transkriptsiya lichnykh imen v yazykakh narodov mira
Yu.G. Karpov (2003)
Teoriya avtomatov
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.
Automatic Documentation and Mathematical Linguistics – Springer Journals
Published: Mar 27, 2012
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.