{"id":"W1482525343","doi":"10.1007/11496656_25","title":"A Simple Fast Hybrid Pattern-Matching Algorithm","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; McMaster University","funders":"","keywords":"Computer science; Alphabet; Algorithm; Simple (philosophy); Pattern matching; Matching (statistics); SIMPLE algorithm; Independence (probability theory); String searching algorithm; Theoretical computer science; Artificial intelligence; Mathematics","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007383723,0.0007610255,0.000687272,0.0007743763,0.0004605673,0.001103802,0.005326581,0.0002557501,0.00008360283],"category_scores_gemma":[0.00002836166,0.0006764947,0.00018934,0.000418621,0.0004109245,0.00145417,0.003918968,0.001165568,0.0001635463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003622345,"about_ca_system_score_gemma":0.0004368781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000107736,"about_ca_topic_score_gemma":0.00005332677,"domain_scores_codex":[0.9946157,0.0000407865,0.0006940704,0.002185724,0.001463529,0.001000198],"domain_scores_gemma":[0.9965206,0.0003486871,0.0003763709,0.002235596,0.0002049993,0.0003137134],"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.000001017192,0.00002598159,0.000007018288,0.00001388325,0.000007190878,0.0001783115,0.000267119,0.009278382,0.0000268248,0.0008803792,0.00009660517,0.9892173],"study_design_scores_gemma":[0.0002738382,0.0001058587,0.00005949702,0.0003425518,0.000006456429,0.0002008989,1.576385e-7,0.8910174,0.000532412,0.09389579,0.01268458,0.0008805107],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002752784,0.000483491,0.9950495,0.0004269408,0.001743797,0.0003411827,0.0000537273,0.0002992456,0.001574546],"genre_scores_gemma":[0.0256122,0.0001002913,0.9683928,0.003173772,0.002127914,0.00001410231,0.00005806771,0.00007846984,0.0004424205],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9883368,"threshold_uncertainty_score":0.9999331,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01146657252967673,"score_gpt":0.2415503263721917,"score_spread":0.230083753842515,"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."}}