{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004784004,0.000499809,0.0006690809,0.0002244961,0.0006244497,0.0002998496,0.0009247691,0.0002253339,0.000003792711],"category_scores_gemma":[0.0000506748,0.0005328229,0.0001179607,0.00009382724,0.0001433953,0.0009690162,0.000801806,0.0005941798,0.000004253648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008649009,"about_ca_system_score_gemma":0.0001454519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001745979,"about_ca_topic_score_gemma":0.00001318427,"domain_scores_codex":[0.9972574,0.00002390832,0.0006285122,0.001110104,0.0003924508,0.0005876295],"domain_scores_gemma":[0.9978678,0.000707345,0.0005448752,0.0006656916,0.00009524403,0.0001190769],"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.00003842977,0.00003371946,0.0001890911,0.0006231473,0.00002480794,0.00006619941,0.001013976,0.01028171,0.00006318763,0.02760619,0.0001009634,0.9599586],"study_design_scores_gemma":[0.001738283,0.0001064204,0.00003495069,0.003285995,0.00001231985,0.00006784764,0.00002218866,0.8464937,0.00006740695,0.04823705,0.09894416,0.0009896593],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006899684,0.01705662,0.9762102,0.00004794147,0.0004955385,0.00058528,0.00001744969,0.0002661842,0.004630816],"genre_scores_gemma":[0.02132354,0.001060855,0.9751805,0.000255845,0.000481668,0.00001653313,0.00007557141,0.0001095303,0.001495934],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9589689,"threshold_uncertainty_score":0.9997123,"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."}}