| The tree-generative capacity of combinatory categorial grammars | 0 | 0.34 | 2022 |
| Tractable Parsing for CCGs of Bounded Degree. | 0 | 0.34 | 2022 |
| End-To-End Negation Resolution As Graph Parsing | 0 | 0.34 | 2020 |
| On the Complexity of CCG Parsing. | 0 | 0.34 | 2018 |
| Finite-state methods and mathematics of language, introduction to the special issue. | 0 | 0.34 | 2017 |
| Exploiting Structure in Parsing to 1-Endpoint-Crossing Graphs. | 0 | 0.34 | 2017 |
| Towards a catalogue of linguistic graph banks | 0 | 0.34 | 2016 |
| Towards Comparability of Linguistic Graph Banks for Semantic Parsing. | 4 | 0.39 | 2016 |
| Lexicalization and Generative Power in CCG | 5 | 0.43 | 2015 |
| Parsing to Noncrossing Dependency Graphs. | 2 | 0.39 | 2015 |
| SemEval 2015 Task 18: Broad-Coverage Semantic Dependency Parsing | 5 | 0.43 | 2015 |
| Maximum Pagenumber-k Subgraph is NP-Complete. | 0 | 0.34 | 2015 |
| A New Parsing Algorithm for Combinatory Categorial Grammar. | 3 | 0.38 | 2014 |
| SemEval 2014 Task 8: Broad-Coverage Semantic Dependency Parsing. | 34 | 1.50 | 2014 |
| Linköping: Cubic-Time Graph Parsing with a Simple Scoring Scheme | 3 | 0.39 | 2014 |
| Overview of the SPMRL 2013 Shared Task: A Cross-Framework Evaluation of Parsing Morphologically Rich Languages | 21 | 0.87 | 2013 |
| Efficient Parsing for Head-Split Dependency Trees. | 3 | 0.38 | 2013 |
| Mildly non-projective dependency grammar | 3 | 0.40 | 2013 |
| Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization. | 3 | 0.40 | 2012 |
| A Formal Model for Plausible Dependencies in Lexicalized Tree Adjoining Grammar | 7 | 0.49 | 2012 |
| Decomposing TAG Algorithms Using Simple Algebraizations | 4 | 0.43 | 2012 |
| A generalized view on parsing and translation | 15 | 0.69 | 2011 |
| Dynamic programming algorithms for transition-based dependency parsers | 28 | 1.13 | 2011 |
| Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing | 0 | 0.34 | 2010 |
| The importance of rule restrictions in CCG | 3 | 0.45 | 2010 |
| Efficient parsing of well-nested linear context-free rewriting systems | 20 | 0.69 | 2010 |
| Dependency trees and the strong generative capacity of CCG | 5 | 0.45 | 2009 |
| Optimal reduction of rule length in linear context-free rewriting systems | 24 | 0.85 | 2009 |
| An improved oracle for dependency parsing with online reordering | 23 | 1.20 | 2009 |
| Treebank grammar techniques for non-projective dependency parsing | 27 | 1.12 | 2009 |
| Dependency structures derived from minimalist grammars | 1 | 0.38 | 2009 |
| Logics and Automata for Totally Ordered Trees | 1 | 0.34 | 2008 |
| Ogden's Lemma for Regular Tree Languages | 0 | 0.34 | 2008 |
| Mildly Context-Sensitive Dependency Languages | 14 | 0.87 | 2007 |
| Mildly non-projective dependency structures | 30 | 1.94 | 2006 |
| Mildly Non-Projective Dependency Structures | 0 | 0.34 | 2006 |
| Extended cross-serial dependencies in Tree Adjoining Grammars | 5 | 0.52 | 2006 |
| A relational syntax-semantics interface based on dependency grammar | 15 | 1.13 | 2004 |
| Multi-dimensional graph configuration for natural language processing | 0 | 0.34 | 2004 |
| TAG Parsing as Model Enumeration | 1 | 0.39 | 2004 |
