{"id":"W6149320","doi":"10.1016/s0022-5347(17)49961-7","title":"An extension of recursive descent parsing for Boolean grammars","year":2004,"lang":"en","type":"article","venue":"The Journal of Urology","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Parsing expression grammar; Computer science; Programming language; Phrase structure grammar; Context-free grammar; Rule-based machine translation; Parsing; Correctness; Indexed grammar; Theoretical computer science; L-attributed grammar; Algorithm; 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.002112865,0.0008347899,0.0009140261,0.001160645,0.0006570882,0.001615652,0.002039658,0.001091835,0.005816661],"category_scores_gemma":[0.007515839,0.0007625613,0.002498882,0.001155995,0.001297558,0.003821229,0.002105186,0.001494224,0.002077548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009684053,"about_ca_system_score_gemma":0.001284443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007203623,"about_ca_topic_score_gemma":0.009089812,"domain_scores_codex":[0.9983957,0.0005472977,0.0001745511,0.0003701856,0.000348474,0.0001637021],"domain_scores_gemma":[0.9961306,0.002608665,0.0001273315,0.0006685582,0.0004061381,0.00005879389],"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.0003274127,0.0002233095,0.002382134,0.0007433023,0.00019599,0.0009714601,0.0009609613,0.0951014,0.01442488,0.3238003,0.01698383,0.5438851],"study_design_scores_gemma":[0.00006948401,0.00009841015,0.0005631714,0.00008597381,0.0001433813,0.0003974187,0.0000778648,0.6591854,0.01021534,0.3046391,0.02444495,0.00007940517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008451669,0.0001577964,0.9761771,0.0002499115,0.0000615458,0.0001347332,0.0005285405,0.0110316,0.003207191],"genre_scores_gemma":[0.1636385,0.000266167,0.8286107,0.0002791505,0.00008623815,0.0001538429,0.00188712,0.001882053,0.003196224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007203623,"threshold_uncertainty_score":0.01945871,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01716642154400374,"score_gpt":0.2928868631224541,"score_spread":0.2757204415784504,"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."}}