4 research outputs found
Exploring gap filling as a cheaper alternative to reading comprehension questionnaires when evaluating machine translation for gisting
A popular application of machine translation (MT) is gisting: MT is consumed as is to make sense of text in a foreign language. Evaluation of the usefulness of MT for gisting is surprisingly uncommon. The classical method uses reading comprehension questionnaires (RCQ), in which informants are asked to answer professionally-written questions in their language about a foreign text that has been machine-translated into their language. Recently, gap-filling (GF), a form of cloze testing, has been proposed as a cheaper alternative to RCQ. In GF, certain words are removed from reference translations and readers are asked to fill the gaps left using the machine-translated text as a hint. This paper reports, for thefirst time, a comparative evaluation, using both RCQ and GF, of translations from multiple MT systems for the same foreign texts, and a systematic study on the effect of variables such as gap density, gap-selection strategies, and document context in GF. The main findings of the study are: (a) both RCQ and GF clearly identify MT to be useful, (b) global RCQ and GF rankings for the MT systems are mostly in agreement, (c) GF scores vary very widely across informants, making comparisons among MT systems hard, and (d) unlike RCQ, which is framed around documents, GF evaluation can be framed at the sentence level. These findings support the use of GF as a cheaper alternative to RCQ
Poszukiwanie informacji w procesie post-edycji i tłumaczenia
Wydział AnglistykiRozprawa miała na celu zbadanie, jak osoby studiujące tłumaczenie i filologię angielską korzystają z tłumaczenia maszynowego i źródeł internetowych podczas tłumaczenia oraz post-edycji dwóch typów tekstu. Rozdział 1 wprowadza pojęcia tłumaczenia maszynowego, post-edycji i stosunku tłumaczy do nich. Rozdział 2 dotyczy poszukiwania informacji oraz modeli kompetencji tłumaczy. Rozdział 3 przedstawia wysiłek w procesie tłumaczenia i post-edycji, skupiając się na metodologii w okulografii i badaniach wykorzystujących keylogging. Rozdział 4 opisuje eksperymentalne badanie efektów oraz korelacji między aspektami nauczania tłumaczenia oraz poszukiwania informacji w tłumaczeniu i post-edycji. Zbadano siedem hipotez dotyczących efektu typu tekstu oraz grupy na wskaźniki wysiłku, zakres wykorzystanych źródeł oraz poprawność tłumaczenia. Analizy korelacyjne dotyczyły poprawności i procentu sprawdzonych wybranych słów/fraz, jak również procentowo oszacowanego czasu w źródłach i stosunku do tłumaczenia maszynowego oraz postrzeganego wysiłku, który to również skorelowano z zakresem źródeł. Niektóre z hipotez częściowo potwierdzono, ale relacje między wysiłkiem, poprawnością i stosunkiem do tłumaczenia maszynowego w poszukiwaniu informacji w tłumaczeniu i post-edycji są bardzo złożone. Opisane zależności mogą być szczególnie przydatne w nauczaniu tłumaczenia i badaniach nad procesem przekładu.This dissertation investigated translation trainees and EFL students interacting with machine translation and online resources (OR) in translation and post-editing tasks for two text types. Chapter 1 introduces the concepts of machine translation, post-editing, and translators’ attitudes towards them. Chapter 2 details information behaviour and translator competence models. Chapter 3 presents effort in both translation and post-editing process, with the focus on methodology in eye-tracking and keylogging studies. Chapter 4 is a detailed report on the experimental study on the effects and correlations between aspects of translation training and information behaviour in translation and post-editing. The experimental study tested seven hypotheses about effects of task type and group membership on effort indicators, range of consulted OR, and translation accuracy. Correlational analyses were also made between accuracy and percentage of researched rich points, as well as percentage of time spent in OR with attitude and perceived effort which was also correlated with the range of consulted OR. Some of the hypotheses were partially confirmed, but the relationship between effort, accuracy, and attitude in information searching during translation and post-editing is intensely nuanced. The findings may be particularly valuable for translation trainers and translation process researchers
Proceedings of the Eighth Italian Conference on Computational Linguistics CliC-it 2021
The eighth edition of the Italian Conference on Computational Linguistics (CLiC-it 2021) was held at Università degli Studi di Milano-Bicocca from 26th to 28th January 2022. After the edition of 2020, which was held in fully virtual mode due to the health emergency related to Covid-19, CLiC-it 2021 represented the first moment for the Italian research community of Computational Linguistics to meet in person after more than one year of full/partial lockdown
Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm
Abstract— Online transportation has become a basic
requirement of the general public in support of all activities to go
to work, school or vacation to the sights. Public transportation
services compete to provide the best service so that consumers
feel comfortable using the services offered, so that all activities
are noticed, one of them is the search for the shortest route in
picking the buyer or delivering to the destination. Node
Combination method can minimize memory usage and this
methode is more optimal when compared to A* and Ant Colony
in the shortest route search like Dijkstra algorithm, but can’t
store the history node that has been passed. Therefore, using
node combination algorithm is very good in searching the
shortest distance is not the shortest route. This paper is
structured to modify the node combination algorithm to solve the
problem of finding the shortest route at the dynamic location
obtained from the transport fleet by displaying the nodes that
have the shortest distance and will be implemented in the
geographic information system in the form of map to facilitate
the use of the system.
Keywords— Shortest Path, Algorithm Dijkstra, Node
Combination, Dynamic Location (key words