Article

Free access

Building deep dependency structures with a wide-coverage CCG parser

Authors:

Julia Hockenmaier,

Mark SteedmanAuthors Info & Claims

ACL '02: Proceedings of the 40th Annual Meeting on Association for Computational Linguistics

Pages 327 - 334

https://doi.org/10.3115/1073083.1073138

Published: 06 July 2002 Publication History

Abstract

This paper describes a wide-coverage statistical parser that uses Combinatory Categorial Grammar (CCG) to derive dependency structures. The parser differs from most existing wide-coverage treebank parsers in capturing the long-range dependencies inherent in constructions such as coordination, extraction, raising and control, as well as the standard local predicate-argument dependencies. A set of dependency structures used for training and testing the parser is obtained from a treebank of CCG normal-form derivations, which have been derived (semi-) automatically from the Penn Treebank. The parser correctly recovers over 80% of labelled dependencies, and around 90% of unlabelled dependencies.

References

[1]

Steven Abney. 1997. Stochastic attribute-value grammars. Computational Linguistics, 23(4):597--618.

Digital Library

[2]

Srinivas Bangalore and Aravind Joshi. 1999. Supertagging: An approach to almost parsing. Computational Linguistics, 25(2):237--265.

Digital Library

[3]

John Carroll, Ted Briscoe, and Antonio Sanfilippo. 1998. Parser evaluation: a survey and a new proposal. In Proceedings of the 1st LREC Conference, pages 447--454, Granada, Spain.

[4]

Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of the 1st Meeting of the NAACL, pages 132--139, Seattle, WA.

Digital Library

[5]

David Chiang. 2000. Statistical parsing with an automatically-extracted Tree Adjoining Grammar. In Proceedings of the 38th Meeting of the ACL, pages 456--463, Hong Kong.

Digital Library

[6]

Stephen Clark and Julia Hockenmaier. 2002. Evaluating a wide-coverage CCG parser. In Proceedings of the LREC Beyond PARSEVAL workshop (to appear), Las Palmas, Spain.

[7]

Stephen Clark. 2002. A supertagger for Combinatory Categorial Grammar. In Proceedings of the 6th International Workshop on Tree Adjoining Grammars and Related Frameworks (to appear), Venice, Italy.

[8]

Michael Collins. 1996. A new statistical parser based on bigram lexical dependencies. In Proceedings of the 34th Meeting of the ACL, pages 184--191, Santa Cruz, CA.

Digital Library

[9]

Michael Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.

Digital Library

[10]

Jason Eisner. 1996a. Efficient normal-form parsing for Combinatory Categorial Grammar. In Proceedings of the 34th Meeting of the ACL, pages 79--86, Santa Cruz, CA.

Digital Library

[11]

Jason Eisner. 1996b. Three new probabilistic models for dependency parsing: An exploration. In Proceedings of the 16th COLING Conference, pages 340--345, Copenhagen, Denmark.

Digital Library

[12]

Julia Hockenmaier and Mark Steedman. 2002a. Acquiring compact lexicalized grammars from a cleaner treebank. In Proceedings of the Third LREC Conference (to appear), Las Palmas, Spain.

[13]

Julia Hockenmaier and Mark Steedman. 2002b. Generative models for statistical parsing with Combinatory Categorial Grammar. In Proceedings of the 40th Meeting of the ACL (to appear), Philadelphia, PA.

Digital Library

[14]

Mark Johnson, Stuart Geman, Stephen Canon, Zhiyi Chi, and Stefan Riezler. 1999. Estimators for stochastic 'unification-based' grammars. In Proceedings of the 37th Meeting of the ACL, pages 535--541, University of Maryland, MD.

Digital Library

[15]

Nobo Komagata. 1997. Efficient parsing for CCGs with generalized type-raised categories. In Proceedings of the 5th International Workshop on Parsing Technologies, pages 135--146, Boston, MA.

[16]

Dekang Lin. 1995. A dependency-based method for evaluating broad-coverage parsers. In Proceedings of IJCAI-95, pages 1420--1425, Montreal, Canada.

Digital Library

[17]

Adwait Ratnaparkhi. 1996. A maximum entropy part-of-speech tagger. In Proceedings of the EMNLP Conference, pages 133--142, Philadelphia, PA.

[18]

Mark Steedman. 2000. The Syntactic Process. The MIT Press, Cambridge, MA.

Digital Library

Cited By

