{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00117872,0.001244697,0.00151483,0.00131016,0.001521416,0.003141669,0.002745762,0.002302095,0.01185325],"category_scores_gemma":[0.003782851,0.00152701,0.002047984,0.002106949,0.001264807,0.005136888,0.002854632,0.002754296,0.005096169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001153489,"about_ca_system_score_gemma":0.002048393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003821379,"about_ca_topic_score_gemma":0.004961075,"domain_scores_codex":[0.9988227,0.0001745288,0.0001216587,0.000467248,0.0002777485,0.0001359483],"domain_scores_gemma":[0.9980378,0.001102007,0.0000584326,0.0003931515,0.0003377178,0.00007092051],"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.0003451713,0.0002575688,0.000832524,0.0003051672,0.00009835047,0.0004324108,0.0005250148,0.02167277,0.02381966,0.07948453,0.02691817,0.8453088],"study_design_scores_gemma":[0.0001927444,0.0001115203,0.0007224596,0.000084874,0.0001916194,0.000806444,0.0002698691,0.6838999,0.05866334,0.221762,0.03315092,0.0001443316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007261025,0.000116283,0.9744124,0.0002155874,0.0000624039,0.0001070766,0.0003094877,0.015215,0.002300756],"genre_scores_gemma":[0.058798,0.0001062476,0.9343457,0.000171396,0.0000356609,0.0001418547,0.001500629,0.001554083,0.003346417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01185325,"threshold_uncertainty_score":0.03965306,"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."}}