﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-尼克舅姑-最新评论</title><link>http://www.cppblog.com/NickGu/CommentsRSS.aspx</link><description>Nick9Gu</description><language>zh-cn</language><pubDate>Wed, 07 Oct 2009 16:29:38 GMT</pubDate><lastBuildDate>Wed, 07 Oct 2009 16:29:38 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 贝叶斯分类器实验</title><link>http://www.cppblog.com/NickGu/archive/2009/10/10/98058.html#98214</link><dc:creator>Nick9Gu</dc:creator><author>Nick9Gu</author><pubDate>Sat, 10 Oct 2009 01:37:00 GMT</pubDate><guid>http://www.cppblog.com/NickGu/archive/2009/10/10/98058.html#98214</guid><description><![CDATA[@argmax<br>恩，我到觉得既然在低频的时候相当于信息量就是确定的，在信息量确定的情况下无论用什么方法去估计都不会有太大差别。那么这时候用什么方法都只是一种因为不完全相信观察到的数据而平滑的过程。<img src ="http://www.cppblog.com/NickGu/aggbug/98214.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NickGu/" target="_blank">Nick9Gu</a> 2009-10-10 09:37 <a href="http://www.cppblog.com/NickGu/archive/2009/10/10/98058.html#98214#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 贝叶斯分类器实验</title><link>http://www.cppblog.com/NickGu/archive/2009/10/09/98058.html#98150</link><dc:creator>argmax</dc:creator><author>argmax</author><pubDate>Fri, 09 Oct 2009 05:45:00 GMT</pubDate><guid>http://www.cppblog.com/NickGu/archive/2009/10/09/98058.html#98150</guid><description><![CDATA[+1法不是为了求得实际概率，而是为了使得概率有意义，因为naive bayesian中需要用到iid条件，如果其中一个概率为0，那么整个概率就没有意义了，所以需要用到平滑方法。并且用最大似然估计的概率本身就存在偏差，因为毕竟用于统计的语料总是有限的。通常现在不用+1法来平滑，而是用dirichlet方法估计。但是本质上这几种方法对于最后的结果都是大同小异。<img src ="http://www.cppblog.com/NickGu/aggbug/98150.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NickGu/" target="_blank">argmax</a> 2009-10-09 13:45 <a href="http://www.cppblog.com/NickGu/archive/2009/10/09/98058.html#98150#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 贝叶斯分类器实验</title><link>http://www.cppblog.com/NickGu/archive/2009/10/08/98058.html#98095</link><dc:creator>Nick9Gu</dc:creator><author>Nick9Gu</author><pubDate>Thu, 08 Oct 2009 09:48:00 GMT</pubDate><guid>http://www.cppblog.com/NickGu/archive/2009/10/08/98058.html#98095</guid><description><![CDATA[@SE7EN<br>上面说的就是书上有一种+1方法。另外的方法应该就是可以通过对测试case分两部分去验证x/n的实际概率吧。<img src ="http://www.cppblog.com/NickGu/aggbug/98095.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NickGu/" target="_blank">Nick9Gu</a> 2009-10-08 17:48 <a href="http://www.cppblog.com/NickGu/archive/2009/10/08/98058.html#98095#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 贝叶斯分类器实验</title><link>http://www.cppblog.com/NickGu/archive/2009/10/08/98058.html#98085</link><dc:creator>SE7EN</dc:creator><author>SE7EN</author><pubDate>Thu, 08 Oct 2009 07:34:00 GMT</pubDate><guid>http://www.cppblog.com/NickGu/archive/2009/10/08/98058.html#98085</guid><description><![CDATA[请问你是怎么对低频概率进行光滑操作的?<img src ="http://www.cppblog.com/NickGu/aggbug/98085.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NickGu/" target="_blank">SE7EN</a> 2009-10-08 15:34 <a href="http://www.cppblog.com/NickGu/archive/2009/10/08/98058.html#98085#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: {解题报告}德黑兰2005 [PKU2894-2903]</title><link>http://www.cppblog.com/NickGu/archive/2009/09/03/66218.html#95199</link><dc:creator>N……小辉</dc:creator><author>N……小辉</author><pubDate>Thu, 03 Sep 2009 06:31:00 GMT</pubDate><guid>http://www.cppblog.com/NickGu/archive/2009/09/03/66218.html#95199</guid><description><![CDATA[请问一下可不可以 把Grate Hobby (pku 2900)这题的代码发给我呀！<br>soidnhp@126.com 呵呵……新手上路呀！很多都不懂.<img src ="http://www.cppblog.com/NickGu/aggbug/95199.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NickGu/" target="_blank">N……小辉</a> 2009-09-03 14:31 <a href="http://www.cppblog.com/NickGu/archive/2009/09/03/66218.html#95199#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: {NLP}几篇关于分词的论文的笔记，随时更新[未登录]</title><link>http://www.cppblog.com/NickGu/archive/2009/06/07/86900.html#87024</link><dc:creator>Nick9Gu</dc:creator><author>Nick9Gu</author><pubDate>Sun, 07 Jun 2009 15:34:00 GMT</pubDate><guid>http://www.cppblog.com/NickGu/archive/2009/06/07/86900.html#87024</guid><description><![CDATA[@argmax<br>对，最近都在看，只是还没更新上去，呵呵~<br>那篇论文相对早的了，没太复杂。<img src ="http://www.cppblog.com/NickGu/aggbug/87024.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NickGu/" target="_blank">Nick9Gu</a> 2009-06-07 23:34 <a href="http://www.cppblog.com/NickGu/archive/2009/06/07/86900.html#87024#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: {NLP}几篇关于分词的论文的笔记，随时更新</title><link>http://www.cppblog.com/NickGu/archive/2009/06/07/86900.html#86972</link><dc:creator>argmax</dc:creator><author>argmax</author><pubDate>Sun, 07 Jun 2009 03:38:00 GMT</pubDate><guid>http://www.cppblog.com/NickGu/archive/2009/06/07/86900.html#86972</guid><description><![CDATA[<a target="_new" href="http://aclweb.org/anthology-new/sighan.html">http://aclweb.org/anthology-new/sighan.html</a><img src ="http://www.cppblog.com/NickGu/aggbug/86972.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NickGu/" target="_blank">argmax</a> 2009-06-07 11:38 <a href="http://www.cppblog.com/NickGu/archive/2009/06/07/86900.html#86972#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: {NLP}几篇关于分词的论文的笔记，随时更新</title><link>http://www.cppblog.com/NickGu/archive/2009/06/07/86900.html#86971</link><dc:creator>argmax</dc:creator><author>argmax</author><pubDate>Sun, 07 Jun 2009 03:36:00 GMT</pubDate><guid>http://www.cppblog.com/NickGu/archive/2009/06/07/86900.html#86971</guid><description><![CDATA[你的描述中都没有涉及到特征的选取，更没有涉及模型。而这两个方面对于现在的概率分词是关键中的关键。至于第二个问题，如果满足一阶马尔可夫性质，都可以使用Viterbi解码，解码的复杂度是O(nk^2)，这里n是句子的长度，对于简单的分词为2（当然可以更大）。<br>SIGHAN的论文可以在网上找到。<img src ="http://www.cppblog.com/NickGu/aggbug/86971.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NickGu/" target="_blank">argmax</a> 2009-06-07 11:36 <a href="http://www.cppblog.com/NickGu/archive/2009/06/07/86900.html#86971#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: {NLP}几篇关于分词的论文的笔记，随时更新</title><link>http://www.cppblog.com/NickGu/archive/2009/06/06/86900.html#86946</link><dc:creator>stucsz</dc:creator><author>stucsz</author><pubDate>Sat, 06 Jun 2009 14:13:00 GMT</pubDate><guid>http://www.cppblog.com/NickGu/archive/2009/06/06/86900.html#86946</guid><description><![CDATA[是哪几篇文章，能给出处吗？<img src ="http://www.cppblog.com/NickGu/aggbug/86946.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NickGu/" target="_blank">stucsz</a> 2009-06-06 22:13 <a href="http://www.cppblog.com/NickGu/archive/2009/06/06/86900.html#86946#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: {NLP}几篇关于分词的论文的笔记，随时更新</title><link>http://www.cppblog.com/NickGu/archive/2009/06/06/86900.html#86923</link><dc:creator>argmax</dc:creator><author>argmax</author><pubDate>Sat, 06 Jun 2009 08:58:00 GMT</pubDate><guid>http://www.cppblog.com/NickGu/archive/2009/06/06/86900.html#86923</guid><description><![CDATA[看看SIGHAN的论文吧！<img src ="http://www.cppblog.com/NickGu/aggbug/86923.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/NickGu/" target="_blank">argmax</a> 2009-06-06 16:58 <a href="http://www.cppblog.com/NickGu/archive/2009/06/06/86900.html#86923#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>