We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
原文还没有看完,刚看到数据构造这里。 k-sentence reader是对于一个有N条句子的篇章,构造{seq[1], ..., seq[N], seq[1] + seq[2], ..., seq[N -1] + seq[N, ...}这样的训练样本吗?这样的话样本数量会非常大,是n^2级别的,解码的时候不会特别慢吗?
The text was updated successfully, but these errors were encountered:
No branches or pull requests
原文还没有看完,刚看到数据构造这里。
k-sentence reader是对于一个有N条句子的篇章,构造{seq[1], ..., seq[N], seq[1] + seq[2], ..., seq[N -1] + seq[N, ...}这样的训练样本吗?这样的话样本数量会非常大,是n^2级别的,解码的时候不会特别慢吗?
The text was updated successfully, but these errors were encountered: