{"id":"W2188416243","doi":"10.1007/3-540-45007-6_32","title":"Boolean Grammars","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Tree-adjoining grammar; L-attributed grammar; Indexed grammar; Computer science; Context-sensitive grammar; Phrase structure grammar; Context-free grammar; Programming language; Rule-based machine translation; Definite clause grammar; Extended Affix Grammar; Parsing; Theoretical computer science; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001095863,0.0005911641,0.000534657,0.0007498396,0.0002596267,0.0006901421,0.004378326,0.0003360937,0.00005073212],"category_scores_gemma":[0.00007256954,0.000535365,0.0001783412,0.000602137,0.0007155632,0.0006284886,0.001173709,0.0008255665,0.0001431939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00025189,"about_ca_system_score_gemma":0.0003398063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001179872,"about_ca_topic_score_gemma":0.00002034197,"domain_scores_codex":[0.9959399,0.00004412096,0.0004981426,0.001699271,0.0009801042,0.0008385049],"domain_scores_gemma":[0.9970285,0.0003500184,0.0002530485,0.002000119,0.0001390892,0.0002292181],"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.00000183298,0.00002197576,0.00001561853,0.00002042498,0.000008912152,0.0001510508,0.000269466,0.002745442,0.00009711993,0.2525601,0.0001772866,0.7439308],"study_design_scores_gemma":[0.0002355347,0.0001252884,0.00002954207,0.0002566119,0.000006606047,0.0002114095,1.124438e-7,0.1476461,0.0009258822,0.8349147,0.01474118,0.00090704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002579045,0.0006681654,0.9857846,0.0009047185,0.002451904,0.000258125,0.00000324596,0.0002855404,0.009617901],"genre_scores_gemma":[0.02727629,0.0001183739,0.9575796,0.01196737,0.000649649,0.00001267677,0.000007291257,0.00009265588,0.002296087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7430238,"threshold_uncertainty_score":0.9997098,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01178501727695145,"score_gpt":0.222221227829735,"score_spread":0.2104362105527836,"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."}}