The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
The syntactic process
Handbook of Formal Languages
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Polynomial time parsing of Combinatory Categorial Grammars
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Multi-modal combinatory categorial grammar
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Building deep dependency structures with a wide-coverage CCG parser
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Creating a CCGbank and a wide-coverage CCG lexicon for German
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Wide-coverage semantic representations from a CCG parser
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Non-projective dependency parsing using spanning tree algorithms
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
Computational Linguistics
Wide-coverage efficient statistical parsing with ccg and log-linear models
Computational Linguistics
Dependency constraints for lexical disambiguation
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
The importance of rule restrictions in CCG
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
A generalized view on parsing and translation
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Mildly non-projective dependency grammar
Computational Linguistics
| Hi-index | 0.00 |
We propose a novel algorithm for extracting dependencies from the derivations of a large fragment of CCG. Unlike earlier proposals, our dependency structures are always tree-shaped. We then use these dependency trees to compare the strong generative capacities of CCG and TAG and obtain surprising results: Both formalisms generate the same languages of derivation trees --- but the mechanisms they use to bring the words in these trees into a linear order are incomparable.