Fetching the paper…
Reading the bibliography…
Solving mathematical word problems (MWPs) automatically is challenging, primarily due to the semantic gap between human-readable words and machine-understandable logics.
E. A. Feigenbaum and J. Feldman, Computers and Thought . New York, NY, USA: McGraw-Hill, Inc., 1963
1963
Earlier work this paper cites.
D. Bobrow, “Natural language input for a computer problem solving system,” in Semantic information processing , M. Minsky, Ed. MIT Press, 1964, pp. 146–226
1964
Earlier work this paper cites.
J. R. Slagle, “Experiments with a deductive question-answering program,” Commun. ACM , vol. 8, no. 12, pp. 792–798, Dec. 1965
1965
Earlier work this paper cites.
D. E. Knuth, “Semantics of context-free languages.” Mathematical Systems Theory , vol. 2, no. 2, pp. 127–145, 1968
1968
Earlier work this paper cites.
E. Charniak, “Computer solution of calculus word problems,” in IJCAI , 1969, pp. 303–316
1969
Earlier work this paper cites.
J. Earley, “An efficient context-free parsing algorithm,” Commun. ACM , vol. 13, no. 2, pp. 94–102, 1970
1970
Earlier work this paper cites.
R. O. Duda and P. E. Hart, “Use of the hough transformation to detect lines and curves in pictures,” Commun. ACM , vol. 15, no. 1, pp. 11–15, 1972
1972
Earlier work this paper cites.
C. R. Fletcher, “Understanding and solving arithmetic word problems: A computer simulation,” Behavior Research Methods, Instruments, & Computers , vol. 17, no. 5, pp. 565–571, Sep 1985
1985
Earlier work this paper cites.
X. Lin, S. Shimotsuji, M. Minoh, and T. Sakai, “Efficient diagram understanding with characteristic pattern detection,” Computer Vision, Graphics, and Image Processing , vol. 30, no. 1, pp. 84–106, 1985
1985
Earlier work this paper cites.
W. C. Bulko, “Understanding text with an accompanying diagram,” in IEA/AIE (Vol. 2) , 1988, pp. 894–898
1988
Earlier work this paper cites.
G. S. Novak and W. C. Bulko, “Understanding natural language with diagrams,” in Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, July 29 - August 3, 1990, 2 Volumes. , 1990, pp. 465–470
1990
Earlier work this paper cites.
R. K. Srihari, “Computational models for integrating linguistic and visual information: A survey,” Artif. Intell. Rev. , vol. 8, no. 5-6, pp. 349–369, 1994
1994
Earlier work this paper cites.
H. Gelernter, “Computers & thought,” E. A. Feigenbaum and J. Feldman, Eds. MIT Press, 1995, ch. Realization of a Geometry-theorem Proving Machine, pp. 134–152
1995
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural Computation , vol. 9, no. 8, pp. 1735–1780, 1997
1997
Earlier work this paper cites.
——, “Telling juxtapositions: Using repetition and alignable difference in diagram understanding,” 1998
1998
Earlier work this paper cites.
C. Lin and R. Nevatia, “Building detection and description from a single intensity image,” Computer Vision and Image Understanding , vol. 72, no. 2, pp. 101–121, 1998
1998
Earlier work this paper cites.
Y. Watanabe and M. Nagao, “Diagram understanding using integration of layout information and textual information,” in COLING-ACL , 1998, pp. 1374–1380
1998
Earlier work this paper cites.
D. G. Lowe, “Object recognition from local scale-invariant features,” in ICCV , 1999, pp. 1150–1157
1999
Earlier work this paper cites.
D. Lagunovsky and S. Ablameyko, “Straight-line-based primitive extraction in grey-scale object recognition,” Pattern Recognition Letters , vol. 20, no. 10, pp. 1005–1014, 1999
1999
Earlier work this paper cites.
R. Herbrich, T. Graepel, and K. Obermayer, “Large margin rank boundaries for ordinal regression,” in Advances in Large Margin Classifiers , P. J. Bartlett, B. Schölkopf, D. Schuurmans, and A. J. Smola, Eds. MIT Press, 2000, pp. 115–132
2000
Earlier work this paper cites.
R. W. Ferguson and K. D. Forbus, “Georep: A flexible tool for spatial representation of line drawings,” in AAAI , 2000, pp. 510–516
2000
Earlier work this paper cites.
J. Fleuriot, Geometry Theorem Proving . London: Springer London, 2001, pp. 11–30
2001
Earlier work this paper cites.
L. G. Shapiro and G. C. Stockman, Computer Vision . Prentice Hall, 2001
2001
Earlier work this paper cites.
Y. Zhu, B. Carragher, F. Mouche, and C. S. Potter, “Automatic particle detection through efficient hough transforms,” IEEE Trans. Med. Imaging , vol. 22, no. 9, pp. 1053–1062, 2003
2003
Earlier work this paper cites.
——, “Distinctive image features from scale-invariant keypoints,” International Journal of Computer Vision , vol. 60, no. 2, pp. 91–110, 2004
2004
Earlier work this paper cites.
C. R. Jung and R. Schramm, “Rectangle detection based on a windowed hough transform,” in SIBGRAPI , 2004, pp. 113–120
2004
Earlier work this paper cites.
I. Lev, B. MacCartney, C. D. Manning, and R. Levy, “Solving logic puzzles: From robust processing to precise semantics,” in TextMean , 2004, pp. 9–16
2004
Earlier work this paper cites.
N. Dalal and B. Triggs, “Histograms of oriented gradients for human detection,” in CVPR , 2005, pp. 886–893
2005
Earlier work this paper cites.
G. Mori, S. J. Belongie, and J. Malik, “Efficient shape matching using shape contexts,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 27, no. 11, pp. 1832–1837, 2005
2005
Earlier work this paper cites.
J. Nocedal and S. J. Wright, Numerical Optimization , 2nd ed. New York: Springer, 2006
2006
Earlier work this paper cites.
M. de Marneffe, B. MacCartney, and C. D. Manning, “Generating typed dependency parses from phrase structure parses,” in LREC , 2006, pp. 449–454
2006
Earlier work this paper cites.
Y. Bakman, “Robust Understanding of Word Problems with Extraneous Information,” ArXiv Mathematics e-prints , 2007
2007
Earlier work this paper cites.
L. De Raedt, A. Kimmig, and H. Toivonen, “Problog: A probabilistic prolog and its application in link discovery,” in Proceedings of the 20th International Joint Conference on Artifical Intelligence , ser. IJCAI’07, 2007, pp. 2468–2473
2007
Earlier work this paper cites.
A. Mukherjee and U. Garain, “A review of methods for automatic understanding of natural language mathematical problems,” Artif. Intell. Rev. , vol. 29, no. 2, pp. 93–122, Apr. 2008
2008
Earlier work this paper cites.
H. Bay, A. Ess, T. Tuytelaars, and L. J. V. Gool, “Speeded-up robust features (SURF),” Computer Vision and Image Understanding , vol. 110, no. 3, pp. 346–359, 2008
2008
Earlier work this paper cites.
E. Bengtson and D. Roth, “Understanding the value of features for coreference resolution,” in Proceedings of the Conference on Empirical Methods in Natural Language Processing , ser. EMNLP ’08, 2008, pp. 294–303
2008
Earlier work this paper cites.
J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, “ImageNet: A Large-Scale Hierarchical Image Database,” in CVPR09 , 2009
2009
Earlier work this paper cites.
D. Koller and N. Friedman, Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning . The MIT Press, 2009
2009
Earlier work this paper cites.
A. Haghighi and D. Klein, “Simple coreference resolution with rich syntactic and semantic features,” in Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3-Volume 3 . Association for Computational Linguistics, 2009, pp. 1152–1161
2009
Earlier work this paper cites.
R. Yun, M. Yuhui, C. Guangzuo, H. Ronghuai, and Z. Ying, “Frame-based calculus of solving arithmetic multi-step addition and subtraction word problems,” in Education Technology and Computer Science, International Workshop on(ETCS) , vol. 02, 03 2010, pp. 476–479. [Online]. Available: doi.ieeecomputersociety.org/10.1109/ETCS.2010.316
2010
Earlier work this paper cites.
Y. Goldberg and M. Elhadad, “An efficient algorithm for easy-first non-directional dependency parsing,” in Human Language Technologies: the 2010 Conference of the North American Chapter of the Association for Computational Linguistics , 2010, pp. 742–750
2010
Earlier work this paper cites.
K. Raghunathan, H. Lee, S. Rangarajan, N. Chambers, M. Surdeanu, D. Jurafsky, and C. D. Manning, “A multi-pass sieve for coreference resolution,” in EMNLP , 2010, pp. 492–501
2010
Earlier work this paper cites.
D. Goldwasser and D. Roth, “Learning from natural instructions,” in IJCAI , 2011, pp. 1794–1800
2011
Earlier work this paper cites.
D. Zhang, D. Agrawal, G. Chen, and A. K. H. Tung, “Hashfile: An efficient index structure for multimedia data,” in ICDE . IEEE Computer Society, 2011, pp. 1103–1114
2011
Cited alongside, same era.
H. Lee, Y. Peirsman, A. X. Chang, N. Chambers, M. Surdeanu, and D. Jurafsky, “Stanford’s multi-pass sieve coreference resolution system at the conll-2011 shared task,” in CoNLL , 2011, pp. 28–34
2011
Cited alongside, same era.
M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub, Answer Set Solving in Practice , ser. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, 2012
2012
Cited alongside, same era.
T. Kwiatkowski, E. Choi, Y. Artzi, and L. S. Zettlemoyer, “Scaling semantic parsers with on-the-fly ontology matching,” in EMNLP , 2013, pp. 1545–1556
2013
Cited alongside, same era.
S. Wu, W. Ren, C. Yu, G. Chen, D. Zhang, and J. Zhu, “Personal recommendation using deep recurrent neural networks in netease,” in ICDE . IEEE Computer Society, 2016, pp. 1218–1229
2016
Later among the works it cites.
K. Narasimhan, A. Yala, and R. Barzilay, “Improving information extraction by acquiring external evidence with reinforcement learning,” in EMNLP , 2016, pp. 2355–2365
2016
Later among the works it cites.
R. Koncel-Kedziorski, S. Roy, A. Amini, N. Kushman, and H. Hajishirzi, “MAWPS: A math word problem repository,” in NAACL , 2016, pp. 1152–1157
2016
Later among the works it cites.
S. Upadhyay, M. Chang, K. Chang, and W. Yih, “Learning from explicit and implicit supervision jointly for algebra word problems,” in EMNLP , 2016, pp. 297–306
2016
Later among the works it cites.
S. Wiseman and A. M. Rush, “Sequence-to-sequence learning as beam-search optimization,” in EMNLP , 2016, pp. 1296–1306
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean, “Distributed representations of words and phrases and their compositionality,” in NIPS , 2013, pp. 3111–3119
2013
Cited alongside, same era.
R. Socher, J. Bauer, C. D. Manning, and A. Y. Ng, “Parsing with compositional vector grammars,” in ACL , 2013, pp. 455–465
2013
Cited alongside, same era.
H. Hajishirzi, L. Zilles, D. S. Weld, and L. S. Zettlemoyer, “Joint coreference resolution and named-entity linking with multi-pass sieves,” in EMNLP , 2013, pp. 289–299
2013
Cited alongside, same era.
K.-W. Chang, R. Samdani, and D. Roth, “A Constrained Latent Variable Model for Coreference Resolution,” in EMNLP , 2013
2013
Cited alongside, same era.
M. J. Hosseini, H. Hajishirzi, O. Etzioni, and N. Kushman, “Learning to solve arithmetic word problems with verb categorization,” in EMNLP , 2014, pp. 523–533
2014
Cited alongside, same era.
N. Kushman, L. Zettlemoyer, R. Barzilay, and Y. Artzi, “Learning to automatically solve algebra word problems,” in ACL , 2014, pp. 271–281
2014
Cited alongside, same era.
I. Sutskever, O. Vinyals, and Q. V. Le, “Sequence to sequence learning with neural networks,” in NIPS , 2014, pp. 3104–3112
2014
Cited alongside, same era.
J. Pennington, R. Socher, and C. D. Manning, “Glove: Global vectors for word representation,” in EMNLP , 2014, pp. 1532–1543
2014
Cited alongside, same era.
2016
Later among the works it cites.
A. Kembhavi, M. Salvato, E. Kolve, M. J. Seo, H. Hajishirzi, and A. Farhadi, “A diagram is worth a dozen images,” in ECCV , 2016, pp. 235–251
2016
Later among the works it cites.
P. Clark, O. Etzioni, T. Khot, A. Sabharwal, O. Tafjord, P. D. Turney, and D. Khashabi, “Combining retrieval, statistics, and inference to answer elementary science questions,” in AAAI , 2016, pp. 2580–2586
2016
Later among the works it cites.
G. Cheng, W. Zhu, Z. Wang, J. Chen, and Y. Qu, “Taking up the gaokao challenge: An information retrieval approach,” in IJCAI , 2016, pp. 2479–2485
2016
Later among the works it cites.
H. Wang, F. Tian, B. Gao, C. Zhu, J. Bian, and T. Liu, “Solving verbal questions in IQ test by knowledge-powered word embedding,” in EMNLP , 2016, pp. 541–550
2016
Later among the works it cites.
X. Yu, P. Jian, M. Wang, and S. Wu, “Extraction of implicit quantity relations for arithmetic word problems in chinese,” in EITT , Sept 2016, pp. 242–245
2016
Later among the works it cites.
K. Wang and Z. Su, “Dimensionally guided synthesis of mathematical word problems,” in IJCAI , 2016, pp. 2661–2668
2016
Later among the works it cites.
R. Koncel-Kedziorski, I. Konstas, L. Zettlemoyer, and H. Hajishirzi, “A theme-rewriting approach for generating algebra word problems,” in EMNLP , 2016, pp. 1617–1628
2016
Later among the works it cites.
D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. van den Driessche, J. Schrittwieser, I. Antonoglou, V. Panneershelvam, M. Lanctot, S. Dieleman, D. Grewe, J. Nham, N. Kalchbrenner, I. Sutskever, T. Lillicrap, M. Leach, K. Kavukcuoglu, T. Graepel, and D. Hassabis, “Mastering the game of go with deep neural networks and tree search,” 2016
2016
Later among the works it cites.
D. Huang, S. Shi, J. Yin, and C.-Y. Lin, “Learning fine-grained expressions to solve math word problems,” in EMNLP , 2017, pp. 805–814
2017
Later among the works it cites.
Y. Wang, X. Liu, and S. Shi, “Deep neural solver for math word problems,” in EMNLP , 2017, pp. 845–854
2017
Later among the works it cites.
Y. Goyal, T. Khot, D. Summers-Stay, D. Batra, and D. Parikh, “Making the V in VQA matter: Elevating the role of image understanding in visual question answering,” in CVPR , 2017, pp. 6325–6334
2017
Later among the works it cites.
S. Roy and D. Roth, “Unit dependency graph and its application to arithmetic word problem solving,” in AAAI . AAAI Press, 2017, pp. 3082–3088
2017
Later among the works it cites.
L. Gao, Z. Guo, H. Zhang, X. Xu, and H. T. Shen, “Video captioning with attention-based LSTM and semantic consistency,” IEEE Trans. Multimedia , vol. 19, no. 9, pp. 2045–2055, 2017
2017
Later among the works it cites.
X. Wang, L. Nie, X. Song, D. Zhang, and T. Chua, “Unifying virtual and physical worlds: Learning toward local and global consistency,” ACM Trans. Inf. Syst. , vol. 36, no. 1, pp. 4:1–4:26, 2017
2017
Later among the works it cites.
D. Zhang, L. Nie, H. Luan, K. Tan, T. Chua, and H. T. Shen, “Compact indexing and judicious searching for billion-scale microblog retrieval,” ACM Trans. Inf. Syst. , vol. 35, no. 3, pp. 27:1–27:24, 2017
2017
Later among the works it cites.
Z. Lin, M. Feng, C. Nogueira dos Santos, M. Yu, B. Xiang, B. Zhou, and Y. Bengio, “A Structured Self-attentive Sentence Embedding,” ArXiv e-prints , Mar. 2017
2017
Later among the works it cites.
S. Upadhyay and M. Chang, “Annotating derivations: A new evaluation strategy and dataset for algebra word problems,” in EACL , 2017, pp. 494–504
2017
Later among the works it cites.
X. Xu, F. Shen, Y. Yang, H. T. Shen, and X. Li, “Learning discriminative binary codes for large-scale cross-modal retrieval,” IEEE Trans. Image Processing , vol. 26, no. 5, pp. 2494–2507, 2017
2017
Later among the works it cites.
S. Roy and D. Roth, “Mapping to Declarative Knowledge for Word Problem Solving,” ArXiv e-prints , dec 2017
2017
Later among the works it cites.
M. Sachan, A. Dubey, and E. P. Xing, “From textbooks to knowledge: A case study in harvesting axiomatic knowledge from textbooks to solve geometry problems,” in EMNLP , 2017, pp. 784–795
2017
Later among the works it cites.
C. Alvin, S. Gulwani, R. Majumdar, and S. Mukhopadhyay, “Synthesis of problems for shaded area geometry reasoning,” in AIED , 2017, pp. 455–458
2017
Later among the works it cites.
J. Hernández-Orallo, F. Martínez-Plumed, U. Schmid, M. Siebers, and D. L. Dowe, “Computer models solving intelligence test problems: Progress and implications (extended abstract),” in IJCAI , 2017, pp. 5005–5009
2017
Later among the works it cites.
A. Dries, A. Kimmig, J. Davis, V. Belle, and L. D. Raedt, “Solving probability problems in natural language,” in IJCAI , 2017, pp. 3981–3987
2017
Later among the works it cites.
W. Ling, D. Yogatama, C. Dyer, and P. Blunsom, “Program induction by rationale generation: Learning to solve and explain algebraic word problems,” in ACL , 2017, pp. 158–167
2017
Later among the works it cites.
B. Siyam, A. A. Saa, O. Alqaryouti, and K. Shaalan, “Arabic arithmetic word problems solver,” in ACLING , 2017, pp. 153–160
2017
Later among the works it cites.
L. Wang, Y. Wang, D. Cai, D. Zhang, and X. Liu, “Translating math word problem to expression tree,” in EMNLP . Association for Computational Linguistics, 2018, pp. 1064–1069
2018
Closest in time.
2018
Closest in time.
L. Wang, D. Zhang, L. Gao, J. Song, L. Guo, and H. T. Shen, “Mathdqn: Solving arithmetic word problems via deep reinforcement learning,” in AAAI . AAAI Press, 2018
2018
Closest in time.
D. Huang, J. Liu, C. Lin, and J. Yin, “Neural math word problem solver with reinforcement learning,” in COLING , 2018, pp. 213–223
2018
Closest in time.
J. Song, Y. Guo, L. Gao, X. Li, A. Hanjalic, and H. T. Shen, “From deterministic to generative: Multimodal stochastic rnns for video captioning,” IEEE Transactions on Neural Networks and Learning Systems , 2018
2018
Closest in time.
Y. Bin, Y. Yang, F. Shen, N. Xie, H. T. Shen, and X. Li, “Describing video with attention based bidirectional lstm,” IEEE Transactions on Cybernetics , 2018
2018
Closest in time.
Y. Yang, J. Zhou, J. Ai, Y. Bin, A. Hanjalic, and H. T. Shen, “Video captioning by adversarial lstm,” IEEE Transactions on Image Processing , 2018
2018
Closest in time.
L. Guo, D. Zhang, Y. Wang, H. Wu, B. Cui, and K. Tan, “Co 2 {}^{\mbox{2}} : Inferring personal interests from raw footprints by connecting the offline world with the online world,” ACM Trans. Inf. Syst. , vol. 36, no. 3, pp. 31:1–31:29, 2018
2018
Closest in time.
B. Robaidek, R. Koncel-Kedziorski, and H. Hajishirzi, “Data-Driven Methods for Solving Algebra Word Problems,” ArXiv e-prints , Apr. 2018
2018
Closest in time.
F. Shen, Y. Xu, L. Liu, Y. Yang, Z. Huang, and H. T. Shen, “Unsupervised deep hashing with similarity-adaptive and discrete optimization,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 40, no. 12, pp. 3034–3044, 2018
2018
Closest in time.
L. Wang, D. Zhang, J. Zhang, X. Xu, L. Gao, B. Dai, and H. T. Shen, “Template-based mathword problem solvers with recursive neural networks,” in AAAI . AAAI Press, 2019
2019
Closest in time.
D. Zhang, R. Cao, and S. Wu, “Information fusion in visual question answering: A survey,” Information Fusion , vol. 52, pp. 268 – 280, 2019
2019
Closest in time.
Y. Wang, D. Zhang, Y. Liu, B. Dai, and L. H. Lee, “Enhancing transportation systems via deep learning: A survey,” Transportation Research Part C: Emerging Technologies , vol. 99, pp. 144 – 163, 2019
2019
Closest in time.