{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009572686,0.000595633,0.0005489871,0.0009508368,0.0004667393,0.001634647,0.002466297,0.000338756,0.0000658972],"category_scores_gemma":[0.0000660633,0.0005517721,0.0001326769,0.0005877194,0.0003981015,0.001831241,0.00105908,0.001200348,0.00007017174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004823086,"about_ca_system_score_gemma":0.001576502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001514662,"about_ca_topic_score_gemma":0.0001203192,"domain_scores_codex":[0.9954247,0.00008664167,0.0006452972,0.001704987,0.001314466,0.0008239193],"domain_scores_gemma":[0.9971208,0.0006385713,0.0002964471,0.001353826,0.0003711687,0.0002192122],"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.000007137641,0.00003808871,0.00001184677,0.00008670775,0.000007257603,0.0001330628,0.0002376402,0.05037753,0.0004531404,0.0002758624,0.00000499187,0.9483668],"study_design_scores_gemma":[0.0003031252,0.0001498195,0.00003812416,0.001255734,0.00001357553,0.0000814187,4.730986e-7,0.9737827,0.003881344,0.01957587,0.0002160989,0.0007017275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003922532,0.0003157723,0.9967476,0.0003585206,0.001296226,0.000369226,0.00002089433,0.0001867616,0.0003127798],"genre_scores_gemma":[0.2671888,0.00003542953,0.7296284,0.001892542,0.001111783,0.000008170642,0.00003929971,0.00005916266,0.00003636622],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.947665,"threshold_uncertainty_score":0.9996934,"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."}}