{"id":"W1702922849","doi":"10.1007/s10590-015-9172-5","title":"Complexity of alignment and decoding problems: restrictions and approximations","year":2015,"lang":"en","type":"article","venue":"Machine Translation","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Viterbi algorithm; Computer science; Parameterized complexity; Computational complexity theory; Sentence; Sequential decoding; Algorithm; Word (group theory); Polynomial; Iterative Viterbi decoding; List decoding; Theoretical computer science; Mathematics; Artificial intelligence; Block code","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002004724,0.00005430773,0.00007114062,0.0000816614,0.0000599975,0.00004193634,0.0000893715,0.00002424091,6.118941e-7],"category_scores_gemma":[0.00001946671,0.0000482016,0.000008991887,0.0001682623,0.00004933821,0.0003175398,0.00002988259,0.00005125639,1.800233e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000119698,"about_ca_system_score_gemma":0.00001733142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001203579,"about_ca_topic_score_gemma":0.00006525796,"domain_scores_codex":[0.9995381,0.00003136743,0.0001332104,0.0001254031,0.0001112592,0.00006066923],"domain_scores_gemma":[0.9997267,0.00003226801,0.00005401286,0.0001059556,0.00003991717,0.00004119527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001398567,0.0001386199,0.008675978,0.0002849963,0.00002506831,0.000001638683,0.01167835,0.0002200536,0.008883378,0.5383649,0.0001336086,0.4315794],"study_design_scores_gemma":[0.0005411467,0.0001051997,0.002516729,0.00006335576,0.00001655092,0.00002531494,0.0000338355,0.6126906,0.00415673,0.3794216,0.0002730006,0.000155905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007030793,0.002784388,0.9880714,0.001356274,0.00001992728,0.0001590491,0.000003731528,0.0001454236,0.0004289876],"genre_scores_gemma":[0.5557181,0.0000136486,0.4442388,0.00001233787,0.000003579029,0.000004843248,0.000003581453,0.000001718509,0.000003349533],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6124706,"threshold_uncertainty_score":0.1965604,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08034618598023999,"score_gpt":0.2992751910534103,"score_spread":0.2189290050731703,"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."}}