{"id":"W2058621291","doi":"10.1016/j.ipl.2005.09.006","title":"Vertex covering by paths on trees with its applications in machine translation","year":2005,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Edge cover; Vertex cover; Vertex (graph theory); Path (computing); Combinatorics; Set cover problem; Enhanced Data Rates for GSM Evolution; Tree (set theory); Mathematics; Cover (algebra); Translation (biology); Computer science; Set (abstract data type); Algorithm; Time complexity; Discrete mathematics; Artificial intelligence; Graph","routes":{"ca_aff":true,"ca_fund":false,"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.0006968158,0.0005288571,0.0009406095,0.00164089,0.00129727,0.001240007,0.0009384284,0.001156055,0.004900102],"category_scores_gemma":[0.005296209,0.0005397334,0.001020581,0.004412056,0.001313903,0.002671715,0.001982617,0.001160877,0.0008767808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005017737,"about_ca_system_score_gemma":0.0005468774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002318605,"about_ca_topic_score_gemma":0.001864334,"domain_scores_codex":[0.9993829,0.0002322713,0.00003516564,0.0001569008,0.0001152298,0.00007763644],"domain_scores_gemma":[0.9960418,0.002928069,0.0002156661,0.000420973,0.0002365261,0.000157032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004919661,0.0001378512,0.001696031,0.000452813,0.00007149937,0.0005158956,0.0008119756,0.1304494,0.006560424,0.5171266,0.01241417,0.3292714],"study_design_scores_gemma":[0.0000247909,0.0000637684,0.0004231952,0.0000378376,0.00003308952,0.0001916638,0.00007207559,0.2637965,0.001946872,0.7237874,0.009601187,0.00002166788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07700977,0.002080202,0.9069874,0.0006871701,0.0001860925,0.0000859795,0.0004962714,0.001130353,0.01133674],"genre_scores_gemma":[0.3971783,0.002591128,0.5870802,0.0002299484,0.0003868522,0.0002179144,0.001236929,0.0005866779,0.01049199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004900102,"threshold_uncertainty_score":0.01639247,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006243725173338033,"score_gpt":0.2270362528958371,"score_spread":0.220792527722499,"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."}}