[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fZhU1TFKUfNp0WAUpR7wQ-M4AECYZ9P0xfB1C9ToYRkU":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":8,"question":12,"related":13,"source":24,"type":96},[],"2023-12-28 20:20:03",123409713,[],{"courseId":9,"courseImg":10,"courseName":11},"8be8b7530d838ed758790ac4c40e37b5","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F48eba3395437dd881b1b9275a0ad1028.png","自然语言处理入门","当词典大小为n时,最坏情况下字典树的复杂度是______",[14,26,35,44,53,60,69,77,84,93],{"answer":15,"createTime":16,"id":17,"options":18,"question":23,"source":24,"type":25},[],"2023-10-21 20:04:47",101016712,[19,20,21,22],"基于规则的专家系统","基于统计的学习方法","深度学习方法","机器学习方法","以下图示最有可能是_______的流程\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ffbe3e2725cfc63914e4fa58bd98cd07b.png\">","v1",0,{"answer":27,"createTime":16,"id":28,"options":29,"question":34,"source":24,"type":25},[],101016714,[30,31,32,33],"监督学习","非监督学习","分类","聚类","以下最有可能是_______ 的流程\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd03daf9243a861c789be61c8805f943e.png\">",{"answer":36,"createTime":16,"id":37,"options":38,"question":43,"source":24,"type":25},[],101016716,[39,40,41,42],"pku语料库主要用于分词","pku语料库前后标注不一致","pku语料库主要以短词为主","pku语料库主要用于经济学领域","先 有 通货膨胀 干扰 , 后 有 通货 紧缩 叫板 .这是pku语料库的一句话,由此我们可以看出",{"answer":45,"createTime":16,"id":46,"options":47,"question":52,"source":24,"type":25},[],101016718,[48,49,50,51],"正向最长匹配","逆向最长匹配","完全切分","无法判断","就读北京大学--------[就、就读、读、北、北京、北京大学、京、大、大学、学],能实现以上切分的算法是",{"answer":54,"createTime":16,"id":55,"options":56,"question":59,"source":24,"type":25},[],101016720,[48,49,57,58],"双向最长匹配","全切分算法","欢迎新老师生前来就餐, [欢, 迎新, 老, 师生, 前来, 就餐] 能实现以上结果的算法是",{"answer":61,"createTime":16,"id":62,"options":63,"question":68,"source":24,"type":25},[],101016722,[64,65,66,67],"字典树","treemap","BinTrie","AC自动机","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F5490d59d31c3f1542585f84ddfb599e0.png\"> 以上图示是两种不同的字典树分词速度对比,其中蓝色最有可能是",{"answer":70,"createTime":16,"id":71,"options":72,"question":76,"source":24,"type":25},[],101016724,[67,73,74,75],"双数组字典树","前缀树","后缀树","p = base[b] + c check[p] = base[b] 以上公式和以下哪个选项有关",{"answer":78,"createTime":16,"id":79,"options":80,"question":83,"source":24,"type":25},[],101016725,[73,81,82,67],"基于前缀树的双数组字典树","基于后缀树的双数组字典树","以下哪种数据结构更加适合全切分",{"answer":85,"createTime":16,"id":86,"options":87,"question":92,"source":24,"type":25},[],101016726,[88,89,90,91],"词性识别","分词","简繁转换","拼音转换","字典树的常用应用不包括",{"answer":94,"createTime":5,"id":6,"options":95,"question":12,"source":24,"type":96},[],[],2]