{"id":"W2258074816","doi":"10.1016/j.ic.2016.02.001","title":"Approximate matching between a context-free grammar and a finite-state automaton","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Science and Technology; National Research Foundation of Korea","keywords":"Edit distance; Affine transformation; Automaton; Deterministic finite automaton; Computer science; Deterministic automaton; Finite-state machine; Nondeterministic finite automaton; Context (archaeology); Matching (statistics); Context-free language; Grammar; Theoretical computer science; State (computer science); Büchi automaton; Time complexity; State diagram; Algorithm; Mathematics; Automata theory; Artificial intelligence; Rule-based machine translation; Pure mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002191668,0.000105284,0.0001152436,0.0001233845,0.000158348,0.0003544575,0.000208151,0.00003833848,0.000001750607],"category_scores_gemma":[0.00003665309,0.00007327677,0.00001604363,0.0001097954,0.00003245411,0.002956077,0.0003170592,0.00004902301,0.00002136535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001572726,"about_ca_system_score_gemma":0.00002040046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003854273,"about_ca_topic_score_gemma":0.000002242552,"domain_scores_codex":[0.999219,0.00003297569,0.0002910765,0.0001349069,0.0001819059,0.0001401358],"domain_scores_gemma":[0.9993379,0.0001667419,0.000164121,0.0001859951,0.00006176982,0.00008346703],"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.000004500151,0.000003965709,0.000242971,0.00002304385,0.000005346913,8.759428e-7,0.001495473,0.00007934416,0.00001273178,0.008895049,0.0002176755,0.989019],"study_design_scores_gemma":[0.001909168,0.00009486603,0.014313,0.0001438261,0.000006313908,0.00003353218,0.0001334004,0.8910925,0.0001699983,0.08409957,0.007712306,0.0002915381],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05918144,0.00003731483,0.9393523,0.000820134,0.0000746855,0.0001355088,0.00002401162,0.0002006573,0.0001739519],"genre_scores_gemma":[0.9619388,0.00003439943,0.03764168,0.0003084632,0.00001907734,0.000009205924,0.00002937712,0.000003627031,0.0000153476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9887275,"threshold_uncertainty_score":0.3418042,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01215280178887532,"score_gpt":0.2335999126059589,"score_spread":0.2214471108170836,"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."}}