{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003169538,0.0004193437,0.0004038489,0.0003081446,0.0005070514,0.001245902,0.0003169985,0.0001950506,0.00002128026],"category_scores_gemma":[0.000004769784,0.0004006726,0.00008177227,0.0002638504,0.0001840904,0.0004512643,0.00001541968,0.0004428881,0.00003602913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007897533,"about_ca_system_score_gemma":0.00009593366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001286192,"about_ca_topic_score_gemma":0.00009086126,"domain_scores_codex":[0.9972795,0.0002572239,0.000573627,0.0007979551,0.0005831322,0.0005086119],"domain_scores_gemma":[0.998489,0.0003649253,0.000168971,0.0006094254,0.0001571717,0.0002105162],"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.0004785277,0.002705925,0.0003947046,0.001545646,0.0003594221,0.00041783,0.002168667,0.7012502,0.00384937,0.01322253,0.002394499,0.2712127],"study_design_scores_gemma":[0.001495454,0.0006909774,0.0003310717,0.0008886877,0.0001066781,0.0001204391,0.0003404489,0.9880526,0.005003941,0.001175086,0.0009964773,0.0007981237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1015294,0.0003418532,0.8959538,0.0001366347,0.0007761622,0.0004319874,0.00009424802,0.0001627146,0.0005732309],"genre_scores_gemma":[0.9938563,0.0001478818,0.005400653,0.0001356586,0.0001405897,0.0000398766,0.00001902976,0.0000440326,0.0002160237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8923269,"threshold_uncertainty_score":0.9998445,"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."}}