{"id":"W2115928329","doi":"10.1109/tai.2000.889840","title":"An assumptive logic programming methodology for parsing","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Datalog; Computer science; Parsing; Programming language; L-attributed grammar; Logic programming; Phrase structure grammar; Parsing expression grammar; Rule-based machine translation; Natural language processing; Artificial intelligence; S-attributed grammar; Theoretical computer science; Context-free grammar","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.0009607121,0.0001437062,0.0002294828,0.0000803772,0.0001899066,0.0002361584,0.0006369303,0.0001088827,0.00003798588],"category_scores_gemma":[0.00009470114,0.0001098478,0.0000901949,0.0002170973,0.00005218754,0.0004181219,0.00007138617,0.00008484683,0.00007212169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000311997,"about_ca_system_score_gemma":0.00001129919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004998623,"about_ca_topic_score_gemma":0.00002636321,"domain_scores_codex":[0.9984245,0.0002550874,0.000227408,0.0004831311,0.000137411,0.0004724051],"domain_scores_gemma":[0.9989544,0.0002789299,0.0001007449,0.0004467694,0.0001026685,0.0001165064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001935671,0.00008352532,0.0002341759,0.00001282179,0.00001398675,0.000005556505,0.001053201,0.000008705297,0.0001985682,0.6086798,0.00030394,0.3894038],"study_design_scores_gemma":[0.001748676,0.003463627,0.000485612,0.000008778199,0.00005241658,0.0002354814,0.001175794,0.2702044,0.005633438,0.3838294,0.3318505,0.001311906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003220183,0.0002342852,0.992567,0.000389319,0.0005295647,0.0004962771,1.842548e-7,0.0004598156,0.005001541],"genre_scores_gemma":[0.5009632,0.00000273558,0.4979653,0.0002425463,0.0001174689,0.00006881628,0.000001423498,0.00000710332,0.0006314077],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5006412,"threshold_uncertainty_score":0.4479463,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2144146801158825,"score_gpt":0.3568244027088954,"score_spread":0.1424097225930128,"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."}}