{"id":"W2898086057","doi":"10.3390/a11110165","title":"Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University; Saint Mary's University; University of Waterloo","funders":"","keywords":"Edit distance; Computer science; Nondeterministic algorithm; Cardinality (data modeling); Algorithm; Nondeterministic finite automaton; Correctness; Word (group theory); Automaton; Theoretical computer science; Mathematics; Automata theory","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.0008397037,0.0001790258,0.0002395871,0.00006288535,0.0002515349,0.00006848306,0.001141364,0.00006390064,0.00001171181],"category_scores_gemma":[0.00003380783,0.0001239018,0.000140257,0.000455118,0.0002961134,0.00008689307,0.0001483225,0.0001073494,0.00001202344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003315457,"about_ca_system_score_gemma":0.00003457438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004889732,"about_ca_topic_score_gemma":0.000004324661,"domain_scores_codex":[0.9984501,0.000069645,0.0003233126,0.000418701,0.0003334564,0.0004047913],"domain_scores_gemma":[0.9986007,0.0002753689,0.0001597207,0.0007496268,0.0001465276,0.00006809019],"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.00002768341,0.0002244757,0.00001513369,0.00007643013,0.0001140525,0.00002149989,0.02106145,0.0008864776,0.01051217,0.03478097,0.002326991,0.9299527],"study_design_scores_gemma":[0.0004995818,0.0001695082,0.0001646255,0.00004873532,0.00001600044,0.00002457956,0.0004278172,0.975329,0.01718581,0.001965462,0.003963411,0.0002055007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02804784,0.0004208322,0.9690594,0.0005999976,0.001138494,0.0003383634,0.00002168634,0.0001414948,0.0002319011],"genre_scores_gemma":[0.8536723,0.000002698749,0.1448545,0.0003693331,0.0009111713,0.00002071485,0.000006100844,0.00002255727,0.0001406573],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9744425,"threshold_uncertainty_score":0.505257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01009466810539971,"score_gpt":0.2554369351228916,"score_spread":0.2453422670174919,"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."}}