{"id":"W2104971205","doi":"10.1109/tsmcb.2005.861860","title":"On optimizing syntactic pattern recognition using tries and AI-based heuristic-search strategies","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Trie; Benchmark (surveying); Beam search; Heuristic; A priori and a posteriori; String (physics); String searching algorithm; Algorithm; Computer science; Search tree; Matching (statistics); Search algorithm; Levenshtein distance; Tree (set theory); Mathematics; Combinatorics; Artificial intelligence; Pattern matching; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001394924,0.001041702,0.001115005,0.001190976,0.0003244918,0.001103163,0.001393533,0.001135775,0.002501563],"category_scores_gemma":[0.004429231,0.0005283426,0.0006123126,0.001476489,0.001053162,0.001633152,0.0009680137,0.0006515203,0.0007960474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006213537,"about_ca_system_score_gemma":0.001403201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002824645,"about_ca_topic_score_gemma":0.003504088,"domain_scores_codex":[0.999234,0.0002918373,0.00005805008,0.000119015,0.000223201,0.0000739207],"domain_scores_gemma":[0.998053,0.001364286,0.0001503615,0.0001570605,0.0002360734,0.00003925832],"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.0002226871,0.00009646429,0.001397528,0.0002614498,0.0001106975,0.0001111985,0.0001560157,0.7421343,0.004874746,0.02596171,0.001526897,0.2231462],"study_design_scores_gemma":[0.00002416831,0.00007799119,0.0001285638,0.00001632296,0.00001712182,0.00004478837,0.00003700491,0.9909018,0.001288544,0.00665529,0.0008014635,0.000006922382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03490215,0.0005484296,0.9590229,0.0001779982,0.00003201732,0.0000939551,0.00005216742,0.001007638,0.004162749],"genre_scores_gemma":[0.2660893,0.0004782633,0.7295403,0.0002681654,0.00004655451,0.0003302316,0.0002374788,0.0002406575,0.002768958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002824645,"threshold_uncertainty_score":0.008368611,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03161134660042626,"score_gpt":0.2595385149312013,"score_spread":0.2279271683307751,"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."}}