Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Backtracking algorithm for lexicon generation
Authors: Ciubotaru Constantin
Keywords: lexicon, transliteration, backtracking algorithm, decyrillization, morpho-syntactic descriptions (MSD).
– 0.30 Mb
Keywords: lexicon, transliteration, backtracking algorithm, decyrillization, morpho-syntactic descriptions (MSD).
Abstract
This paper is dedicated to generating process of the Romanian Cyrillic lexicon used between 1967 and 1989. The rules for transliteration of words from the modern Romanian lexicon to their equivalents written in Cyrillic were established and argued. A backtracking algorithm has been developed and implemented that generates the Cyrillic lexicon using the transliteration rules. This algorithm actually is a tool to facilitate the work of the expert. The work of the expert is reduced to checking the transliterated variants and changing the transliteration rules.Vladimir Andrunachievici Institute of
Mathematics and Computer Science
Republic of Moldova
E-mail:
Mathematics and Computer Science
Republic of Moldova
E-mail:
Fulltext
– 0.30 Mb
Contents
- A Sublinear Sudoku Solution in cP Systems and its Formal Verification
- On a modified M/M/m/n queueing model
- Properties of Finitely Supported Self - Mappings on the Finite Powerset of Atoms
- On the bondage, strong and weak bondage numbers in Complementary Prism Graphs
- Some properties of maximum deficiency energy of a graph
- Connected Domination Number and a New Invariant in Graphs with Independence Number Three
- Total energy of signed digraphs
- Backtracking algorithm for lexicon generation
