基于餐饮评论数据的情感分析（主要涉及到短文分类，分别使用朴素贝叶斯、支持向量机、Xgboost 进行情感值的二分类） 本文主要通过情感分析来挖掘评论中有价值的信息。 获取所研究数据，即大众点评餐饮评论数据，通过分词去除停用词、词性标注等操作进行数据预处理，然后通过机器学习的方法来分析餐饮评论的情感极性，来进一步挖掘评论中有价值的信息。 使用python的结巴分词工具对中文文本进行分词。可用TF-IDF、词袋方法提取文本数据的特征。然后使用机器学习的方法进行文本分类，可以运用朴素贝叶斯（NB）、支持向量机（SVM）、随机森林等算法。查询了资料，考虑了速度、容错性、变量筛选能力、共性容忍度等因素，初步设想选用SVM算法。 ===》SVM算法优于NB 优于随机森林

短文改错解题技巧教学课件 (共27张PPT).ppt

gsdmm-short-text-topic-modeling:GSDMM的短文本主题建模实现

Fall in Love with English 爱上英语 Hiding behind the loose dusty curtain, a teenager packed up his overcoat into the suitcase. He planned to leave home at dusk though there was thunder and lightning outdoors. He had got to do this because he was tired of his parents’ nagging about his English study and did not want to go through it any longer. He couldn’t get along well with English and disliked joining in English classes because he thought his teacher ignored him on purpose. As a result, his score in each exam never added up to over 60. His partner was concerned about him very much. She understood exactly what he was suffering from, but entirely disagreed with his idea. In order to calm him down and settle his problem, she talked with him face to face and swapped a series of learning tips with him. The items she set down helped him find the highway to studying English well. The teenager was grateful and got great power from his friend’s words. Now, he has recovered from being upset and has fallen in love with English. 有个少年躲在积满灰尘的松散窗帘后把大衣装入手提箱。尽管外面正打雷闪电， 他仍计划在黄昏时分离家出走。他不得不这样做是因为厌倦了父母对他英语学习的唠叨，不想再忍受下去了。他的英语学习总是无法取得进展，而且不喜欢参加英语课的学习，因为他以为老师有意忽视他。结果，他每次考试的分数合计从未超过60。 他的搭档很关心他，也确切地理解他遭受的折磨，但却完全不同意他的想法。为了使他冷静下来好好解决问题，她和他面对面地交谈，并交换了一系列的学习心得技巧。她写下来的条款帮助他找到了学好英语的最佳捷径。 这个少年非常很感激，并从朋友的话里获得极大的动力。现在，他已经从沮丧中恢复过来，真正爱上了英语 Different Countries Have Different Kinds of Englishes

40篇英语短文搞定高考3500个单词（word简洁版），可以直接打印，欢迎下载。

ijk英语单词批量翻译是一框单词翻译软件，用于批量翻译单词，并显示音标和单词等级，如是中考单词，还是高考，四、六级、考研、雅思、gre词汇。将要翻译的单词，整段句子，文章

基于深度学习的短文本语义相似度计算，通过深度学习的思想计算语义相似度

日语N1词汇短文阅读必备

1、输入一段100—200字的英文短文，存入一文件a中。 2、写函数统计短文出现的字母个数n及每个字母的出现次数 3、写函数以字母出现次数作权值，建Haffman树（n个叶子），给出每个字母的Haffman编码。 4、用每个字母编码对原短文进行编码，码文存入文件b中。 5、用Haffman树对b中码文进行译码，结果存入文件c中，比较a,c是否一致，以检验编码、译码的正确性。

调用百度AI平台上的短文本相似度API，调用api接口，实现测试。