Cross-Domain Generalization of Neural Constituency Parsers

By Daniel Fried, Nikita Kitaev, Daniel Klein. 2019

40 citations recorded by the source corpus.

Neural parsers obtain state-of-the-art results on benchmark treebanks for constituency parsing—but to what degree do they generalize to other domains? We present three results about the generalization of neural parsers in a zero-shot setting: training on trees from one corpus and evaluating on out-of-domain corpora. First, neural and non-neural parsers generalize comparably to new domains. Second, incorporating pre-trained encoder representations into neural parsers substantially improves their performance across all domains, but does not give a larger relative improvement for out-of-domain treebanks. Finally, despite the rich input representations they learn, neural parsers still benefit from structured output prediction of output trees, yielding higher exact match accuracy and stronger generalization both to larger text spans and to out-of-domain corpora. We analyze generalization on English and Chinese corpora, and in the process obtain state-of-the-art parsing results for the Brown, Genia, and English Web treebanks.

Subfields: Artificial Intelligence, Natural Language Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Graham Neubig
  2. Luke S. Zettlemoyer
  3. Mohit Bansal
  4. Percy Liang
  5. Jianfeng Gao
  6. Quoc V. Le
  7. Noah A. Smith
  8. Kyunghyun Cho

In Natural Language Processing

  1. Graham Neubig
  2. Sebastian Ruder
  3. Phil Blunsom
  4. Kyunghyun Cho
  5. Dani Yogatama
  6. Dawn Song
  7. Mohit Bansal
  8. Luke S. Zettlemoyer

Citations in the corpus