{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001366988,0.0001089112,0.0001640966,0.0001655654,0.0002694524,0.0002975411,0.0002706487,0.00003620972,0.000007070279],"category_scores_gemma":[0.000001408954,0.0000979971,0.00008789724,0.0005752218,0.00001632923,0.0002069161,0.00006827917,0.00004572707,0.000001493169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001408953,"about_ca_system_score_gemma":0.00001844029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004527892,"about_ca_topic_score_gemma":0.0000641115,"domain_scores_codex":[0.9990889,0.00001098695,0.0002363845,0.000384019,0.0001227574,0.0001569872],"domain_scores_gemma":[0.9993103,0.00005923007,0.0001299949,0.0003852282,0.00006551576,0.00004969272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002368237,0.0001923257,0.001266957,0.0000306982,0.00007387656,2.481314e-7,0.00001902776,0.8612311,0.001264507,0.01576217,0.00004275333,0.1201139],"study_design_scores_gemma":[0.0003050072,0.000009517796,0.001690336,0.000006068098,0.0001081882,6.053278e-7,0.00001220748,0.9957336,0.000433345,0.001207175,0.0003691204,0.0001248157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009664464,0.00005952648,0.9982688,0.000179569,0.00000783965,0.000284815,0.00009040062,0.00007368875,0.00006885765],"genre_scores_gemma":[0.7591498,0.00000789971,0.2399257,0.00009361569,0.0000816887,0.0003074328,0.0003830809,0.00000854148,0.00004224807],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7583432,"threshold_uncertainty_score":0.3996206,"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."}}