{"id":"W2171095728","doi":"10.1109/asru.1997.659106","title":"Techniques to achieve fast lexical access","year":2002,"lang":"en","type":"article","venue":"","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Lexicon; Language model; Pruning; Heuristic; Vocabulary; Artificial intelligence; Natural language processing; Task (project management); Overhead (engineering); Workstation; Word (group theory); Lexical database; Stack (abstract data type); Speech recognition; Programming language; Linguistics; WordNet","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.002146667,0.001741333,0.001479903,0.003682296,0.001909087,0.003193509,0.002846116,0.001577066,0.02254989],"category_scores_gemma":[0.009970726,0.00129164,0.001166556,0.003427372,0.001297841,0.007177548,0.005073031,0.002279378,0.01201085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005522973,"about_ca_system_score_gemma":0.001394421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001156254,"about_ca_topic_score_gemma":0.002374578,"domain_scores_codex":[0.9978192,0.000550069,0.000255571,0.0003294412,0.0007350488,0.0003105727],"domain_scores_gemma":[0.9944812,0.00265997,0.0002803344,0.001361903,0.001068071,0.0001485264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004681457,0.0002617713,0.0005240117,0.0006543057,0.00009106084,0.0004074938,0.0009323233,0.003527919,0.0500359,0.07277572,0.01864624,0.8516752],"study_design_scores_gemma":[0.001159474,0.0007312604,0.001282479,0.0003416421,0.0003476001,0.003820402,0.001130871,0.2233409,0.1084737,0.4318579,0.2271846,0.0003292435],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006078422,0.0008138153,0.9812992,0.0003055625,0.0001557776,0.0003768731,0.0001252011,0.00550692,0.005338335],"genre_scores_gemma":[0.06233121,0.0006011112,0.9283733,0.0003262252,0.0002141553,0.0007817656,0.0005476088,0.0006772951,0.006147295],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02254989,"threshold_uncertainty_score":0.07543695,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02907606266598196,"score_gpt":0.3124485945903496,"score_spread":0.2833725319243677,"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."}}