{"id":"W2129388736","doi":"10.1515/pralin-2015-0008","title":"A Python-based Interface for Wide Coverage Lexicalized Tree-adjoining Grammars","year":2015,"lang":"en","type":"article","venue":"˜The œPrague Bulletin of Mathematical Linguistics","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Python (programming language); Parsing; Programming language; Artificial intelligence; L-attributed grammar; Rule-based machine translation; Adjunction; Tree-adjoining grammar; Natural language processing; Tree (set theory); Abstract syntax tree; Tree structure; Grammar; Data structure; Context-free grammar; Mathematics; Linguistics","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.003633167,0.001789477,0.001311265,0.001653797,0.0008197383,0.002767181,0.004589034,0.001335251,0.06568135],"category_scores_gemma":[0.008036399,0.001824294,0.00214816,0.00104505,0.001801302,0.005071613,0.007680707,0.002918566,0.02989562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001577168,"about_ca_system_score_gemma":0.002412224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003252097,"about_ca_topic_score_gemma":0.002583715,"domain_scores_codex":[0.9977508,0.0004367007,0.0003448576,0.0004468002,0.0007309024,0.0002899598],"domain_scores_gemma":[0.9964886,0.001751526,0.0001969222,0.0006417846,0.0005901108,0.0003310755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.003253531,0.0008181136,0.007723795,0.002353606,0.0003119314,0.003815711,0.004303603,0.02592179,0.03801085,0.09655698,0.4278078,0.3891223],"study_design_scores_gemma":[0.0009778203,0.000194714,0.003761216,0.0004956051,0.0001022385,0.002009915,0.000374429,0.2928289,0.04743768,0.100711,0.5506079,0.0004986959],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.003481917,0.00006588502,0.5522884,0.000213896,0.00008801217,0.0004913838,0.004636191,0.4314214,0.007312934],"genre_scores_gemma":[0.1468162,0.0003459982,0.5927641,0.001498351,0.0001335157,0.003056054,0.0255049,0.204875,0.02500585],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.06568135,"threshold_uncertainty_score":0.219726,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03020264464375103,"score_gpt":0.296627339247077,"score_spread":0.2664246946033259,"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."}}