Accurate Context-Free Parsing with Combinatory Categorial Grammar
by
Timothy A. D. Fowler
,
Gerald Penn
| Citations: | 5 - 0 self |
BibTeX
@MISC{Fowler_accuratecontext-free,
author = {Timothy A. D. Fowler and Gerald Penn},
title = {Accurate Context-Free Parsing with Combinatory Categorial Grammar},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important in terms of the language classes of each CCG. We prove that a wide range of CCGs are strongly context-free, including the CCG of CCGbank and of the parser of Clark and Curran (2007). In light of these new results, we train the PCFG parser of Petrov and Klein (2007) on CCGbank and achieve state of the art results in supertagging accuracy, PARSEVAL measures and dependency accuracy. 1
Citations
| 406 | The mathematics of sentence structure - Lambek - 1958 |
| 396 | The syntactic process - Steedman - 2000 |
| 115 | Improved inference for unlexicalized parsing - Petrov, Klein - 2007 |
| 87 | Wide-coverage efficient statistical parsing with ccg and log-linear models. Computational Linguistics 33 - Clark, Curran - 2007 |
| 64 | The equivalence of four extensions of context-free grammars - Vijay-Shanker, Weir - 1994 |
| 58 | Widecoverage semantic representations from a CCG parser - Bos, Clark, et al. - 2006 |
| 18 | Building Deep Dependency Structures with a Wide-Coverage CCG Parser - Clark, Hockenmaier, et al. - 2002 |
| 3 | A logical basis for the D combinator and normal form in CCG - Hoyt, Baldridge - 2008 |
