{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001327,0.001335243,0.001141701,0.001419201,0.001389581,0.002304218,0.002841556,0.001437488,0.01082356],"category_scores_gemma":[0.00357797,0.0009672988,0.00158333,0.001780249,0.00107755,0.004001223,0.002980292,0.002580106,0.005789606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008968825,"about_ca_system_score_gemma":0.002582364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003174736,"about_ca_topic_score_gemma":0.005062615,"domain_scores_codex":[0.9989532,0.0001421497,0.0001018455,0.0003121283,0.0003592222,0.000131361],"domain_scores_gemma":[0.9984877,0.0005155569,0.00006765609,0.000454973,0.000395811,0.00007835065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002394792,0.0002506193,0.0006134516,0.0004035156,0.0000812949,0.0003537078,0.0004961618,0.02669272,0.03027387,0.08314376,0.05172893,0.8057225],"study_design_scores_gemma":[0.0002044168,0.0001647587,0.0003851897,0.00009715562,0.000171835,0.0008335325,0.0001516979,0.6944884,0.03610992,0.1821775,0.08508892,0.0001267273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002106844,0.0001359522,0.9867801,0.0001625284,0.0001077003,0.00008543844,0.0001423487,0.007531522,0.002947566],"genre_scores_gemma":[0.02730739,0.0001528063,0.963415,0.0002509107,0.00007123015,0.0001528165,0.0006431607,0.001442545,0.00656416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01082356,"threshold_uncertainty_score":0.03620845,"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."}}