Gordon CMatskevich SStorm THirschfeld R(2023)Trustworthy Formal Natural Language SpecificationsProceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software10.1145/3622758.3622890(50-70)Online publication date: 18-Oct-2023
https://dl.acm.org/doi/10.1145/3622758.3622890
Ng DCurran JLi HLin COsborne M(2012)Dependency hashing for n-best CCG parsingProceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 110.5555/2390524.2390594(497-505)Online publication date: 8-Jul-2012
https://dl.acm.org/doi/10.5555/2390524.2390594
Auli MLopez AMerlo PBarzilay RJohnson M(2011)Training a log-linear parser with loss functions via softmax-marginProceedings of the Conference on Empirical Methods in Natural Language Processing10.5555/2145432.2145471(333-343)Online publication date: 27-Jul-2011
https://dl.acm.org/doi/10.5555/2145432.2145471
Show More Cited By

Building deep dependency structures with a wide-coverage CCG parser
1. Computing methodologies
  1. Artificial intelligence
2. Hardware
  1. Power and energy
    1. Power estimation and optimization

Recommendations

Integrating Multiple Dependency Corpora for Inducing Wide-Coverage Japanese CCG Resources

A novel method to induce wide-coverage Combinatory Categorial Grammar (CCG) resources for Japanese is proposed in this article. For some languages including English, the availability of large annotated corpora and the development of data-based induction ...
Wide-coverage efficient statistical parsing with ccg and log-linear models

This article describes a number of log-linear parsing models for an automatically extracted lexicalized grammar. The models are “full” parsing models in the sense that probabilities are defined for complete parses, rather than for independent events ...
Log-linear models for wide-coverage CCG parsing
EMNLP '03: Proceedings of the 2003 conference on Empirical methods in natural language processing

This paper describes log-linear parsing models for Combinatory Categorial Grammar (CCG). Log-linear models can easily encode the long-range dependencies inherent in coordination and extraction phenomena, which CCG was designed to handle. Log-linear ...

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

ACL '02: Proceedings of the 40th Annual Meeting on Association for Computational Linguistics

July 2002

543 pages

General Chair:
Pierre Isabelle

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 06 July 2002

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 85 of 443 submissions, 19%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
377
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)12

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Gordon CMatskevich SStorm THirschfeld R(2023)Trustworthy Formal Natural Language SpecificationsProceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software10.1145/3622758.3622890(50-70)Online publication date: 18-Oct-2023
https://dl.acm.org/doi/10.1145/3622758.3622890
Ng DCurran JLi HLin COsborne M(2012)Dependency hashing for n-best CCG parsingProceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 110.5555/2390524.2390594(497-505)Online publication date: 8-Jul-2012
https://dl.acm.org/doi/10.5555/2390524.2390594
Auli MLopez AMerlo PBarzilay RJohnson M(2011)Training a log-linear parser with loss functions via softmax-marginProceedings of the Conference on Empirical Methods in Natural Language Processing10.5555/2145432.2145471(333-343)Online publication date: 27-Jul-2011
https://dl.acm.org/doi/10.5555/2145432.2145471
Cuayáhuitl HDethlefs N(2011)Spatially-aware dialogue control using hierarchical reinforcement learningACM Transactions on Speech and Language Processing 10.1145/1966407.19664107:3(1-26)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1966407.1966410
Fowler TPenn GHajič J(2010)Accurate context-free parsing with combinatory categorial grammarProceedings of the 48th Annual Meeting of the Association for Computational Linguistics10.5555/1858681.1858716(335-344)Online publication date: 11-Jul-2010
https://dl.acm.org/doi/10.5555/1858681.1858716
Bonfante GGuillaume BMorey MBunt H(2009)Dependency constraints for lexical disambiguationProceedings of the 11th International Conference on Parsing Technologies10.5555/1697236.1697286(242-253)Online publication date: 7-Oct-2009
https://dl.acm.org/doi/10.5555/1697236.1697286
Koller AKuhlmann MLascarides AGardent CNivre J(2009)Dependency trees and the strong generative capacity of CCGProceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics10.5555/1609067.1609118(460-468)Online publication date: 30-Mar-2009
https://dl.acm.org/doi/10.5555/1609067.1609118
Rimell LClark S(2009)Porting a lexicalized-grammar parser to the biomedical domainJournal of Biomedical Informatics10.1016/j.jbi.2008.12.00442:5(852-865)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1016/j.jbi.2008.12.004
Sagae KTsujii JScott DUszkoreit H(2008)Shift-reduce dependency DAG parsingProceedings of the 22nd International Conference on Computational Linguistics - Volume 110.5555/1599081.1599176(753-760)Online publication date: 18-Aug-2008
https://dl.acm.org/doi/10.5555/1599081.1599176
Hardcastle D(2007)Cryptic crossword cluesProceedings of the Eleventh European Workshop on Natural Language Generation10.5555/1610163.1610189(147-150)Online publication date: 17-Jun-2007
https://dl.acm.org/doi/10.5555/1610163.1610189
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents