{"id":"W2155575074","doi":"10.1007/11551188_1","title":"Enhancing Trie-Based Syntactic Pattern Recognition Using AI Heuristic Search Strategies","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Trie; Beam search; Computer science; Benchmark (surveying); Pruning; Heuristic; A priori and a posteriori; String (physics); Levenshtein distance; Algorithm; Quadrilateral; Search tree; Search algorithm; Tree (set theory); Artificial intelligence; Combinatorics; Mathematics; Finite element method; Data structure; Physics","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.0006143546,0.0009434812,0.00123198,0.002054856,0.000468724,0.00147166,0.001548215,0.001207381,0.008513106],"category_scores_gemma":[0.003489083,0.0004358688,0.000804737,0.001823795,0.0005126777,0.002364882,0.0009162381,0.001091753,0.003305301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004413314,"about_ca_system_score_gemma":0.0009602742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002775808,"about_ca_topic_score_gemma":0.00447392,"domain_scores_codex":[0.9994728,0.0001057196,0.00005121142,0.0001155646,0.0001983986,0.00005636093],"domain_scores_gemma":[0.9980452,0.0009703135,0.00009528345,0.0002791614,0.0005590828,0.00005096815],"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.0003007315,0.0002992646,0.0008637442,0.0002680463,0.00009946376,0.000282737,0.0001898905,0.05900735,0.0485196,0.01107069,0.006942651,0.8721558],"study_design_scores_gemma":[0.00003526106,0.00007432922,0.000238748,0.00001588542,0.00004978781,0.0002260082,0.0001017807,0.9709533,0.01752849,0.008303205,0.002453664,0.00001950295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04130086,0.0003181023,0.9435402,0.0001979693,0.00009970988,0.0001589028,0.0001984877,0.005457828,0.008727983],"genre_scores_gemma":[0.2780601,0.0003609819,0.7118014,0.0003323197,0.00007259296,0.0002121268,0.0009223457,0.0006398286,0.007598308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008513106,"threshold_uncertainty_score":0.02847916,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03541699996764469,"score_gpt":0.2876636114597496,"score_spread":0.2522466114921049,"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."}}