@inproceedings{Roark:1999,
  abstract = {This paper examines efficient predictive broad-coverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses that are fully connected trees spanning the entire left context, from which any kind of non-local dependency or partial semantic interpretation can in principle be read. We contrast two predictive parsing approaches, top-down and left-corner parsing, and find both to be viable. In addition, we find that enhancement with non-local information not only improves parser accuracy, but also substantially improves the search efficiency.},
  added-at = {2007-12-14T02:45:54.000+0100},
  author = {Roark, Brian and Johnson, Mark},
  biburl = {http://www.bibsonomy.org/bibtex/2ecb48cd1d1818a0015f7128de2257088/diego_ma},
  booktitle = {Proc. ACL'99},
  interhash = {79c00970e4c4ca6552ba2fa3b149f3c9},
  intrahash = {ecb48cd1d1818a0015f7128de2257088},
  keywords = {parsers statistic_nlp},
  note = {\myurl{http://arXiv.org/abs/cs/0008017}},
  pages = {421-428},
  timestamp = {2007-12-14T02:45:54.000+0100},
  title = {Efficient Probabilistic Top-down and Left-corner Parsing},
  url = {http://arXiv.org/abs/cs/0008017},
  year = 1999
}