{"id":"W1581173031","doi":"10.1007/3-540-32390-2_8","title":"A Look-Ahead Branch and Bound Pruning Scheme for Trie-Based Approximate String Matching","year":2008,"lang":"en","type":"book-chapter","venue":"Advances in soft computing","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Trie; Pruning; Benchmark (surveying); String (physics); Levenshtein distance; String searching algorithm; Algorithm; Approximate string matching; Computation; Mathematics; Matching (statistics); Element (criminal law); A priori and a posteriori; Computer science; Combinatorics; Pattern matching; Data structure; Artificial intelligence; 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.001316772,0.0008577789,0.002370875,0.002950821,0.001236299,0.002077834,0.003538278,0.001752398,0.009806362],"category_scores_gemma":[0.006600225,0.0008340903,0.001056274,0.005948418,0.0008753522,0.003385273,0.002606202,0.002142555,0.003492083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001205289,"about_ca_system_score_gemma":0.002128081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004488095,"about_ca_topic_score_gemma":0.007511826,"domain_scores_codex":[0.9979709,0.0002729676,0.0002146953,0.0002805291,0.001098662,0.0001622389],"domain_scores_gemma":[0.9972108,0.001010223,0.0001351299,0.0009887281,0.0005629264,0.00009215656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000456486,0.0002390648,0.000445303,0.0002112071,0.00008242451,0.0001080943,0.0001551084,0.0547074,0.01103644,0.0243327,0.01575121,0.8924745],"study_design_scores_gemma":[0.0001066886,0.0001672039,0.0004139867,0.00005800906,0.00008903332,0.0003018238,0.00008430985,0.9284138,0.0130198,0.04491092,0.01237864,0.00005576985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008806258,0.0008992586,0.9827254,0.0002030481,0.0001476202,0.0001696141,0.0003386582,0.003243852,0.003466198],"genre_scores_gemma":[0.05463108,0.0004231286,0.9378639,0.0001554005,0.00006680357,0.0001865152,0.001065227,0.0003194575,0.005288364],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009806362,"threshold_uncertainty_score":0.03280556,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01958908214814302,"score_gpt":0.2718124686346245,"score_spread":0.2522233864864815,"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."}}