{"id":"W2071685823","doi":"10.1007/s002360000037","title":"Efficiently building a parse tree from a regular expression","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Parse tree; Parsing; Computer science; String (physics); Theory of computation; Tree (set theory); Regular expression; Representation (politics); Time complexity; Parsing expression grammar; Rule-based machine translation; Context (archaeology); Theoretical computer science; S-attributed grammar; Algorithm; Artificial intelligence; Context-free grammar; L-attributed grammar; Mathematics; Programming language; Combinatorics","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.0002221318,0.0001450048,0.0001677138,0.00007011356,0.0001450876,0.0002573608,0.001046447,0.00006607582,0.0004719384],"category_scores_gemma":[0.00003556237,0.0001152194,0.00006996842,0.0002359754,0.00003714444,0.00138974,0.000200598,0.0001142085,0.0004815801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002286132,"about_ca_system_score_gemma":0.0000259382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001443778,"about_ca_topic_score_gemma":4.696008e-7,"domain_scores_codex":[0.9988283,0.00003486835,0.0003342646,0.0001830996,0.0003090244,0.0003104743],"domain_scores_gemma":[0.998804,0.0001407363,0.00008661456,0.0008357471,0.00001828989,0.0001146558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003801852,0.0001649995,0.00005138201,0.00003559939,0.00003530694,0.0000296161,0.01280311,0.000253675,0.02544765,0.02201578,0.01584723,0.9232776],"study_design_scores_gemma":[0.0014761,0.0001444327,0.001967787,0.0004517284,0.00002040291,0.00004784707,0.0003342541,0.7297812,0.06331852,0.02239158,0.1792775,0.0007886083],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.916049,0.00005976435,0.06382956,0.0004145597,0.000143947,0.000152709,0.000006173874,0.0004152546,0.01892904],"genre_scores_gemma":[0.9343826,0.00001288764,0.06448846,0.0008451972,0.0000467446,0.00001325126,0.000007370376,0.000007326315,0.0001961483],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.922489,"threshold_uncertainty_score":0.6189898,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005874499761680074,"score_gpt":0.2030990138928541,"score_spread":0.197224514131174,"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."}}