{"id":"W2789336736","doi":"10.3390/languages3010006","title":"On Recursive Modification in Child L1 French","year":2018,"lang":"en","type":"article","venue":"Languages","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria; University of Toronto","funders":"","keywords":"Recursion (computer science); Merge (version control); Computer science; Universal grammar; Universality (dynamical systems); Grammar; Linguistics; Embedding; Schema (genetic algorithms); Minimalist program; Theoretical computer science; Syntax; Artificial intelligence; Programming language; Generative 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.000138659,0.00009005044,0.00008412833,0.0001490505,0.00005897795,0.0000698933,0.0006098288,0.00006448405,0.00002231758],"category_scores_gemma":[0.0001389358,0.00007523387,0.00001947992,0.0003612161,0.00004207032,0.0002233253,0.00008605888,0.0001533568,0.00008155232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004100527,"about_ca_system_score_gemma":0.00001336085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001537072,"about_ca_topic_score_gemma":0.00007077411,"domain_scores_codex":[0.9992501,0.00003879935,0.0001060668,0.0002809117,0.000152912,0.0001712635],"domain_scores_gemma":[0.9993842,0.00004597591,0.00005437182,0.0004352647,0.0000505274,0.0000297132],"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.00001395826,0.000167726,0.0004838013,0.00002840224,0.000009336042,0.0001225815,0.00994991,0.000004277626,0.005066178,0.7638761,0.006922491,0.2133553],"study_design_scores_gemma":[0.000898816,0.0008105303,0.01628247,0.0006961894,0.000008550049,0.0001106338,0.0002983667,0.007726075,0.4356728,0.5336689,0.002750375,0.001076348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2523823,0.008092832,0.6334158,0.01039247,0.0008316925,0.0009642825,0.00001231998,0.003226209,0.09068205],"genre_scores_gemma":[0.8661972,0.000005384003,0.1328591,0.0005869703,0.0001036853,0.00001454276,0.000003598574,0.000006111046,0.0002234294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6138148,"threshold_uncertainty_score":0.3067948,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009840454882455323,"score_gpt":0.293848008375082,"score_spread":0.2840075534926266,"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."}}