{"id":"W2042079117","doi":"10.1016/s0304-3975(02)00853-8","title":"A recognition and parsing algorithm for arbitrary conjunctive grammars","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"L-attributed grammar; Parsing expression grammar; Indexed grammar; Context-free grammar; Parsing; Computer science; Phrase structure grammar; Context-sensitive grammar; Time complexity; Algorithm; Tree-adjoining grammar; Rule-based machine translation; Definite clause grammar; Mathematics; Theoretical computer science; Programming language; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503992,0.00009659639,0.00009330217,0.00002595479,0.0002116059,0.00006395506,0.0001334462,0.00005993181,0.000005220244],"category_scores_gemma":[0.0001295952,0.00007398391,0.00003773953,0.0001133721,0.001274524,0.000006002926,0.00009992702,0.00005903668,0.000002550846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006342292,"about_ca_system_score_gemma":0.00003495393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.283908e-7,"about_ca_topic_score_gemma":8.662348e-8,"domain_scores_codex":[0.9990587,0.00006234784,0.0001084791,0.0004070196,0.00008814671,0.0002753028],"domain_scores_gemma":[0.999593,0.00006425936,0.00002820538,0.0001126559,0.00009342791,0.0001084596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004741211,0.00007280635,0.0001166019,0.000008984434,0.00001265049,0.000002794791,0.00004681309,0.000003645,0.06612735,0.194444,0.00003667156,0.7390803],"study_design_scores_gemma":[0.001213454,0.002737013,0.0005909078,0.0000466392,0.00002633904,0.0001479556,0.00005107788,0.06253785,0.2747513,0.6549114,0.002340272,0.0006458083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3311336,0.00005374258,0.6678456,0.00003646651,0.0001297242,0.0001260525,0.000004784797,0.00001202994,0.0006580221],"genre_scores_gemma":[0.7856578,0.000006708828,0.2137166,0.0004981319,0.00009806598,0.000005252454,0.00001023596,0.000004029459,0.000003234933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7384345,"threshold_uncertainty_score":0.4696036,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01796921826556223,"score_gpt":0.2474809605047613,"score_spread":0.2295117422391991,"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."}}