{"id":"W2148708444","doi":"10.1145/1149982.1149988","title":"A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Memoization; Recursion (computer science); Programming language; Backtracking; Time complexity; Parsing; Theoretical computer science; Algorithm; Modular design; Top-down parsing","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.0002965266,0.0001732248,0.0002086187,0.0002051683,0.00009859943,0.0003735596,0.001130284,0.0001012865,0.00001603446],"category_scores_gemma":[0.0001282754,0.0001582875,0.00002454997,0.0003063583,0.00002463878,0.0007425885,0.0007073591,0.000197138,0.00003246365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005676227,"about_ca_system_score_gemma":0.00005577965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002731031,"about_ca_topic_score_gemma":0.0003093828,"domain_scores_codex":[0.9986925,0.00006167944,0.0002318577,0.0004547423,0.000217313,0.0003419074],"domain_scores_gemma":[0.9990681,0.0001572812,0.00009110496,0.0005410443,0.00003041605,0.0001120382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000336535,0.00005505913,0.003580574,0.0000266504,0.00000570208,0.00009013443,0.001077366,0.00002111227,0.01405185,0.0005009876,0.01515768,0.9653992],"study_design_scores_gemma":[0.005073757,0.001620127,0.1220096,0.002309899,0.0001049972,0.0005133864,0.000163372,0.1085495,0.4846692,0.2105319,0.05885591,0.005598413],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6807165,0.004024692,0.2948066,0.01566724,0.0006515635,0.0008535496,0.00002890185,0.001685763,0.001565231],"genre_scores_gemma":[0.2988333,0.000003270201,0.7003128,0.0003909606,0.0001501226,0.000001663092,0.00000732811,0.000009616686,0.0002909141],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9598008,"threshold_uncertainty_score":0.6454776,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007901481672039504,"score_gpt":0.2541193857042048,"score_spread":0.2462179040321653,"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."}}