Redian新闻
>
natrural language processing question!!!! (转载)
avatar
natrural language processing question!!!! (转载)# Working - 上班一族
b*t
1
【 以下文字转载自 JobHunting 讨论区 】
发信人: bnapt (bnapt), 信区: JobHunting
标 题: natrural language processing question!!!!
发信站: BBS 未名空间站 (Fri Mar 6 18:15:18 2009)
given 10 same length strings, each string is 128 characters. Each strings
are ordinary English text with all spaces, numbers, punctuation, and other
non-alphabetic characters removed. They were copied or transcribed from
obscure sources, and have all been changed slightly from the original (
without intentionally introducing spelling or grammat
avatar
w*a
2
N-Gram

【在 b***t 的大作中提到】
: 【 以下文字转载自 JobHunting 讨论区 】
: 发信人: bnapt (bnapt), 信区: JobHunting
: 标 题: natrural language processing question!!!!
: 发信站: BBS 未名空间站 (Fri Mar 6 18:15:18 2009)
: given 10 same length strings, each string is 128 characters. Each strings
: are ordinary English text with all spaces, numbers, punctuation, and other
: non-alphabetic characters removed. They were copied or transcribed from
: obscure sources, and have all been changed slightly from the original (
: without intentionally introducing spelling or grammat

相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。