MétaCan
Menu
Back to cohort
Record W7098699062

1 1 Statistical Machine Translation Using Monolingual Corpora

2008· article· en· W7098699062 on OpenAlexaboutno aff

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicHistory of Computing Technologies
Canadian institutionsnot available
Fundersnot available
KeywordsMachine translationNoveltyLexiconMatching (statistics)Rule-based machine translationExample-based machine translationStatistical modelRange (aeronautics)
DOInot available

Abstract

fetched live from OpenAlex

Since the eighties, new approaches in machine translation have been explored. These new approaches are usually based on statistical and pattern matching techniques. Currently, all SMT approaches are based on very large parallel corpora or bitexts. A statistical model is trained on these bitexts and then used to translate new sentences. One big disadvantage for this approach is the fact that for most languages, there are almost no large bitexts available. On the other hand, more and more reasonably large monolingual corpora are becoming available for a wide range of languages. The novelty in the METIS project is the elimination of the use of bitexts altogether. It aims to investigate the possibility of developing a reasonable SMT system without relying on bilingual corpora. Instead, the proposed system will rely on large corpora of monolingual texts, together with some standard linguistic technology and the use of a bilingual lexicon and tag-mapping rules. 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.004
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.017
Threshold uncertainty score0.057

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.012
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0060.009
Science and technology studies0.0010.001
Scholarly communication0.0050.006
Open science0.0020.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0170.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.095
GPT teacher head0.277
Teacher spread0.182 · 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 designSimulation or modeling
Domainnot available
GenreMethods

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

Citations0
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicHistory of Computing TechnologiesFrench-language works237,207