<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[say_c_box的博客]]></title><description><![CDATA[只是为了记录]]></description><link>https://blog.youkuaiyun.com/say_c_box</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; say_c_box]]></copyright><item><title><![CDATA[【一起读ACL】Facebook的开放式问答系统（Reading Wikipedia to Answer Open-Domain Questions）]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/79809373</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/79809373</guid><author>say_c_box</author><pubDate>Tue, 03 Apr 2018 21:13:35 +0800</pubDate><description><![CDATA[Reading Wikipedia to Answer Open-Domain Questions这篇论文介绍了一个回答开放提问的模型。选择用维基百科中的一部分来作为答案。In order to answer any question, one must first retrieve the few relevant articles among more than 5 million items,]]></description><category></category></item><item><title><![CDATA[【一起读ACL论文】Attention-over-Attention Neural Networks for Reading Comprehension]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/79770586</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/79770586</guid><author>say_c_box</author><pubDate>Sat, 31 Mar 2018 16:27:00 +0800</pubDate><description><![CDATA[一种针对完形填空式阅读理解的模型。综合来看，大概是双向考虑了文档-&amp;gt;提问和提问-&amp;gt;文档的关系。思想和实现都是非常简单的，从实验结果来看效果不错。而且也容易扩展到其他模型上。



整个模型如上图所示。大概分为三个部分：


和传统模型类似，先把Document和Query都embedding出来（用的是GRU）。

