{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480127,0.0004579004,0.001335356,0.00145398,0.0008549755,0.001700709,0.001885349,0.001963658,0.003271535],"category_scores_gemma":[0.01689477,0.0005397728,0.001151307,0.001945998,0.001491357,0.00424842,0.002121557,0.001230382,0.0007668092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001260372,"about_ca_system_score_gemma":0.002011301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003932812,"about_ca_topic_score_gemma":0.003898408,"domain_scores_codex":[0.9974753,0.000617101,0.0002215424,0.0006864103,0.0007919234,0.0002077357],"domain_scores_gemma":[0.9906436,0.006344633,0.0003282606,0.001959032,0.0005986823,0.0001257041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009832468,0.0002788561,0.003707501,0.0003928674,0.0002115165,0.0009871289,0.0008253571,0.4315696,0.01890913,0.2432854,0.004253461,0.294596],"study_design_scores_gemma":[0.00003224006,0.00005712172,0.0003484056,0.00002265714,0.0000382535,0.0001474016,0.00007876665,0.7704337,0.007565314,0.2199547,0.001303604,0.00001771837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07982592,0.0001957708,0.9155418,0.0002742441,0.0000780832,0.00006990701,0.0003428264,0.001954576,0.001716871],"genre_scores_gemma":[0.6845078,0.0001388496,0.311034,0.0001672233,0.00005197428,0.0001464239,0.000894751,0.0003720667,0.002686982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003932812,"threshold_uncertainty_score":0.01094431,"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."}}