This study deals with Translation Procedures in Medan Heritage and Culinary Tourism Booklet. It was aimed to investigate the kinds of translation procedures Booklet, describe realization as well elaborate reason used way they are. conducted by using descriptive qualitative research. The sources data were taken from Booklet 2015. result showed that there 135 found Specifically 31 (22.96%) for Ad...

The translation process in statistical machine translation (SMT) is shaped by technical constraints and engineering considerations. SMT explicitly models translation as search for a target-language equivalent of the input text. This perspective on translation had wide currency in mid-20th century translation studies, but has since been superseded by approaches arguing for a more complex relatio...

The paper proposes a new translation algorithm that translates a hybrid system described as a discrete hybrid automaton (DHA) into an equivalent piecewise affine (PWA) system. The translation algorithm exploits, among others, a new technique for cell enumeration in hyperplane arrangement, all proposed in this paper. The new translation technique enables the transfer of several analysis and synt...

Processing natural language statements to obtain equivalent translations in a different language has long been an area of research in Artificial Intelligence. Still, most existing approaches are word-to-word translations and thus cannot ensure high-quality translations by considering the whole meaning of the statement. The translation mechanism presented in this paper constructs semantic schema...

–Machine Translation (MT ) of English text to its Urdu equivalent is a difficult challenge. Lot of attempts has been made, but a few limited solutions are provided till now. We present a direct approach, using an expert system to translate English text into its equivalent Urdu, using The Unicode Standard, Version 4.0 (ISBN 0-321-18578-1) Range: 0600–06FF. The expert system works with a knowledg...

We present a detailed account of a translation from probabilistic call-by-value programs with procedures to Rabin’s probabilistic automata. The translation is fully abstract in that programs exhibit the same computational behaviour if and only if the corresponding automata are language-equivalent. Since probabilistic language equivalence is decidable, we can apply the translation to analyse the...