Fetching the paper…
Reading the bibliography…
Over the last several years, the field of natural language processing has been propelled forward by an explosion in the use of deep learning models.
J. Botha and P. Blunsom, “Compositional morphology for word representations and language modelling,” in ICML , 2014, pp. 1899–1907
1907
Earlier work this paper cites.
Z. S. Harris, “Distributional structure,” Word , vol. 10, no. 2-3, pp. 146–162, 1954
1954
Earlier work this paper cites.
D. G. Bobrow, “Natural language input for a computer problem solving system,” 1964
1964
Earlier work this paper cites.
H. Rubenstein and J. B. Goodenough, “Contextual correlates of synonymy,” CACM , vol. 8, no. 10, pp. 627–633, 1965
1965
Earlier work this paper cites.
J. Weizenbaum, “Eliza, a computer program for the study of natural language communication between man and machine,” CACM , vol. 9, no. 1, pp. 36–45, 1966
1966
Earlier work this paper cites.
T. Winograd, “Procedures as a representation for data in a computer program for understanding natural language,” MIT, Tech. Rep., 1971
1971
Earlier work this paper cites.
J. Worsham and J. Kalita, “Genre identification and the compositional effect of genre in literature,” in COLING , 2018, pp. 1963–1973
1973
Earlier work this paper cites.
K. Fukushima, “Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position,” Bioological Cybernetics , vol. 36, pp. 193–202, 1980
1980
Earlier work this paper cites.
K. Fukushima and S. Miyake, “Neocognitron: A new algorithm for pattern recognition tolerant of deformations and shifts in position,” Pattern Recognition , vol. 15, no. 6, pp. 455–469, 1982
1982
Earlier work this paper cites.
D. Rumelhart, G. Hinton, and R. Williams, “Learning internal representations by error propagation,” UCSD, Tech. Rep., 1985
1985
Earlier work this paper cites.
P. Smolensky, “Information processing in dynamical systems: Foundations of harmony theory,” Tech. Rep., 1986
1986
Earlier work this paper cites.
M. Kawato, K. Furukawa, and R. Suzuki, “A hierarchical neural-network model for control and learning of voluntary movement,” Biological Cybernetics , vol. 57, no. 3, pp. 169–185, 1987
1987
Earlier work this paper cites.
Y. LeCun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard, and L. D. Jackel, “Backpropagation applied to handwritten zip code recognition,” Neural Computation , vol. 1, no. 4, 1989
1989
Earlier work this paper cites.
J. L. Elman, “Finding structure in time,” Cognitive Science , vol. 14, no. 2, pp. 179–211, 1990
1990
Earlier work this paper cites.
G. A. Miller and W. G. Charles, “Contextual correlates of semantic similarity,” Language and Cognitive Processes , vol. 6, no. 1, 1991
1991
Earlier work this paper cites.
T. Fujisaki, F. Jelinek, J. Cocke, E. Black, and T. Nishino, “A probabilistic parsing method for sentence disambiguation,” in Current issues in Parsing Technology , 1991, pp. 139–152
1991
Earlier work this paper cites.
J. Schmidhuber, “Learning complex, extended sequences using the principle of history compression,” Neural Computation , vol. 4, no. 2, pp. 234–242, 1992
1992
Earlier work this paper cites.
F. Jelinek, J. Lafferty, and R. Mercer, “Basic methods of probabilistic context free grammars,” in Speech Recognition and Understanding . Springer, 1992, pp. 345–360
1992
Earlier work this paper cites.
M. Marcus, M. A. Marcinkiewicz, and B. Santorini, “Building a large annotated corpus of english: The penn treebank,” Computational Linguistics , vol. 19, no. 2, pp. 313–330, 1993
1993
Earlier work this paper cites.
K. S. Jones, “Natural language processing: a historical review,” in Current Issues in Computational Linguistics: in Honour of Don Walker . Springer, 1994, pp. 3–16
1994
Earlier work this paper cites.
L. Fausett, Fundamentals of neural networks: architectures, algorithms, and applications . Prentice-Hall, Inc., 1994
1994
Earlier work this paper cites.
Y. Bengio, P. Simard, and P. Frasconi, “Learning long-term dependencies with gradient descent is difficult,” IEEE Transactions on Neural Networks , vol. 5, no. 2, 1994
1994
Earlier work this paper cites.
Y. LeCun, Y. Bengio et al. , “Convolutional networks for images, speech, and time series,” The Handbook of Brain Theory and Neural Networks , vol. 3361, no. 10, 1995
1995
Earlier work this paper cites.
G. A. Miller, “Wordnet: a lexical database for english,” Communications of the ACM , vol. 38, no. 11, pp. 39–41, 1995
1995
Earlier work this paper cites.
C. Goller and A. Kuchler, “Learning task-dependent distributed representations by backpropagation through structure,” in IEEE International Conf on Neural Networks , vol. 1, 1996, pp. 347–352
1996
Earlier work this paper cites.
S. El Hihi and Y. Bengio, “Hierarchical recurrent neural networks for long-term dependencies,” in NIPS , 1996, pp. 493–499
1996
Earlier work this paper cites.
J. Cowie and W. Lehnert, “Information extraction,” CACM , vol. 39, no. 1, pp. 80–91, 1996
1996
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.
R. Iyer, M. Ostendorf, and M. Meteer, “Analyzing and predicting language model improvements,” in IEEE Workshop on Automatic Speech Recognition and Understanding , 1997, pp. 254–261
1997
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proc of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998
1998
Earlier work this paper cites.
S. F. Chen, D. Beeferman, and R. Rosenfeld, “Evaluation metrics for language models,” 1998
1998
Earlier work this paper cites.
R. S. Sutton and A. G. Barto, Reinforcement learning: An introduction . MIT Press Cambridge, 1998, vol. 1, no. 1
1998
Earlier work this paper cites.
D. Jurafsky and J. Martin, Speech & language processing . Pearson Education, 2000
2000
Earlier work this paper cites.
E. D. Liddy, “Natural language processing,” 2001
2001
Earlier work this paper cites.
P. Clarkson and T. Robinson, “Improved language modelling through better language model evaluation measures,” Computer Speech & Language , vol. 15, no. 1, pp. 39–53, 2001
2001
Earlier work this paper cites.
L. Finkelstein, E. Gabrilovich, Y. Matias, E. Rivlin, Z. Solan, G. Wolfman, and E. Ruppin, “Placing search in context: The concept revisited,” in Intnl Conf on World Wide Web , 2001, pp. 406–414
2001
Earlier work this paper cites.
J. Lafferty, A. McCallum, and F. C. Pereira, “Conditional random fields: Probabilistic models for segmenting and labeling sequence data,” 2001
2001
Earlier work this paper cites.
S. Hochreiter, Y. Bengio, P. Frasconi, J. Schmidhuber et al. , “Gradient flow in recurrent nets: the difficulty of learning long-term dependencies,” 2001
2001
Earlier work this paper cites.
D. Kawahara, S. Kurohashi, and K. Hasida, “Construction of a japanese relevance-tagged corpus.” in LREC , 2002
2002
Earlier work this paper cites.
X. Li and D. Roth, “Learning question classifiers,” in COLING-Vol 1 , 2002, pp. 1–7
2002
Earlier work this paper cites.
X. Carreras, L. Marquez, and L. Padró, “Named entity extraction using adaboost,” in CoNLL , 2002, pp. 1–4
2002
Earlier work this paper cites.
K. Papineni, S. Roukos, T. Ward, and W.-J. Zhu, “Bleu: a method for automatic evaluation of machine translation,” in ACL , 2002, pp. 311–318
2002
Earlier work this paper cites.
Y. Bengio, R. Ducharme, P. Vincent, and C. Jauvin, “A neural probabilistic language model,” J. of Machine Learning Research , vol. 3, 2003
2003
Earlier work this paper cites.
J. Nivre, “An efficient algorithm for projective dependency parsing,” in Intnl Workshop on Parsing Technologies , 2003
2003
Earlier work this paper cites.
J. Hammerton, “Named entity recognition with long short-term memory,” in HLT-NAACL 2003-Volume 4 , 2003, pp. 172–175
2003
Earlier work this paper cites.
E. F. Tjong Kim Sang and F. De Meulder, “Introduction to the conll-2003 shared task: Language-independent named entity recognition,” in HLT-NAACL-Volume 4 , 2003, pp. 142–147
2003
Earlier work this paper cites.
——, “Incrementality in deterministic dependency parsing,” in Workshop on Incremental Parsing: Bringing Engineering and Cognition Together , 2004, pp. 50–57
2004
Earlier work this paper cites.
B. Dolan, C. Quirk, and C. Brockett, “Unsupervised construction of large paraphrase corpora: Exploiting massively parallel news sources,” in COLING , 2004, p. 350
2004
Earlier work this paper cites.
N. Xue, F. Xia, F.-D. Chiou, and M. Palmer, “The penn chinese treebank: Phrase structure annotation of a large corpus,” Natural Language Engineering , vol. 11, no. 2, pp. 207–238, 2005
2005
Earlier work this paper cites.
P. Koehn, “Europarl: A parallel corpus for statistical machine translation,” in MT summit , vol. 5, 2005, pp. 79–86
2005
Earlier work this paper cites.
D. Kawahara and S. Kurohashi, “Case frame compilation from the web using high-performance computing,” in LREC , 2006, pp. 1344–1347
2006
Earlier work this paper cites.
J. Judge, A. Cahill, and J. Van Genabith, “Questionbank: Creating a corpus of parse-annotated questions,” in COLING , 2006, pp. 497–504
2006
Earlier work this paper cites.
D. Santos, N. Seco, N. Cardoso, and R. Vilela, “Harem: An advanced ner evaluation contest for portuguese,” in LREC, Genoa , 2006
2006
Earlier work this paper cites.
E. Hovy, M. Marcus, M. Palmer, L. Ramshaw, and R. Weischedel, “Ontonotes: the 90% solution,” in Human Language Technology Conf, Companion Volume , 2006, pp. 57–60
2006
Earlier work this paper cites.
G. Hinton, S. Osindero, and Y.-W. Teh, “A fast learning algorithm for deep belief nets,” Neural computation , vol. 18, no. 7, 2006
2006
Earlier work this paper cites.
M. Creutz and K. Lagus, “Unsupervised models for morpheme segmentation and morphology learning,” ACM TSLP , vol. 4, no. 1, 2007
2007
Earlier work this paper cites.
M. Wang, N. A. Smith, and T. Mitamura, “What is the jeopardy model? a quasi-synchronous grammar for qa,” in Joint EMNLP and CoNLL , 2007
2007
Earlier work this paper cites.
S. Auer, C. Bizer, G. Kobilarov, J. Lehmann, R. Cyganiak, and Z. Ives, “Dbpedia: A nucleus for a web of open data,” in The Semantic Web . Springer, 2007, pp. 722–735
2007
Earlier work this paper cites.
M. Surdeanu, R. Johansson, A. Meyers, L. Màrquez, and J. Nivre, “The conll-2008 shared task on joint parsing of syntactic and semantic dependencies,” in CONLL , 2008, pp. 159–177
2008
Earlier work this paper cites.
M.-C. De Marneffe and C. D. Manning, “The stanford typed dependencies representation,” in COLING Workshop on Cross-framework and Cross-domain Parser Evaluation , 2008, pp. 1–8
2008
Earlier work this paper cites.
R. Collobert and J. Weston, “A unified architecture for natural language processing: Deep neural networks with multitask learning,” in ICML , 2008, pp. 160–167
2008
Earlier work this paper cites.
R. Raina, A. Madhavan, and A. Y. Ng, “Large-scale deep unsupervised learning using graphics processors,” in ICML , 2009, pp. 873–880
2009
Earlier work this paper cites.
J. Nivre, M. Kuhlmann, and J. Hall, “An improved oracle for dependency parsing with online reordering,” in Intnl Conf on Parsing Technologies , 2009, pp. 73–76
2009
Earlier work this paper cites.
A. Go, R. Bhayani, and L. Huang, “Twitter sentiment classification using distant supervision,” CS224N Project Report, Stanford , vol. 1, no. 12, 2009
2009
Earlier work this paper cites.
T. Deselaers, S. Hasan, O. Bender, and H. Ney, “A deep learning approach to machine transliteration,” in Workshop on Statistical Machine Translation . ACL, 2009, pp. 233–241
2009
Earlier work this paper cites.
T. Mikolov, M. Karafiát, L. Burget, J. Černockỳ, and S. Khudanpur, “Recurrent neural network based language model,” in Annual Conf of the Intnl Speech Communication Assoc , vol. 2, 2010, p. 3
2010
Earlier work this paper cites.
V. Nair and G. E. Hinton, “Rectified linear units improve restricted boltzmann machines,” in ICML , 2010, pp. 807–814
2010
Earlier work this paper cites.
D. Ciresan, U. Meier, J. Masci, L. Maria Gambardella, and J. Schmidhuber, “Flexible, high performance convolutional neural networks for image classification,” in IJCAI , vol. 22, no. 1, 2011, p. 1237
2011
Earlier work this paper cites.
R. Collobert, J. Weston, L. Bottou, M. Karlen, K. Kavukcuoglu, and P. Kuksa, “Natural language processing (almost) from scratch,” Journal of Machine Learning Research , vol. 12, pp. 2493–2537, 2011
2011
Earlier work this paper cites.
R. Socher, E. Huang, J. Pennin, C. Manning, and A. Ng, “Dynamic pooling and unfolding recursive autoencoders for paraphrase detection,” in NIPS , 2011, pp. 801–809
2011
Earlier work this paper cites.
T. Mikolov, S. Kombrink, L. Burget, J. Černockỳ, and S. Khudanpur, “Extensions of recurrent neural network language model,” in IEEE ICASSP , 2011, pp. 5528–5531
2011
Earlier work this paper cites.
T. Mikolov, A. Deoras, D. Povey, L. Burget, and J. Černockỳ, “Strategies for training large scale neural network language models,” in IEEE Workshop on Automatic Speech Recognition and Understanding , 2011
2011
Earlier work this paper cites.
R. Huang, Eric Hand Socher, C. Manning, and A. Ng, “Improving word representations via global context and multiple word prototypes,” in ACL: Vol 1 , 2012, pp. 873–882
2012
Earlier work this paper cites.
M. Cettolo, C. Girardi, and M. Federico, “Wit3: Web inventory of transcribed and translated talks,” in Conf of European Assoc. for Machine Translation , 2012, pp. 261–268
2012
Earlier work this paper cites.
M. Hangyo, D. Kawahara, and S. Kurohashi, “Building a diverse document leads corpus annotated with semantic relations,” in Pacific-Asia Conf on Language, Information, & Computation , 2012, pp. 535–544
2012
Earlier work this paper cites.
S. Petrov and R. McDonald, “Overview of the 2012 shared task on parsing the web,” in Notes of the 1st Workshop on Syntactic Analysis of Non-canonical Language , vol. 59, 2012
2012
Earlier work this paper cites.
W. Che, M. Zhang, Y. Shao, and T. Liu, “Semeval-2012 task 9: Chinese semantic dependency parsing,” in Conference on Lexical and Computational Semantics , 2012, pp. 378–384
2012
Earlier work this paper cites.
E. Agirre, M. Diab, D. Cer, and A. Gonzalez-Agirre, “Semeval-2012 task 6: A pilot on semantic textual similarity,” in Joint Conf on Lexical and Computational Semantics-Vol 1 , 2012, pp. 385–393
2012
Earlier work this paper cites.
A. Rahman and V. Ng, “Resolving complex cases of definite pronouns: the winograd schema challenge,” in Joint EMNLP and CoNLL , 2012
2012
Earlier work this paper cites.
G. Hinton, L. Deng, D. Yu, G. E. Dahl, A.-r. Mohamed, N. Jaitly, A. Senior, V. Vanhoucke, P. Nguyen, T. N. Sainath et al. , “Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups,” IEEE Signal Processing Magazine , vol. 29, no. 6, pp. 82–97, 2012
2012
Earlier work this paper cites.
H. Schwenk, “Continuous space translation models for phrase-based statistical machine translation,” COLING , pp. 1071–1080, 2012
2012
Earlier work this paper cites.
A. Coates, B. Huval, T. Wang, D. Wu, B. Catanzaro, and N. Andrew, “Deep learning with cots hpc systems,” in ICML , 2013, pp. 1337–1345
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
M. Lin, Q. Chen, and S. Yan, “Network in network,” arXiv preprint arXiv:1312.4400 , 2013
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
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
Earlier work this paper cites.
T. Luong, R. Socher, and C. Manning, “Better word representations with recursive neural networks for morphology,” in CoNLL , 2013
2013
Earlier work this paper cites.
R. Socher, A. Perelygin, J. Wu, J. Chuang, C. D. Manning, A. Ng, and C. Potts, “Recursive deep models for semantic compositionality over a sentiment treebank,” in EMNLP , 2013, pp. 1631–1642
2013
Earlier work this paper cites.
R. Socher, J. Bauer, C. Manning et al. , “Parsing with compositional vector grammars,” in ACL , vol. 1, 2013, pp. 455–465
2013
Earlier work this paper cites.
P. Stenetorp, “Transition-based dependency parsing using recursive neural networks,” in NIPS Workshop on Deep Learning , 2013
2013
Earlier work this paper cites.
A. Graves, A.-r. Mohamed, and G. Hinton, “Speech recognition with deep recurrent neural networks,” in IEEE International Conf on Acoustics, Speech and Signal Processing , 2013, pp. 6645–6649
2013
Earlier work this paper cites.
P.-S. Huang, X. He, J. Gao, L. Deng, A. Acero, and L. Heck, “Learning deep structured semantic models for web search using clickthrough data,” in ACM CIKM , 2013, pp. 2333–2338
2013
Earlier work this paper cites.
Z. Lu and H. Li, “A deep architecture for matching short texts,” in Advances in neural information processing systems , 2013
2013
Earlier work this paper cites.
S. Pradhan, A. Moschitti, N. Xue, H. T. Ng, A. Björkelund, O. Uryupina, Y. Zhang, and Z. Zhong, “Towards robust linguistic analysis using ontonotes,” in CoNLL , 2013, pp. 143–152
2013
Cited alongside, same era.
R. Fletcher, Practical methods of optimization . Wiley & Sons, 2013
2013
Cited alongside, same era.
2013
Cited alongside, same era.
N. Kalchbrenner and P. Blunsom, “Recurrent continuous translation models,” in EMNLP , 2013, pp. 1700–1709
2013
Cited alongside, same era.
2014
Cited alongside, same era.
T. Kenter, A. Borisov, C. Van Gysel, M. Dehghani, M. de Rijke, and B. Mitra, “Neural networks for information retrieval,” in Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval . ACM, 2017, pp. 1403–1406
2017
Later among the works it cites.
S. Zheng, Y. Hao, D. Lu, H. Bao, J. Xu, H. Hao, and B. Xu, “Joint entity and relation extraction based on a hybrid neural network,” Neurocomputing , vol. 257, pp. 59–66, 2017
2017
Later among the works it cites.
A. Conneau, H. Schwenk, L. Barrault, and Y. Lecun, “Very deep convolutional networks for text classification,” in European ACL , vol. 1, 2017, pp. 1107–1116
2017
Later among the works it cites.
J. Hopkins and D. Kiela, “Automatically generating rhythmic verse with neural networks,” in Proceedings of the 55th Annual Meeting of the ACL (Volume 1: Long Papers) , 2017, pp. 168–178
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
2014
Cited alongside, same era.
C. N. Dos Santos and M. Gatti, “Deep convolutional neural networks for sentiment analysis of short texts.” in COLING , 2014, pp. 69–78
2014
Cited alongside, same era.
D. Zeng, K. Liu, S. Lai, G. Zhou, J. Zhao et al. , “Relation classification via convolutional deep neural network.” in COLING , 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2014
Cited alongside, same era.
H. Ren and Q. Yang, “Neural joke generation,” Final Project Reports of Course CS224n , 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
K. Lin, D. Li, X. He, Z. Zhang, and M.-T. Sun, “Adversarial ranking for language generation,” in Advances in Neural Information Processing Systems , 2017, pp. 3155–3165
2017
Later among the works it cites.
Y. Zhang, Z. Gan, K. Fan, Z. Chen, R. Henao, D. Shen, and L. Carin, “Adversarial feature matching for text generation,” in 34th International Conference on Machine Learning-Vol 70 . JMLR, 2017
2017
Later among the works it cites.
I. V. Serban, A. Sordoni, R. Lowe, L. Charlin, J. Pineau, A. Courville, and Y. Bengio, “A hierarchical latent variable encoder-decoder model for generating dialogues,” in Thirty-First AAAI Conference on Artificial Intelligence , 2017
2017
Later among the works it cites.
Z. Hu, Z. Yang, X. Liang, R. Salakhutdinov, and E. P. Xing, “Toward controlled generation of text,” in Proceedings of the 34th International Conference on Machine Learning-Volume 70 . JMLR. org, 2017, pp. 1587–1596
2017
Later among the works it cites.
2017
Later among the works it cites.
A. Santoro, D. Raposo, D. G. Barrett, M. Malinowski, R. Pascanu, P. Battaglia, and T. Lillicrap, “A simple neural network module for relational reasoning,” in NIPS , 2017, pp. 4974–4983
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
D. Jurafsky and J. Martin, Speech & language processing (3rd. Edition Draft) . Pearson Education, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
J. Hennessy and D. Patterson, Computer architecture: a quantitative approach . Elsevier, 2017
2017
Later among the works it cites.
Y. Liu and M. Zhang, “Neural network methods for natural language processing,” 2018
2018
Closest in time.
T. Young, D. Hazarika, S. Poria, and E. Cambria, “Recent trends in deep learning based natural language processing,” ieee Computational intelligenCe magazine , vol. 13, no. 3, pp. 55–75, 2018
2018
Closest in time.
A. Radford, K. Narasimhan, T. Salimans, and I. Sutskever, “Improving language understanding by generative pre-training,” URL https://s3-us-west-2.amazonaws.com/openai-assets/research-covers/language-unsupervised/language_understanding_paper.pdf , 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
M. Dehouck and P. Denis, “A framework for understanding the role of morphology in universal dependency parsing,” 2018
2018
Closest in time.
A. More, Ö. Çetinoğlu, Ç. Çöltekin, N. Habash, B. Sagot, D. Seddah, D. Taji, and R. Tsarfaty, “Conll-ul: Universal morphological lattices for universal dependency parsing,” in Proceedings of the Eleventh International Conference on Language Resources and Evaluation , 2018
2018
Closest in time.
Y. Wang, W. Che, J. Guo, and T. Liu, “A neural transition-based approach for semantic dependency graph parsing,” 2018
2018
Closest in time.
2018
Closest in time.
Z. Tan, M. Wang, J. Xie, Y. Chen, and X. Shi, “Deep semantic role labeling with self-attention,” in Thirty-Second AAAI Conference on Artificial Intelligence , 2018
2018
Closest in time.
L. Duong, H. Afshar, D. Estival, G. Pink, P. Cohen, and M. Johnson, “Active learning for deep semantic parsing,” in Proceedings of the 56th Annual Meeting of the ACL (Vol. 2: Short Papers) , 2018, pp. 43–48
2018
Closest in time.
D. Zeman, J. Hajič, M. Popel, M. Potthast, M. Straka, F. Ginter, J. Nivre, and S. Petrov, “Conll 2018 shared task: multilingual parsing from raw text to universal dependencies,” 2018
2018
Closest in time.
2018
Closest in time.
T. Ji, Y. Liu, Y. Wang, Y. Wu, and M. Lan, “Antnlp at conll 2018 shared task: A graph-based parser for universal dependency parsing,” in Proceedings of the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies , 2018, pp. 248–255
2018
Closest in time.
2018
Closest in time.
Y. Yang, W.-t. Yih, and C. Meek, “Wikiqa: A challenge dataset for open-domain question answering,” in EMNLP , 2015, pp. 2013–2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
H. Zamani, M. Dehghani, W. B. Croft, E. Learned-Miller, and J. Kamps, “From neural re-ranking to neural ranking: Learning a sparse representation for inverted indexing,” in 27th ACM International Conference on Information and Knowledge Management . ACM, 2018
2018
Closest in time.
A. Akbik, D. Blythe, and R. Vollgraf, “Contextual string embeddings for sequence labeling,” in COLING , 2018, pp. 1638–1649
2018
Closest in time.
M. Sun, X. Li, X. Wang, M. Fan, Y. Feng, and P. Li, “Logician: A unified end-to-end neural approach for open-domain information extraction,” in ACM Intnl Conf on Web Search and Data Mining , 2018
2018
Closest in time.
M. Jiang, Y. Liang, X. Feng, X. Fan, Z. Pei, Y. Xue, and R. Guan, “Text classification based on deep belief network and softmax regression,” Neural Computing and Applications , vol. 29, no. 1, pp. 61–70, 2018
2018
Closest in time.
J. Wei, Q. Zhou, and Y. Cai, “Poet-based poetry generation: Controlling personal style with recurrent neural networks,” in 2018 International Conference on Computing, Networking and Communications (ICNC) . IEEE, 2018, pp. 156–160
2018
Closest in time.
Z. Yu, J. Tan, and X. Wan, “A neural approach to pun generation,” in Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Vol. 1: Long Papers) , 2018, pp. 1650–1660
2018
Closest in time.
2018
Closest in time.
N. Peng, M. Ghazvininejad, J. May, and K. Knight, “Towards controllable story generation,” in Proceedings of the First Workshop on Storytelling , 2018, pp. 43–49
2018
Closest in time.
L. J. Martin, P. Ammanabrolu, X. Wang, W. Hancock, S. Singh, B. Harrison, and M. O. Riedl, “Event representations for automated story generation with deep neural nets,” in Thirty-Second AAAI Conference on Artificial Intelligence , 2018
2018
Closest in time.
E. Clark, Y. Ji, and N. A. Smith, “Neural text generation in stories using entity representations as context,” in Proceedings of the 2018 Conference of the North American Chapter of the ACL: Human Language Technologies, Vol. 1 (Long Papers) , 2018, pp. 2250–2260
2018
Closest in time.
2018
Closest in time.
M. Drissi, O. Watkins, and J. Kalita, “Hierarchical text generation using an outline,” Intl Conf on NLP , 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
L. Chen, S. Dai, C. Tao, H. Zhang, Z. Gan, D. Shen, Y. Zhang, G. Wang, R. Zhang, and L. Carin, “Adversarial text generation via feature-mover’s distance,” in Advances in Neural Information Processing Systems , 2018, pp. 4666–4677
2018
Closest in time.
J. Guo, S. Lu, H. Cai, W. Zhang, Y. Yu, and J. Wang, “Long text generation via adversarial training with leaked information,” in Thirty-Second AAAI Conference on Artificial Intelligence , 2018
2018
Closest in time.
A. Gatt and E. Krahmer, “Survey of the state of the art in natural language generation: Core tasks, applications and evaluation,” Journal of Artificial Intelligence Research , vol. 61, pp. 65–170, 2018
2018
Closest in time.
J. Krantz and J. Kalita, “Abstractive summarization using attentive neural techniques,” Intl Conf on NLP , 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
S. Kuang, D. Xiong, W. Luo, and G. Zhou, “Modeling coherence for neural machine translation with dynamic and topic caches,” in COLING , 2018, pp. 596–606
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
L. Zheng, H. Wang, and S. Gao, “Sentimental feature selection for sentiment analysis of chinese online reviews,” Intnl J. of Machine Learning and Cybernetics , vol. 9, no. 1, pp. 75–84, 2018
2018
Closest in time.
M. Etter, E. Colleoni, L. Illia, K. Meggiorin, and A. D’Eugenio, “Measuring organizational legitimacy in social media: Assessing citizens’ judgments with sentiment analysis,” Business & Society , vol. 57, no. 1, pp. 60–97, 2018
2018
Closest in time.
2018
Closest in time.
2019
Closest in time.
R. T. McCoy, E. Pavlick, and T. Linzen, “Right for the wrong reasons: Diagnosing syntactic heuristics in natural language inference,” ACL , 2019
2019
Closest in time.
2019
Closest in time.
S. MacAvaney, A. Yates, A. Cohan, and N. Goharian, “Cedr: Contextualized embeddings for document ranking,” CoRR , 2019
2019
Closest in time.
2019
Closest in time.
C. Lin, T. Miller, D. Dligach, S. Bethard, and G. Savova, “A bert-based universal model for both within-and cross-sentence clinical temporal relation extraction,” in Clinical NLP Workshop , 2019, pp. 65–71
2019
Closest in time.
2019
Closest in time.
A. Radford, J. Wu, R. Child, D. Luan, D. Amodei, and I. Sutskever, “Language models are unsupervised multitask learners,” OpenAI Blog , vol. 1, no. 8, 2019
2019
Closest in time.
B. Bena and J. Kalita, “Introducing aspects of creativity in automatic poetry generation,” in Intnl Conf on NLP , 2019
2019
Closest in time.
S. Tucker and J. Kalita, “Genrating believable poetry in multiple languages using gpt-2,” in Technical Report, University of Colorado, Colorado Springs , 2019
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
E. Clark, A. Celikyilmaz, and N. A. Smith, “Sentence mover, similarity: Automatic evaluation for multi-sentence texts,” in Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics , 2019, pp. 2748–2760
2019
Closest in time.
2019
Closest in time.
M. Hossain, F. Sohel, M. F. Shiratuddin, and H. Laga, “A comprehensive survey of deep learning for image captioning,” ACM Computing Surveys (CSUR) , vol. 51, no. 6, p. 118, 2019
2019
Closest in time.
X. Liu, Q. Xu, and N. Wang, “A survey on deep neural network-based image captioning,” The Visual Computer , vol. 35, no. 3, 2019
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
B. Hu, Z. Lu, H. Li, and Q. Chen, “Convolutional neural network architectures for matching natural language sentences,” in NIPS , 2014, pp. 2042–2050
2050
Closest in time.