根据向量表示计算出一个矩阵表示，记为Pair-wise Matchin...]]></description><category></category></item><item><title><![CDATA[用python从一个单词列表中快速生成word_to_ix字典]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/78847945</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/78847945</guid><author>say_c_box</author><pubDate>Tue, 19 Dec 2017 22:04:11 +0800</pubDate><description><![CDATA[#set函数创建一个无序不重复的元素集，可进行关系测试，删除重复数据。还可以计算交集，差集，并集。
vocab = set(test_sentence)
#enumerate函数用于将一个可遍历的数据对象组合为一个索引序列。同时列出数据和数据下标。
word_to_ix = {word: i for i, word in enumerate(vocab)}]]></description><category></category></item><item><title><![CDATA[pytorch+lstm实现的pos]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/78802770</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/78802770</guid><author>say_c_box</author><pubDate>Thu, 14 Dec 2017 15:01:43 +0800</pubDate><description><![CDATA[学了几天终于大概明白pytorch怎么用了 
这个是直接搬运的官方文档的代码 
之后会自己试着实现其他nlp的任务# Author: Robert Guthrieimport torch
import torch.autograd as autograd
import torch.nn as nn
import torch.nn.functional as F
import torch.optim]]></description><category></category></item><item><title><![CDATA[mmseg中文分词算法的python实现及其优化]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/78550749</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/78550749</guid><author>say_c_box</author><pubDate>Thu, 16 Nov 2017 14:23:31 +0800</pubDate><description><![CDATA[mmseg中文分词算法的python实现及其优化任务定义实现一个中文分词系统并对其性能做测试。输入输出该分词的训练语料取自人民日报1998年公开的语料库。为了保证测试的严谨性，选择另一份语料库做测试文档。该文档为SIGHAN（国际计算语言学会（ACL）中文语言处理小组）举办的国际中文语言处理竞赛中提供的pku_test_gold语料。方法描述mmseg算法理解mmseg本质上就是前向最大匹配+消除歧]]></description><category></category></item><item><title><![CDATA[python实现的基于hmm模型的词性标注系统]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/78550659</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/78550659</guid><author>say_c_box</author><pubDate>Thu, 16 Nov 2017 14:16:58 +0800</pubDate><description><![CDATA[python实现的基于hmm模型的词性标注系统任务定义实现一个词性标注系统，输入分好词的单词序列，输出一个词性标注后的结果序使用的语料库为人民日报98年公开语料库，一共约18000行语料。在用户交互模式下，所有语料库均用作训练。在文件读写模式下，前3000行语句用来做测试，后面的语句用来做训练。方法描述隐马尔科夫模型理解
隐马尔科夫模型是结构最简单的动态贝叶斯网络。描述由一个隐藏的马尔科夫链随机生成]]></description><category></category></item><item><title><![CDATA[基于python实现的mmseg中文分词算法实现及其优化]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/78463442</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/78463442</guid><author>say_c_box</author><pubDate>Tue, 07 Nov 2017 00:08:17 +0800</pubDate><description><![CDATA[mmseg中文分词算法的python实现及其优化mmseg算法理解mmseg本质上个人理解就是前向最大匹配+消除歧义规则+贪心，最简单的前向最大匹配就是，将每次从起点位置能匹配到的最长词语作为分词结果，连续进行下去。前向最大匹配符合人们的习惯，但是在某些语句中会产生歧义。例如北京大学生前来应聘，由于北京大学在词库中出现，所以前向最大匹配会分成北京大学/生/前来/应聘，显然这不是正确的分词结果。那么m]]></description><category></category></item><item><title><![CDATA[POJ 1821－－Fence(单调队列优化ｄｐ，总结一下)]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/78196640</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/78196640</guid><author>say_c_box</author><pubDate>Tue, 10 Oct 2017 19:53:13 +0800</pubDate><description><![CDATA[Fence




Time Limit: 1000MS
 
Memory Limit: 30000K


Total Submissions: 5185
 
Accepted: 1643





Description
A team of k (1 <= K <= 100) workers should paint a fence which contai]]></description><category></category></item><item><title><![CDATA[CodeForces - 55D——Beautiful numbers （数位dp）]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/78174191</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/78174191</guid><author>say_c_box</author><pubDate>Sun, 08 Oct 2017 12:24:25 +0800</pubDate><description><![CDATA[D. Beautiful numbers


time limit per test
4 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Volodya is an odd boy and his taste is]]></description><category></category></item><item><title><![CDATA[HDU3401 Trade (动态规划+单调队列)]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/77887014</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/77887014</guid><author>say_c_box</author><pubDate>Thu, 07 Sep 2017 21:13:25 +0800</pubDate><description><![CDATA[/*
知道之后n天的股票买卖价格（api，bpi），以及每天股票买卖数量上限（asi，bsi），问他最多能赚多少钱。开始时有无限本金，要求任两次交易需要间隔W天以上，即第i天交易，第i+w+1天才能再交易。同时他任意时刻最多只能拥有maxp的股票，
容易写出DP方程  dp[i][j]=max{dp[i-1][j],max{dp[r][k]-APi[i]*(j-k)}(0j)} 分别是第i天不交易]]></description><category></category></item><item><title><![CDATA[整数三分模板]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/77870002</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/77870002</guid><author>say_c_box</author><pubDate>Wed, 06 Sep 2017 18:46:37 +0800</pubDate><description><![CDATA[/*整数三分模板*/
int cal(int x){
    int res;
    return res;
}

int solve(int l,int r){
    while(r>l){
        int m1=(2*l+r)/3;
        int m2=(2*r+l+2)/3;
        if(cal(m1)>cal(m2))
            r-m2-1;]]></description><category></category></item><item><title><![CDATA[浮点三分模板]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/77869982</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/77869982</guid><author>say_c_box</author><pubDate>Wed, 06 Sep 2017 18:44:04 +0800</pubDate><description><![CDATA[/*
浮点数三分模板
*/
const double EPS = 1e-10;  
  
double calc(double x)  {  
    double res;
    return res;
}  
  
double ternarySearch(double l, double r)  {  
    double m, mm;  
    while (l + EPS < r)]]></description><category></category></item><item><title><![CDATA[倍增法求lca模板]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/77838572</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/77838572</guid><author>say_c_box</author><pubDate>Mon, 04 Sep 2017 16:06:38 +0800</pubDate><description><![CDATA[/*
倍增法求lca
*/
const int maxlogv=16;
int f[maxlogv][MAXN];
int dep[MAXN];
//先dfs
void lca_init(){
    for(int k=0;k+1<maxlogv;++k){
        for(int v=1;v<=n;++v){
            if(f[k][v]==0) f[k+1][v]=0]]></description><category></category></item><item><title><![CDATA[马拉车算法模板]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/77746094</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/77746094</guid><author>say_c_box</author><pubDate>Thu, 31 Aug 2017 14:26:58 +0800</pubDate><description><![CDATA[#include 
#include 
#include 

using namespace std;

void findBMstr(string str0){
    string str;
    str += "$#";
    int n=str0.size();
    for(int i = 0; i < n; i++){
        str += str0[i];
      ]]></description><category></category></item><item><title><![CDATA[POJ3347 Kadj Squares(计算几何)]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/77745783</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/77745783</guid><author>say_c_box</author><pubDate>Thu, 31 Aug 2017 14:09:59 +0800</pubDate><description><![CDATA[Kadj Squares




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 3296
 
Accepted: 1307





Description

In this problem, you are given a sequence S1, S2, ..., Sn of]]></description><category></category></item><item><title><![CDATA[POJ1696  space ant(计算几何,极角排序)]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/77745464</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/77745464</guid><author>say_c_box</author><pubDate>Thu, 31 Aug 2017 14:04:52 +0800</pubDate><description><![CDATA[Space Ant




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 4656
 
Accepted: 2925





Description

The most exciting space discovery occurred at the end of the 20]]></description><category></category></item><item><title><![CDATA[POJ410 Intersection   计算几何]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/77745446</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/77745446</guid><author>say_c_box</author><pubDate>Thu, 31 Aug 2017 13:37:09 +0800</pubDate><description><![CDATA[Intersection




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 15317
 
Accepted: 4008





Description

You are to write a program that has to decide whether a giv]]></description><category></category></item><item><title><![CDATA[POJ066 Treasure Hunt(计算几何)]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/77745247</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/77745247</guid><author>say_c_box</author><pubDate>Thu, 31 Aug 2017 13:34:41 +0800</pubDate><description><![CDATA[Treasure Hunt




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 7387
 
Accepted: 3046




Description

Archeologists from the Antiquities and Curios Museum (ACM) ha]]></description><category></category></item><item><title><![CDATA[POJ2653  Pick-up sticks(计算几何)]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/77745155</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/77745155</guid><author>say_c_box</author><pubDate>Thu, 31 Aug 2017 13:09:36 +0800</pubDate><description><![CDATA[Pick-up sticks




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 13739
 
Accepted: 5210





Description

Stan has n sticks of various length. He throws them one a]]></description><category></category></item><item><title><![CDATA[POJ1556——The Doors 计算几何，最短路]]></title><link>https://blog.youkuaiyun.com/say_c_box/article/details/77718010</link><guid>https://blog.youkuaiyun.com/say_c_box/article/details/77718010</guid><author>say_c_box</author><pubDate>Wed, 30 Aug 2017 16:22:51 +0800</pubDate><description><![CDATA[The Doors




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 9012
 
Accepted: 3458






Description
You are to find the length of the shortest path through a chamb]]></description><category></category></item></channel></rss>