Predicting Algorithm Classes for Programming Word Problems
We introduce the task of algorithm class prediction for programming word problems. A programming word problem is a problem written in natural language, which can be solved using an algorithm or a program. We define classes of various programming word problems which correspond to the class of algorithms required to solve the problem. We present four new datasets for this task, two multiclass datasets with 550 and 1159 problems each and two multilabel datasets having 3737 and 3960 problems each. We pose the problem as a text classification problem and train neural network and non-neural network-based models on this task. Our best performing classifier gets an accuracy of 62.7 percent for the multiclass case on the five class classification dataset, Codeforces Multiclass-5 (CFMC5). We also do some human-level analysis and compare human performance with that of our text classification models. Our best classifier has an accuracy only 9 percent lower than that of a human on this task. To the best of our knowledge, these are the first reported results on such a task. We make our code and datasets publicly available.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationGeneral Classificationtext-classificationText ClassificationSimilar Papers 제목 키워드 기반
Problem-Solving Guide: Predicting the Algorithm Tags and Difficulty for Competitive Programming Problems
The recent program development industries have required problem-solving abilities for engineers, especially application developers. However, AI-based education systems to help solve computer algorithm problems have not y…
TAGLearning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems
Max-cut, clustering, and many other partitioning problems that are of significant importance to machine learning and other scientific fields are NP-hard, a reality that has motivated researchers to develop a wealth of ap…
ClusteringLearning TheoryOptimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches
Even though it is well known that for most relevant computational problems different algorithms may perform better on different classes of problem instances, most researchers still focus on determining a single best algo…
Domain-Independent Dynamic Programming
For combinatorial optimization problems, model-based paradigms such as mixed-integer programming (MIP) and constraint programming (CP) aim to decouple modeling and solving a problem: the `holy grail' of declarative probl…
Combinatorial OptimizationHeuristic SearchCNN-based Spoken Term Detection and Localization without Dynamic Programming
In this paper, we propose a spoken term detection algorithm for simultaneous prediction and localization of in-vocabulary and out-of-vocabulary terms within an audio segment. The proposed algorithm infers whether a term …
Word Embeddings