Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Znaleziono wyników: 3
first rewind previous Strona / 1 next fast forward last
help Sortuj według:

help Ogranicz wyniki do:
Fundamenta Informaticae
EN In this second part of the survey, we present the application of weighted extended topdown tree transducers in machine translation, which is the automatic translation of natural language texts. We present several formal properties that are relevant to machine translation and evaluate the weighted ex[...]
Fundamenta Informaticae
EN Several models of automata are available that operate unranked trees. Two well-known examples are the stepwise unranked tree automaton (suta) and the parallel unranked tree automaton (puta). By adding a weight, taken from some semiring, to every transition we generalise these two qualitative automat[...]
Fundamenta Informaticae
EN Weighted extended tree transducers (wxtts) over countably complete semirings are systematically explored. It is proved that the extension in the left-hand sides of a wxtt can be simulated by the inverse of a linear and nondeleting tree homomorphism. In addition, a characterization of the class of we[...]
first rewind previous Strona / 1 next fast forward last