Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
A method of Romanian Lexicon compression
Authors: C. Bajireanu
– 0.11 Mb
Abstract
Using the special uniform character to represent the alternations it is possible to compress the computational lexicon. The proposed method is illustrated on the example of Romanian lexicon.C. Bajireanu
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev,
MD 2028, Moldova
phone: (373-2) 738073
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev,
MD 2028, Moldova
phone: (373-2) 738073
Fulltext
– 0.11 Mb
Contents
- On program correctness and teaching programming
- On graphs G of diameter two with f(G)J|V(G)|+D-d+1
- On the architecture of problem-oriented simulation systems
- SimW - software for automatic creation of problem-oriented simulation systems
- Two problems concerning dynamic flows in node and arc capacitated networks
- The study of data and control flows and the user's interface organization in an applied system for chemistry and medicine
- A method of Romanian Lexicon compression
- Design of the Sequential System Automata using Temporal Equivalence Classes
- Grammar flow analysis reduction to scheduling problem
