{"id":"W2082853563","doi":"10.1016/j.tcs.2008.01.037","title":"On the weight of universal insertion grammars","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Recursively enumerable language; Rule-based machine translation; Morphism; Mathematics; Regular language; Indexed grammar; Discrete mathematics; Computer science; Context-sensitive grammar; Programming language; Context-free grammar; Theoretical computer science; Natural language processing; Automaton","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.003060173,0.001072906,0.001905916,0.003679916,0.0022558,0.004480206,0.002602002,0.002697183,0.01005961],"category_scores_gemma":[0.03113515,0.001028529,0.0008981999,0.003672608,0.006700984,0.01341684,0.004907936,0.005208214,0.0009794761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001939169,"about_ca_system_score_gemma":0.0009709303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001367458,"about_ca_topic_score_gemma":0.001245869,"domain_scores_codex":[0.9975315,0.0007750208,0.0001060094,0.0003513106,0.0008195924,0.0004165591],"domain_scores_gemma":[0.9673227,0.02641935,0.001121626,0.002557336,0.001537847,0.001041099],"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.00006537647,0.0000149279,0.0003328515,0.00004450446,0.000009641881,0.00004139218,0.0001351357,0.002602747,0.0003249488,0.9866426,0.001077927,0.008707978],"study_design_scores_gemma":[0.000008489699,0.000004682894,0.00006235396,0.00001189643,0.000006030188,0.0000251786,0.00001696926,0.00676593,0.0001320162,0.9921666,0.0007939765,0.00000578892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4331505,0.004394356,0.4064735,0.01359584,0.001088606,0.00008336048,0.0006571256,0.0008059132,0.1397509],"genre_scores_gemma":[0.9608954,0.001703595,0.02062727,0.000894471,0.00117917,0.00009990919,0.0003374979,0.0004234028,0.01383931],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01005961,"threshold_uncertainty_score":0.03365272,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01029216834828971,"score_gpt":0.2142411529454825,"score_spread":0.2039489845971928,"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."}}