{"id":"W2053288014","doi":"10.1142/s0129054109007005","title":"AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS","year":2009,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"Strong","keywords":"Indeterminate; Algorithm; Matching (statistics); Computer science; String searching algorithm; Pattern matching; Hybrid algorithm (constraint satisfaction); Successor cardinal; Mathematics; Artificial intelligence","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.0008407883,0.0001474745,0.0002016357,0.0007772309,0.0001828254,0.0006104696,0.004345744,0.00002470986,0.000008316587],"category_scores_gemma":[0.00003227067,0.0001260473,0.00009704135,0.0003850985,0.0001612268,0.004603222,0.0002902298,0.0002291648,0.000006847742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001360515,"about_ca_system_score_gemma":0.0003190076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001728323,"about_ca_topic_score_gemma":5.06712e-7,"domain_scores_codex":[0.9973045,0.0000542159,0.000600274,0.0003260962,0.0015035,0.0002114006],"domain_scores_gemma":[0.9971134,0.0001120239,0.000717862,0.000460674,0.001430499,0.0001655336],"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.00001155339,0.0002298726,0.00002786442,6.33225e-7,0.00001416924,0.00005320038,0.0003142054,0.00413236,0.001045664,0.006365125,0.00006154732,0.9877438],"study_design_scores_gemma":[0.0007006717,0.001981449,0.01470629,0.00024374,0.000006674676,0.0004797863,0.00002230448,0.9451463,0.01062039,0.02543335,0.000414612,0.0002444287],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06609552,0.00001133703,0.9312893,0.0006750014,0.001717776,0.00005669265,0.00001081664,0.00002459589,0.0001189537],"genre_scores_gemma":[0.6796204,0.000007459391,0.3197837,0.0003288677,0.0002514375,4.105359e-7,0.000002198987,0.000002794946,0.000002700416],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9874994,"threshold_uncertainty_score":0.8075546,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0150100370285392,"score_gpt":0.3052397887745584,"score_spread":0.2902297517460192,"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."}}