CompHub 实时聚合多平台的数据类(Kaggle、天池…)和OJ类(Leetcode、牛客…）比赛。本账号会推送最新的比赛消息，欢迎关注！
更多比赛信息见 CompHub主页
以下内容摘自比赛主页（点击文末阅读原文进入）
Part1赛题介绍
题目
举办平台
主办方
背景
In 1934 the Observer’s cryptic crossword compiler, Edward Powys Mathers (aka Torquemada), released a novel that was simultaneously a murder mystery and the most fiendishly difficult literary puzzle ever written. The pages have been printed in an entirely haphazard order, but it is possible – through logic and intelligent reading – to sort the pages into the only correct order, revealing six murder victims and their respective murderers.
Your job, as the puzzle solver, is to try to put 75 pages of Cain’s Jawbone into its correct order, using AI NLP algorithms.
Only four people have solved this extremely difficult puzzle, and no one has yet tried to use machine learning to solve it. This is not only a fitting challenge to try to see if modern technology can solve an older mystery, but it also gives the opportunity to test NLP algorithms on a much more dated language set, which hasn’t been done yet.
1934 年，Observer 神秘的填字游戏编辑器 Edward Powys Mathers（又名 Torquemada）出版了一部小说，它既是一部谋杀悬疑小说，也是有史以来最难解的文学谜题。这些页面以完全随意的顺序打印，但有可能——通过逻辑和智能阅读——将页面排序为唯一正确的顺序，揭示六名谋杀受害者和他们各自的凶手。
作为解谜者，你的工作是尝试使用 AI NLP 算法将 75 页的 Cain's Jawbone 放入正确的顺序。
只有四个人解决了这个极其困难的难题，还没有人尝试使用机器学习来解决它。这不仅是一个合适的挑战，试图看看现代技术是否可以解决一个古老的谜团，而且还提供了在更老旧的语言集上测试 NLP 算法。
Part2时间安排
Competition closes on 31 December 2022.
Final submissions must be received by 23:59 PM GMT.
We reserve the right to update the contest timeline if necessary.
Part3奖励机制
1st place: $300 USD
There are 2000 Zindi points for this challenge.
Part4赛题描述
The objective of this challenge is to create a machine learning algorithm to correct the order of the pages to solve the six murders in the book.
预测文本片段正确的顺序
Part5评价指标
The error metric for this competition is Accuracy.
61
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
