نتایج جستجو برای: interactive translation

تعداد نتایج: 220645  

2005
D. Jones

This paper describes a machine translation system designed for use by monolinguals which guarantees high quality translations. A system has been developed for British Telecom which enables a user to compose texts in a foreign language with no knowledge of either the target language itself nor stylistic conventions pertinent to the text-type.

2010
Hirosato NOMURA Hitoshi IIDA

We have been developing a series of experimental machine translation systems called LUTE (Language Understander, Translator & Editor) [1] to support the examination of our theoretical work on computational linguistics. Since we are mainly interested in the theoretical aspect of natural language understanding, our objective is not to develop practical systems but to develop fundamental theories ...

Journal: : 2022

Teaching foreign languages and cultures as well translation is to be regularlyimproved. Various educational technologies are used for this purpose, with one of them – edutainment beingthe most efficient the digital generation learners. The purpose article describe experienceof applying technology a modern formation competenceamong students majoring in Philology/Translation during “Theory Practi...

پایان نامه :دانشگاه تربیت معلم - تهران - دانشکده ادبیات و زبانهای خارجی 1390

the frame semantic theory is a nascent approach in the area of translation studies which goes beyond the linguistic barriers and helps us to incorporate cognitive and cultural factors to the study of translation. based on rojos analytical model (2002b), which centered in the frames or knowledge structures activated in the text, the present research explores the various translation problems that...

2015
Benjamin Marie Aurélien Max

We introduce pre-post-editing, possibly the most basic form of interactive translation, as a touch-based interaction with iteratively improved translation hypotheses prior to classical post-editing. We report simulated experiments that yield very large improvements on classical evaluation metrics (up to 21 BLEU) as well as on a parameterized variant of the TER metric that takes into account the...

2001
Bernhard Beckert Uwe Keller Peter H. Schmitt

In this paper, we define a translation of UML class diagrams with OCL constraints into first-order predicate logic. The goal is logical reasoning about UML models, realized by an interactive theorem prover. We put an emphasis on usability of the formulas resulting from the translation, and we have developed optimisations and heuristics to enhance the efficiency of the theorem proving process. T...

2006
Jia Meng Lawrence C. Paulson

Proofs involving large specifications are typically carried out through interactive provers that use higher-order logic. A promising approach to improve the automation of interactive provers is by integrating them with automatic provers, which are usually based on first-order logic. Consequently, it is necessary to translate higher-order logic formulae to first-order form. This translation shou...

2016
Julián Zapata

This article provides a general overview of interactive translation dictation (ITD), an emerging translation technique that involves interacting with multimodal voice-and-touchenabled devices such as touch-screen computers, tablets and smartphones. The author discusses the interest in integrating new techniques and technologies into the translation sector, provides a brief description of a rece...

2000
Christopher Hogan Robert E. Frederking

We have implemented an interactive, Web-based, chat-style machine translation system, supporting speech recognition and synthesis, localor thirdparty correction of speech recognition and machine translation output, and online learning. The underlying client-server architecture, implemented in Java, provides remote, distributed computation for the translation and speech subsystems. We further de...

2017
Chris Hokamp Qun Liu

We present Grid Beam Search (GBS), an algorithm which extends beam search to allow the inclusion of pre-specified lexical constraints. The algorithm can be used with any model that generates a sequence ŷ = {y0 . . . yT }, by maximizing p(y|x) = ∏ t p(yt|x; {y0 . . . yt−1}). Lexical constraints take the form of phrases or words that must be present in the output sequence. This is a very general ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید