MétaCan
Menu
Back to cohort
Record W2185791191

TransSearch: What are translators looking for?

2008· article· en· W2185791191 on OpenAlexaff
Elliott Macklovitch, Guy Lapalme, Fabrizio Gotti

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsComputer scienceProductivityMachine translationQuality (philosophy)Production (economics)Artificial intelligenceNatural language processing
DOInot available

Abstract

fetched live from OpenAlex

Notwithstanding machine translation’s im-pressive progress over the last decade, many translators remain convinced that the output of even the best MT systems is not sufficient to facilitate the production of publication-quality texts. To increase their productivity they turn instead to translator support tools. We exam-ine the use of one such tool: TransSearch, an online bilingual concordancer. From the mil-lions of requests stored in the system’s logs over a 6-year period, we extracted and ana-lyzed the most frequently submitted queries, in an effort to characterize the kinds of prob-lems for which translators turn to this system for help. What we discover, somewhat sur-prisingly, is that our system seems particularly well-suited to help translate highly polyse-mous adverbials and prepositional phrases. 1

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.024
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.023
Threshold uncertainty score0.077

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.024
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.006
Science and technology studies0.0030.001
Scholarly communication0.0060.010
Open science0.0010.001
Research integrity0.0030.002
Insufficient payload (model declined to judge)0.0230.020

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.040
GPT teacher head0.290
Teacher spread0.250 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designObservational
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations11
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicNatural Language Processing TechniquesFrench-language works237,207