The Stanford Typed Dependencies Representation

By Marie-Catherine de Marneffe, Christopher D. Manning. 2008

1,022 citations recorded by the source corpus.

This paper examines the Stanford typed dependencies representation, which was designed to provide a straightforward description of grammatical relations for any user who could benefit from automatic text understanding. For such purposes, we argue that dependency schemes must follow a simple design and provide semantically contentful information, as well as offer an automatic procedure to extract the relations. We consider the underlying design principles of the Stanford scheme from this perspective, and compare it to the GR and PARC representations. Finally, we address the question of the suitability of the Stanford scheme for parser evaluation.

Subfields: Artificial Intelligence, Information Extraction, Computational Linguistics & Semantics

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. Mohit Bansal
  2. Christopher D. Manning
  3. Yejin Choi
  4. Jianfeng Gao
  5. Percy Liang
  6. Luke S. Zettlemoyer
  7. Hannaneh Hajishirzi
  8. Yoav Goldberg

In Information Extraction

  1. Yoav Goldberg
  2. Gregory F. Coppola
  3. Sanda M. Harabagiu
  4. Daniel Klein
  5. Jacob Andreas
  6. Marcus Rohrbach
  7. Trevor Darrell
  8. Omer Levy

In Computational Linguistics & Semantics

  1. Yoav Goldberg
  2. Gregory F. Coppola
  3. Daniel Klein
  4. Eduard H. Hovy
  5. Jacob Andreas
  6. Marcus Rohrbach
  7. Trevor Darrell
  8. Christopher D. Manning

Citations in the corpus