Efficient extraction of grammatical relations

IWPT 2005 - Proceedings of the 9th International Workshop on Parsing Technologies

Volumn , Issue , 2005, Pages 160-170

  Watson, Rebecca ^a   Carroll, John ^b   Briscoe, Ted ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

GRAMMATICAL RELATIONS; INSIDE AND OUTSIDE PROBABILITIES; LOST EFFICIENCY; PARSE FOREST;

FORESTRY;

EID: 37249080970     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. J. K. Baker. 1979. Trainable grammars for speech recognition. In D. Klatt and J. Wolf, editors, Speech Communications Papers for the 97th Meeting of the Acoustical Society of America, pages 557-550.
2. Ted Briscoe and John Carroll. 1995. Developing and evaluating a probabilistic LR parser of part-of-speech and punctuation labels. In Proceedings of the ACL/SIGPARSE 4th International Workshop on Parsing Technologies, pages 48-58, Prague/Karlovy Vary, Czech Republic.
3. Ted Briscoe and John Carroll. 2002. Robust accurate statistical annotation of general text. In Proceedings of the Conference on Language Resources and Evaluation (LREC 2002), pages 1499-1504, Palmas, Canary Islands, May.
4. Ted Briscoe and John Carroll. 2005. Evaluating the speed and accuracy of an unlexicalized statistical parser on the PARC Depbank. Under review.
5. John Carroll and Ted Briscoe. 2002. High precision extraction of grammatical relations. In Proceedings of the 19th International Conference on Computational Linguistics, Taipei, Taiwan.
6. John Carroll, Ted Briscoe, and Antonio Sanfilippo. 1998. Parser evaluation: a survey and a new proposal. In Proceedings of the 1st International Conference on Language Resources and Evaluation, pages 447-454, Granada.
7. John Carroll. 1993. Practical unification-based parsing of natural language. Ph.D. thesis, Computer Laboratory, University of Cambridge. Technical Report No. 314.
8. Stephen Clark and James Curran. 2004. Parsing the WSJ using CCG and log-linear models. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, pages 104-111, Barcelona, Spain.
9. Ann Copestake. 2003. Report on the design of RMRS. DeepThought Project Deliverable D1.1a, University of Cambridge, UK.
10. Stuart Geman and Mark Johnson. 2002. Dynamic programming for parsing and estimation of stochastic unification-based grammars. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Philadelphia, PA.
11. Mark Johnson. 2001. Joint and conditional estimation of tagging and parsing models. In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL), Toulouse, France, July.
12. Ronald Kaplan, Stephen Riezler, Tracy King, John Maxwell, Alexander Vasserman, and Richard Crouch. 2004. Speed and accuracy in shallow and deep stochastic parsing. In Proceedings of the Human Language Technology conference/North American chapter of the Association for Computational Linguistics annual meeting, pages 97-113, Boston, Massachusetts, May.
13. Tracy King, Richard Crouch, Stephen Riezler, Mary Dalrymple, and Ronald Kaplan. 2003. The PARC700 Dependency Bank. In Proceedings of the 4th International Workshop on Linguistically Interpreted Corpora (LINC-03).
14. Karim Lari and Steve Young. 1990. The estimation of stochastic context-free grammars using the Inside-Outside algorithm. Computer Speech and Language, 2(4):35-56.
15. Dekang Lin. 1998. Dependency-based evaluation of MINIPAR. In Proceedings of the Workshop on The Evaluation of Parsing Systems at the 1st International Conference on Language Resources and Evaluation, Granada, Spain.
16. Yusuke Miyao and Jun'ichi Tsujii. 2002. Maximum entropy estimation for feature forests. In Proceedings of the Human Language Technology Conference, San Diego, California, March.
17. Stephan Oepen and John Carroll. 2000. Ambiguity packing in constraint-based parsing - practical results. In Proceedings of the North American Chapter of the Association for Computational Linguistics (NAACL), pages 162-169, Seattle, WA.
18. Geoffrey Sampson. 1995. English for the Computer. Oxford University Press.
19. Helmut Schmid and Mats Rooth. 2001. Parse forest computation of expected governors. In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics, pages 458-465.
20. Ben Taskar, Dan Klein, Michael Collins, Daphne Koller, and Christopher Manning. 2004. Max-margin parsing. In Proceedings of the Conference on Empirical Methods in Natural Language Processing.