{"id":"W2119516574","doi":"10.1016/j.scico.2013.11.007","title":"Parse views with Boolean grammars","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Tree-adjoining grammar; Parsing; Parsing expression grammar; Phrase structure grammar; Rule-based machine translation; Programming language; Context-free grammar; L-attributed grammar; Natural language processing; Indexed grammar; S-attributed grammar; Negation; 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.0007330897,0.0001975004,0.0002365402,0.0003039041,0.0002218442,0.0008010395,0.002749622,0.00004338186,0.000006064794],"category_scores_gemma":[0.00002578538,0.0001392036,0.00005491083,0.001826467,0.0007211267,0.002483874,0.0006711236,0.0001833589,0.00002190073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004456684,"about_ca_system_score_gemma":0.000191783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008045429,"about_ca_topic_score_gemma":0.000004664731,"domain_scores_codex":[0.9976775,0.00003528831,0.000312395,0.000609969,0.000759677,0.0006051622],"domain_scores_gemma":[0.9983029,0.00003990332,0.0002346174,0.0007887655,0.0004490861,0.0001847315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001302799,0.00004951256,0.0003133461,0.00002704948,0.000004009362,0.000006482821,0.0004816751,0.00001236865,0.002516622,0.03042791,0.0001494517,0.9660103],"study_design_scores_gemma":[0.00202406,0.004556489,0.00483618,0.001809647,0.0000484161,0.0007216434,0.0003321212,0.4008455,0.3169142,0.2457882,0.01828799,0.003835458],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01889944,0.0003234782,0.9789187,0.0004525641,0.000168006,0.0004921188,1.423902e-7,0.0005976935,0.0001478403],"genre_scores_gemma":[0.3386397,0.000001531765,0.6611551,0.0001118878,0.00003122168,0.00003163669,3.36496e-7,0.000006785638,0.0000217609],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9621748,"threshold_uncertainty_score":0.7724442,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01395245520905636,"score_gpt":0.261069871613509,"score_spread":0.2471174164044526,"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."}}