{"id":"W2047848293","doi":"10.1007/s10044-006-0036-8","title":"A novel look-ahead optimization strategy for trie-based approximate string matching","year":2006,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Trie; Computer science; String (physics); String searching algorithm; Matching (statistics); Pattern recognition (psychology); Artificial intelligence; Algorithm; Pattern matching; Mathematics; Data structure; Statistics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007831275,0.0008805543,0.001955944,0.001696757,0.0007602,0.001433034,0.002418268,0.001339998,0.008076281],"category_scores_gemma":[0.003347624,0.0006266002,0.0007607699,0.003146454,0.0005348749,0.002302532,0.001818141,0.001363792,0.002943864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006396494,"about_ca_system_score_gemma":0.001404361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002626629,"about_ca_topic_score_gemma":0.003934308,"domain_scores_codex":[0.9987092,0.0001897316,0.0001111659,0.0002397285,0.0006359417,0.0001141458],"domain_scores_gemma":[0.9988292,0.000342219,0.00008569737,0.00038497,0.0002963076,0.00006149839],"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.0004612785,0.0003031244,0.0003905679,0.0001559361,0.00007747244,0.0001250731,0.00008960524,0.08127119,0.02995657,0.01777478,0.01146063,0.8579338],"study_design_scores_gemma":[0.00004931205,0.0001056195,0.0001877888,0.000008990717,0.00002840012,0.0001866777,0.00003796253,0.9729341,0.01198894,0.01010649,0.00433611,0.0000295102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004598535,0.0002179444,0.9923581,0.00009591067,0.00007038039,0.00005851613,0.00008701907,0.001374771,0.001138667],"genre_scores_gemma":[0.09450536,0.0002427669,0.898775,0.0001833308,0.00008649321,0.0001824993,0.0004873746,0.0003137995,0.005223287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008076281,"threshold_uncertainty_score":0.02701783,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02068117720156099,"score_gpt":0.2668556260348765,"score_spread":0.2461744488333155,"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."}}