{"id":"W2018116550","doi":"10.3115/1220355.1220445","title":"A path-based transfer model for machine translation","year":2004,"lang":"en","type":"article","venue":"","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Machine translation; Dependency grammar; Dependency (UML); Parsing; Artificial intelligence; Transfer-based machine translation; Path (computing); Natural language processing; Translation (biology); Synchronous context-free grammar; Tree (set theory); Graph; Transfer (computing); Language model; Word (group theory); Set (abstract data type); Example-based machine translation; Theoretical computer science; Programming language; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151827,0.0009293313,0.0008681622,0.001062454,0.0007943325,0.001043456,0.001829815,0.001715812,0.00713515],"category_scores_gemma":[0.003417788,0.0005727807,0.00122212,0.001611984,0.001071225,0.004526689,0.001365745,0.001737309,0.003362923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001051057,"about_ca_system_score_gemma":0.001613182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003933753,"about_ca_topic_score_gemma":0.003017063,"domain_scores_codex":[0.9992999,0.0002553208,0.00003684804,0.0001991517,0.0001455884,0.00006323346],"domain_scores_gemma":[0.9989955,0.0005894806,0.00006398065,0.0001373384,0.0001797778,0.00003396758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002544509,0.0001665327,0.0009103255,0.0002823372,0.0002055327,0.0003587876,0.000292152,0.5701314,0.005278661,0.1817958,0.01250593,0.227818],"study_design_scores_gemma":[0.00002387938,0.00005318395,0.0001197528,0.00001280922,0.00003048362,0.00008378556,0.00001249081,0.8316916,0.0009630783,0.1625113,0.004476225,0.00002149029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004314871,0.0003541319,0.9907362,0.000473988,0.0000872761,0.00005483587,0.000288279,0.001131959,0.002558515],"genre_scores_gemma":[0.4078487,0.002284195,0.5693876,0.0006704129,0.0003323987,0.0009319548,0.002530485,0.0006980794,0.01531618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00713515,"threshold_uncertainty_score":0.02386945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02413003566729511,"score_gpt":0.2734985460518554,"score_spread":0.2493685103845603,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}