Fetching the paper…
Reading the bibliography…
Constituency parsing is a fundamental yet unsolved challenge in natural language processing.
J. Maynez, S. Narayan, B. Bohnet, and R. McDonald, “On faithfulness and factuality in abstractive summarization,” in Proc. of ACL . Association for Computational Linguistics, 2020, pp. 1906–1919
1919
Earlier work this paper cites.
F. C. N. Pereira and D. H. D. Warren, “Parsing as deduction,” in Proc. of ACL . Association for Computational Linguistics, 1983, pp. 137–144
1983
Earlier work this paper cites.
M. P. Marcus, B. Santorini, and M. A. Marcinkiewicz, “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.
M. Collins, “Three generative, lexicalised models for statistical parsing,” in Proc. of ACL . Association for Computational Linguistics, 1997, pp. 16–23
1997
Earlier work this paper cites.
M. Collins, J. Hajic, L. Ramshaw, and C. Tillmann, “A statistical parser for Czech,” in Proc. of ACL . Association for Computational Linguistics, 1999, pp. 505–512
1999
Earlier work this paper cites.
E. Charniak, “A maximum-entropy-inspired parser,” in Proc. of NAACL . Association for Computational Linguistics, 2000, p. 132–139
2000
Earlier work this paper cites.
H. Yamada and Y. Matsumoto, “Statistical dependency analysis with support vector machines,” in Proceedings of the Eighth International Conference on Parsing Technologies , 2003, pp. 195–206
2003
Earlier work this paper cites.
K. Sagae and A. Lavie, “A classifier-based parser with linear run-time complexity,” in Proceedings of the Ninth International Workshop on Parsing Technology . Association for Computational Linguistics, 2005, pp. 125–132
2005
Earlier work this paper cites.
S. Petrov and D. Klein, “Improved inference for unlexicalized parsing,” in Proc. of NAACL . Association for Computational Linguistics, 2007, pp. 404–411
2007
Earlier work this paper cites.
J. Nivre and R. McDonald, “Integrating graph-based and transition-based dependency parsers,” in Proc. of ACL . Association for Computational Linguistics, 2008, pp. 950–958
2008
Earlier work this paper cites.
Y. Zhang and S. Clark, “Transition-based parsing of the Chinese treebank using a global discriminative model,” in Proc. of IWPT . Association for Computational Linguistics, 2009, pp. 162–171
2009
Earlier work this paper cites.
N. Kornell, M. J. Hays, and R. A. Bjork, “Unsuccessful retrieval attempts enhance subsequent learning.” Journal of experimental psychology. Learning, memory, and cognition , vol. 35 (4), pp. 989–98, 2009
2009
Earlier work this paper cites.
G. Durrett and D. Klein, “Neural CRF parsing,” in Proc. of ACL . Association for Computational Linguistics, 2015, pp. 302–312
2015
Earlier work this paper cites.
O. Vinyals, L. Kaiser, T. Koo, S. Petrov, I. Sutskever, and G. E. Hinton, “Grammar as a foreign language,” in Proc. of NeurIPS , 2015, pp. 2773–2781
2015
Earlier work this paper cites.
C. Dyer, A. Kuncoro, M. Ballesteros, and N. A. Smith, “Recurrent neural network grammars,” in Proc. of NAACL-HLT . Association for Computational Linguistics, 2016, pp. 199–209
2016
Earlier work this paper cites.
J. Cross and L. Huang, “Span-based constituency parsing with a structure-label system and provably optimal dynamic oracles,” in Proc. of EMNLP . Association for Computational Linguistics, 2016, pp. 1–11
2016
Earlier work this paper cites.
H. Kamigaito, K. Hayashi, T. Hirao, H. Takamura, M. Okumura, and M. Nagata, “Supervised attention for sequence-to-sequence constituency parsing,” in Proc. of IJCNLP (Volume 2: Short Papers) . Asian Federation of Natural Language Processing, 2017, pp. 7–12
2017
Earlier work this paper cites.
J. Liu and Y. Zhang, “In-order transition-based constituent parsing,” Transactions of the Association for Computational Linguistics , vol. 5, pp. 413–424, 2017
2017
Earlier work this paper cites.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,” in Proc. of NeurIPS , 2017, pp. 5998–6008
2017
Earlier work this paper cites.
J. Metcalfe, “Learning from errors,” Annual review of psychology , vol. 68, p. 465—489, 2017
2017
Earlier work this paper cites.
X. Wang, H. Pham, P. Yin, and G. Neubig, “A tree-based decoder for neural machine translation,” in Proc. of EMNLP . Association for Computational Linguistics, 2018, pp. 4772–4777
2018
Earlier work this paper cites.
L. Liu, M. Zhu, and S. Shi, “Improving sequence-to-sequence constituency parsing,” in Proc. of AAAI . AAAI Press, 2018, pp. 4873–4880
2018
Earlier work this paper cites.
N. Kitaev and D. Klein, “Constituency parsing with a self-attentive encoder,” in Proc. of ACL . Association for Computational Linguistics, 2018, pp. 2676–2686
2018
Earlier work this paper cites.
M. Jiang and J. Diesner, “A constituency parsing tree based method for relation extraction from abstracts of scholarly publications,” in Proc. of TextGraphs . Association for Computational Linguistics, 2019, pp. 186–191
2019
Earlier work this paper cites.
J. Xu and G. Durrett, “Neural extractive text summarization with syntactic compression,” in Proc. of EMNLP . Association for Computational Linguistics, 2019, pp. 3292–3303
2019
Earlier work this paper cites.
N. Kitaev, S. Cao, and D. Klein, “Multilingual constituency parsing with self-attention and pre-training,” in Proc. of ACL . Association for Computational Linguistics, 2019, pp. 3499–3505
2019
Earlier work this paper cites.
A. Radford, J. Wu, R. Child, D. Luan, D. Amodei, I. Sutskever et al. , “Language models are unsupervised multitask learners,” OpenAI blog , vol. 1, no. 8, p. 9, 2019
2019
Cited alongside, same era.
Y. Zhang, H. Zhou, and Z. Li, “Fast and accurate neural CRF constituency parsing,” in Proc. of IJCAI . ijcai.org, 2020, pp. 4046–4053
2020
Cited alongside, same era.
D. Fernández-González and C. Gómez-Rodríguez, “Enriched in-order linearization for faster sequence-to-sequence constituent parsing,” in Proc. of ACL . Association for Computational Linguistics, 2020, pp. 4092–4099
2020
Cited alongside, same era.
T. B. Brown, B. Mann, N. Ryder, M. Subbiah, J. Kaplan, P. Dhariwal, A. Neelakantan, P. Shyam, G. Sastry, A. Askell, S. Agarwal, A. Herbert-Voss, G. Krueger, T. Henighan, R. Child, A. Ramesh, D. M. Ziegler, J. Wu, C. Winter, C. Hesse, M. Chen, E. Sigler, M. Litwin, S. Gray, B. Chess, J. Clark, C. Berner, S. McCandlish, A. Radford, I. Sutskever, and D. Amodei, “Language models are few-shot learners,” in Proc. of NeurIPS , 2020
X. Sun, X. Li, J. Li, F. Wu, S. Guo, T. Zhang, and G. Wang, “Text classification via large language models,” in Findings of ACL: EMNLP 2023 . Association for Computational Linguistics, 2023, pp. 8990–9005
2023
Closest in time.
Y. Chen, Y. Liu, R. Xu, Z. Yang, C. Zhu, M. Zeng, and Y. Zhang, “UniSumm and SummZoo: Unified model and diverse benchmark for few-shot summarization,” in Proc. of ACL . Association for Computational Linguistics, 2023, pp. 12 833–12 855
2023
Closest in time.
2023
Closest in time.
C. Qin, A. Zhang, Z. Zhang, J. Chen, M. Yasunaga, and D. Yang, “Is ChatGPT a general-purpose natural language processing task solver?” in Proc. of EMNLP . Association for Computational Linguistics, 2023, pp. 1339–1384
2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2020
Cited alongside, same era.
Y. Tian, Y. Song, F. Xia, and T. Zhang, “Improving constituency parsing with span attention,” in Findings of ACL: EMNLP 2020 . Association for Computational Linguistics, 2020, pp. 1691–1703
2020
Cited alongside, same era.
K. Yang and J. Deng, “Strongly incremental constituency parsing with graph neural networks,” in Proc. of NeurIPS , 2020, pp. 21 687–21 698
2020
Cited alongside, same era.
S. Cao, N. Kitaev, and D. Klein, “Unsupervised parsing via constituency tests,” in Proc. of EMNLP . Association for Computational Linguistics, 2020, pp. 4798–4808
2020
Cited alongside, same era.
S. Gururangan, A. Marasovic, S. Swayamdipta, K. Lo, I. Beltagy, D. Downey, and N. A. Smith, “Don’t stop pretraining: Adapt language models to domains and tasks,” in Proc. of ACL . Association for Computational Linguistics, 2020, pp. 8342–8360
2020
Cited alongside, same era.
A. Holtzman, J. Buys, L. Du, M. Forbes, and Y. Choi, “The curious case of neural text degeneration,” in Proc. of ICLR . OpenReview.net, 2020
2020
Cited alongside, same era.
T.-T. Nguyen, X.-P. Nguyen, S. Joty, and X. Li, “A conditional splitting framework for efficient constituency parsing,” in Proc. of ACL . Association for Computational Linguistics, 2021, pp. 5795–5807
2021
Cited alongside, same era.
D. Hendrycks, C. Burns, S. Basart, A. Zou, M. Mazeika, D. Song, and J. Steinhardt, “Measuring massive multitask language understanding,” in Proc. of ICLR . OpenReview.net, 2021
2021
Cited alongside, same era.
X. Gu, Y. Shen, J. Shen, J. Shang, and J. Han, “Phrase-aware unsupervised constituency parsing,” in Proc. of ACL . Association for Computational Linguistics, 2022, pp. 6406–6415
2022
Cited alongside, same era.
A. Chowdhery, S. Narang, J. Devlin, M. Bosma, G. Mishra, A. Roberts, P. Barham, H. W. Chung, C. Sutton, S. Gehrmann et al. , “Palm: Scaling language modeling with pathways,” J. Mach. Learn. Res. , vol. 24, pp. 240:1–240:113, 2023
2023
Closest in time.
2023
Closest in time.
P. Liang, R. Bommasani, T. Lee, D. Tsipras, D. Soylu, M. Yasunaga, Y. Zhang, D. Narayanan, Y. Wu, A. Kumar et al. , “Holistic evaluation of language models,” Trans. Mach. Learn. Res. , vol. 2023, 2023
2023
Closest in time.
L. Gao, J. Schulman, and J. Hilton, “Scaling laws for reward model overoptimization,” in Proc. of ICML , vol. 202. PMLR, 2023, pp. 10 835–10 866
2023
Closest in time.
R. OpenAI, “Gpt-4 technical report,” arXiv , pp. 2303–08 774, 2023
2023
Closest in time.
W.-L. Chiang, Z. Li, Z. Lin, Y. Sheng, Z. Wu, H. Zhang, L. Zheng, S. Zhuang, Y. Zhuang, J. E. Gonzalez, I. Stoica, and E. P. Xing, “Vicuna: An open-source chatbot impressing gpt-4 with 90%* chatgpt quality,” LMSYS blog , vol. 2023, 2023
2023
Closest in time.
C. Xu, D. Guo, N. Duan, and J. McAuley, “Baize: An open-source chat model with parameter-efficient tuning on self-chat data,” in Proc. of EMNLP . Association for Computational Linguistics, 2023, pp. 6268–6278
2023
Closest in time.
Y. Ge, W. Hua, K. Mei, J. Ji, J. Tan, S. Xu, Z. Li, and Y. Zhang, “Openagi: When LLM meets domain experts,” in Proc. of NeurIPS , 2023, pp. 5539–5568
2023
Closest in time.
C. Zhou, P. Liu, P. Xu, S. Iyer, J. Sun, Y. Mao, X. Ma, A. Efrat, P. Yu, L. Yu, S. Zhang, G. Ghosh, M. Lewis, L. Zettlemoyer, and O. Levy, “LIMA: less is more for alignment,” in Proc. of NeurIPS , 2023, pp. 55 006–55 021
2023
Closest in time.
Y. Bang, S. Cahyawijaya, N. Lee, W. Dai, D. Su, B. Wilie, H. Lovenia, Z. Ji, T. Yu, W. Chung, Q. V. Do, Y. Xu, and P. Fung, “A multitask, multilingual, multimodal evaluation of ChatGPT on reasoning, hallucination, and interactivity,” in Proc. of IJCNLP . Association for Computational Linguistics, 2023, pp. 675–718
2023
Closest in time.
A. Toroghi, W. Guo, A. Pesaranghader, and S. Sanner, “Verifiable, debuggable, and repairable commonsense logical reasoning via LLM-based theory resolution,” in Proc. of EMNLP . Association for Computational Linguistics, 2024, pp. 6634–6652
2024
Closest in time.
T. Zhang, F. Ladhak, E. Durmus, P. Liang, K. McKeown, and T. B. Hashimoto, “Benchmarking large language models for news summarization,” Transactions of the Association for Computational Linguistics , vol. 12, pp. 39–57, 2024
2024
Closest in time.
Y. Tian, F. Xia, and Y. Song, “Large language models are no longer shallow parsers,” in Proc. of ACL . Association for Computational Linguistics, 2024, pp. 7131–7142
2024
Closest in time.
D. Xu, W. Chen, W. Peng, C. Zhang, T. Xu, X. Zhao, X. Wu, Y. Zheng, Y. Wang, and E. Chen, “Large language models for generative information extraction: a survey,” Frontiers Comput. Sci. , vol. 18, no. 6, p. 186357, 2024
2024
Closest in time.
Z. Li, Y. Zeng, Y. Zuo, W. Ren, W. Liu, M. Su, Y. Guo, Y. Liu, X. Li, Z. Hu, L. Bai, W. Li, Y. Liu, P. Yang, X. Jin, J. Guo, and X. Cheng, “Knowcoder: Coding structured knowledge into llms for universal information extraction,” in Proc. of ACL . Association for Computational Linguistics, 2024, pp. 8758–8779
2024
Closest in time.
É. Simon, H. Olsen, H. You, S. Touileb, L. Øvrelid, and E. Velldal, “Generative approaches to event extraction: Survey and outlook,” in Proc. of FuturED . Association for Computational Linguistics, 2024, pp. 73–86
2024
Closest in time.
Z. Meng, T. Liu, H. Zhang, K. Feng, and P. Zhao, “CEAN: Contrastive event aggregation network with LLM-based augmentation for event extraction,” in Proc. of EACL . Association for Computational Linguistics, 2024, pp. 321–333
2024
Closest in time.
Y. Zhu, X. Wang, J. Chen, S. Qiao, Y. Ou, Y. Yao, S. Deng, H. Chen, and N. Zhang, “Llms for knowledge graph construction and reasoning: recent capabilities and future opportunities,” World Wide Web (WWW) , vol. 27, no. 5, p. 58, 2024
2024
Closest in time.
P. Schneider, M. Klettner, K. Jokinen, E. Simperl, and F. Matthes, “Evaluating large language models in semantic parsing for conversational question answering over knowledge graphs,” in Proc. of ICAART . SCITEPRESS, 2024, pp. 807–814
2024
Closest in time.
W. Lu, R. K. Luu, and M. J. Buehler, “Fine-tuning large language models for domain adaptation: Exploration of training strategies, scaling, model merging and synergistic capabilities,” npj Computational Materials , vol. 11, no. 1, p. 84, 2025
2025
Closest in time.
L. Cui, S. Yang, and Y. Zhang, “Investigating non-local features for neural constituency parsing,” in Proc. of ACL . Association for Computational Linguistics, 2022, pp. 2065–2075
2075
Closest in time.