Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Elsa Cubel

dblp:44/5964 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Machine translation · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Machine translation
computer-assisted translation
0.012004
From Machine Translation to Computer Assisted Translation using Finite-State Models · EMNLP 2004
Automata and formal languages
finite-state models
0.012004
From Machine Translation to Computer Assisted Translation using Finite-State Models · EMNLP 2004
YearPublicationVenuePosition
2009 Statistical Approaches to Computer-Assisted Translation
abstract
Current machine translation (MT) systems are still not perfect. In practice, the output from these systems needs to be edited to correct errors. A way of increasing the productivity of the whole translation process (MT plus human work) is to incorporate the human correction activities within the translation process itself, thereby shifting the MT paradigm to that of computer-assisted translation. This model entails an iterative process in which the human translator activity is included in the loop: In each iteration, a prefix of the translation is validated (accepted or amended) by the human and the system computes its best (or n-best) translation suffix hypothesis to complete this prefix. A successful framework for MT is the so-called statistical (or pattern recognition) framework. Interestingly, within this framework, the adaptation of MT systems to the interactive scenario affects mainly the search process, allowing a great reuse of successful techniques and models. In this article, alignment templates, phrase-based models, and stochastic finite-state transducers are used to develop computer-assisted translation systems. These systems were assessed in a European project (TransType2) in two real tasks: The translation of printer manuals; manuals and the translation of the Bulletin of the European Union. In each task, the following three pairs of languages were involved (in both translation directions): English-Spanish, English-German, and English-French.
Sergio Barrachina 0001, Oliver Bender, Francisco Casacuberta, Jorge Civera, Elsa Cubel, Shahram Khadivi, Antonio L. Lagarda, Hermann Ney, Jesús Tomás, Enrique Vidal 0001, Juan Miguel Vilar
Comput. Linguistics5
2006 A Computer-Assisted Translation Tool based on Finite-State Technology
Jorge Civera, Antonio L. Lagarda, Elsa Cubel, Francisco Casacuberta, Enrique Vidal 0001, Juan Miguel Vilar, Sergio Barrachina 0001
EAMT3
2004 Finite-State Models for Computer Assisted Translation
Elsa Cubel, Jorge Civera, Juan Miguel Vilar, Antonio L. Lagarda, Francisco Casacuberta, Enrique Vidal 0001, David Picó, Luis Rodríguez
ECAI1
2004 From Machine Translation to Computer Assisted Translation using Finite-State Models
Jorge Civera, Elsa Cubel, Antonio L. Lagarda, David Picó, Enrique Vidal 0001, Francisco Casacuberta, Juan Miguel Vilar, Sergio Barrachina 0001
EMNLP2