{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003594043,0.00007044114,0.00006795552,0.00002314412,0.0002075347,0.000009387721,0.000464856,0.00004048332,0.00001945439],"category_scores_gemma":[0.00008926418,0.00003859079,0.00004519432,0.0001931107,0.002539109,0.000002596872,0.0002410432,0.00006842105,0.000007822094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006309453,"about_ca_system_score_gemma":0.00003561907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001131048,"about_ca_topic_score_gemma":1.177314e-7,"domain_scores_codex":[0.9992564,0.00006501713,0.0000988333,0.0002291506,0.0001737765,0.0001768095],"domain_scores_gemma":[0.9995486,0.00006516392,0.00003330232,0.0002312934,0.00006847938,0.00005313943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000477076,0.00004341395,0.0003145628,0.000001134479,0.000003302513,0.000002738281,0.00002526681,0.00005900309,0.1265858,0.8703355,0.0001298832,0.002451784],"study_design_scores_gemma":[0.00066681,0.003830059,0.01739497,0.00004193881,0.00001092948,0.00009347825,0.00002294155,0.03404949,0.8306467,0.1110343,0.001730276,0.0004781292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9355669,0.00001019192,0.0618473,0.0002769226,0.0001162567,0.00005391134,7.19175e-7,0.00000904792,0.002118755],"genre_scores_gemma":[0.9975253,0.000008369851,0.001911424,0.0004508241,0.00008850219,5.910952e-7,0.000001639033,0.000002399231,0.00001100069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7593011,"threshold_uncertainty_score":0.9355452,"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."}}