• Computer Science
  • Published in LREC 2010

Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy

@inproceedings{Cer2010ParsingTS,
  title={Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy},
  author={Daniel Matthew Cer and Marie-Catherine de Marneffe and Dan Jurafsky and Christopher D. Manning},
  booktitle={LREC},
  year={2010}
}
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically designed for dependency parsing (Nivre, Nivre Eager, Covington, Eisner, and RelEx) as well as dependencies extracted from constituent parse trees created by phrase structure parsers (Charniak, Charniak-Johnson, Bikel, Berkeley and Stanford). We found that phrase structure parsers systematically outperform algorithms designed… CONTINUE READING

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 120 CITATIONS

An Empirical Comparison of Parsing Methods for Stanford Dependencies

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Enhancing the Description-to-Behavior Fidelity in Android Apps with Privacy Policy

  • IEEE Transactions on Software Engineering
  • 2018
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2008
2019

CITATION STATISTICS

  • 21 Highly Influenced Citations

  • Averaged 8 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 29 REFERENCES