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