{"id":"W4378384185","doi":"10.31234/osf.io/54z93","title":"Formalizing theories of storage versus computation with Tree-based Grammars","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute; McGill University; Canadian Institute for Advanced Research","funders":"University of California, Davis; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Rule-based machine translation; Computer science; Tree (set theory); Computation; Tree-adjoining grammar; Theoretical computer science; L-attributed grammar; Artificial intelligence; Programming language; Natural language processing; Mathematics; Context-free grammar; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.003813807,0.0007685075,0.0007874986,0.001649405,0.001220165,0.004812734,0.002966716,0.001916343,0.005579941],"category_scores_gemma":[0.01242469,0.0007501663,0.002204166,0.001951283,0.00831358,0.01866269,0.004113514,0.003078342,0.001005882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001944971,"about_ca_system_score_gemma":0.001773662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0023237,"about_ca_topic_score_gemma":0.002216824,"domain_scores_codex":[0.9981329,0.0006191896,0.0001482964,0.0003845395,0.0005344849,0.0001806954],"domain_scores_gemma":[0.9932636,0.003967077,0.0004089933,0.001643075,0.0005270916,0.0001901156],"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.000009287808,0.000007463953,0.0001461152,0.0000381354,0.000008611923,0.00004426408,0.0002996545,0.005559184,0.0004160493,0.9882934,0.000306753,0.004871068],"study_design_scores_gemma":[0.000005096199,0.00000442052,0.00002966844,0.000019682,0.000004919379,0.00003152105,0.00005249424,0.01695445,0.0003219415,0.9812458,0.001323854,0.00000625323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01593817,0.0005123445,0.9746312,0.001081245,0.00006554955,0.00003501047,0.0001400356,0.0003724261,0.00722398],"genre_scores_gemma":[0.4580284,0.001518806,0.5321838,0.0007590852,0.0002345137,0.0003120253,0.0007228437,0.0006909108,0.005549737],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005579941,"threshold_uncertainty_score":0.02016956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03115944867485839,"score_gpt":0.2980645078517889,"score_spread":0.2669050591769305,"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."}}