Marco Kuhlmann

According to our database1, Marco Kuhlmann authored at least 56 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
How Reliable Are Automatic Evaluation Methods for Instruction-Tuned LLMs?
CoRR, 2024

Properties and Challenges of LLM-Generated Explanations.
CoRR, 2024

2023
Align, Distill, and Augment Everything All at Once for Imbalanced Semi-Supervised Learning.
CoRR, 2023

On the Generalization Ability of Retrieval-Enhanced Transformers.
Proceedings of the Findings of the Association for Computational Linguistics: EACL 2023, 2023

Balanced Product of Calibrated Experts for Long-Tailed Recognition.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

Surface-Based Retrieval Reduces Perplexity of Retrieval-Augmented Language Models.
Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), 2023

2022
The tree-generative capacity of combinatory categorial grammars.
J. Comput. Syst. Sci., 2022

Balanced Product of Experts for Long-Tailed Recognition.
CoRR, 2022

Tractable Parsing for CCGs of Bounded Degree.
Comput. Linguistics, 2022

Where Does Linguistic Information Emerge in Neural Language Models? Measuring Gains and Contributions across Layers.
Proceedings of the 29th International Conference on Computational Linguistics, 2022

Human Ratings Do Not Reflect Downstream Utility: A Study of Free-Text Explanations for Model Predictions.
Proceedings of the Fifth BlackboxNLP Workshop on Analyzing and Interpreting Neural Networks for NLP, 2022

2021
Test Harder than You Train: Probing with Extrapolation Splits.
Proceedings of the Fourth BlackboxNLP Workshop on Analyzing and Interpreting Neural Networks for NLP, 2021

2020
End-to-End Negation Resolution as Graph Parsing.
Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies, 2020

Probing a Semantic Dependency Parser for Translational Relation Embeddings.
Proceedings of the Workshop on Deep Learning for Knowledge Graphs (DL4KG2020) co-located with the 17th Extended Semantic Web Conference 2020 (ESWC 2020), Heraklion, Greece, June 02, 2020, 2020

Classifier Probes May Just Learn from Linear Context Features.
Proceedings of the 28th International Conference on Computational Linguistics, 2020

2019
MRP 2019: Cross-Framework Meaning Representation Parsing.
Proceedings of the Shared Task on Cross-Framework Meaning Representation Parsing at the 2019 Conference on Natural Language Learning, 2019

2018
On the Complexity of CCG Parsing.
Comput. Linguistics, 2018

2017
Finite-state methods and mathematics of language, introduction to the special issue.
J. Lang. Model., 2017

Exploiting Structure in Parsing to 1-Endpoint-Crossing Graphs.
Proceedings of the 15th International Conference on Parsing Technologies, 2017

2016
Towards a Catalogue of Linguistic Graph Banks.
Comput. Linguistics, 2016

Towards Comparability of Linguistic Graph Banks for Semantic Parsing.
Proceedings of the Tenth International Conference on Language Resources and Evaluation LREC 2016, 2016

2015
Parsing to Noncrossing Dependency Graphs.
Trans. Assoc. Comput. Linguistics, 2015

Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122).
Dagstuhl Reports, 2015

Tabulation of Noncrossing Acyclic Digraphs.
CoRR, 2015

Maximum Pagenumber-k Subgraph is NP-Complete.
CoRR, 2015

Lexicalization and Generative Power in CCG.
Comput. Linguistics, 2015

SemEval 2015 Task 18: Broad-Coverage Semantic Dependency Parsing.
Proceedings of the 9th International Workshop on Semantic Evaluation, 2015

2014
A New Parsing Algorithm for Combinatory Categorial Grammar.
Trans. Assoc. Comput. Linguistics, 2014

SemEval 2014 Task 8: Broad-Coverage Semantic Dependency Parsing.
Proceedings of the 8th International Workshop on Semantic Evaluation, 2014

Linköping: Cubic-Time Graph Parsing with a Simple Scoring Scheme.
Proceedings of the 8th International Workshop on Semantic Evaluation, 2014

2013
Efficient Parsing for Head-Split Dependency Trees.
Trans. Assoc. Comput. Linguistics, 2013

Mildly Non-Projective Dependency Grammar.
Comput. Linguistics, 2013

Overview of the SPMRL 2013 Shared Task: A Cross-Framework Evaluation of Parsing Morphologically Rich Languages.
Proceedings of the Fourth Workshop on Statistical Parsing of Morphologically-Rich Languages, 2013

2012
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization.
Comput. Linguistics, 2012

Decomposing TAG Algorithms Using Simple Algebraizations.
Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2012

A Formal Model for Plausible Dependencies in Lexicalized Tree Adjoining Grammar.
Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2012

2011
Dependency Grammar: Classification and Exploration.
Proceedings of the Resource-Adaptive Cognitive Processes, 2011

A Generalized View on Parsing and Translation.
Proceedings of the 12th International Conference on Parsing Technologies, 2011

Dynamic Programming Algorithms for Transition-Based Dependency Parsers.
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011

2010
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems.
Proceedings of the Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, 2010

The Importance of Rule Restrictions in CCG.
Proceedings of the ACL 2010, 2010

Dependency Structures and Lexicalized Grammars An Algebraic Approach
Lecture Notes in Computer Science 6270, Springer, ISBN: 978-3-642-14567-4, 2010

2009
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems.
Proceedings of the Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings, May 31, 2009

Dependency Structures Derived from Minimalist Grammars.
Proceedings of the Mathematics of Language, 10th and 11th Biennial Conference, 2009

An Improved Oracle for Dependency Parsing with Online Reordering.
Proceedings of the 11th International Workshop on Parsing Technologies (IWPT-2009), 2009

Treebank Grammar Techniques for Non-Projective Dependency Parsing.
Proceedings of the EACL 2009, 12th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference, Athens, Greece, March 30, 2009

Dependency Trees and the Strong Generative Capacity of CCG.
Proceedings of the EACL 2009, 12th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference, Athens, Greece, March 30, 2009

2008
Ogden's Lemma for Regular Tree Languages
CoRR, 2008

Logics and Automata for Totally Ordered Trees.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

2007
Dependency structures and lexicalized grammars.
PhD thesis, 2007

Mildly Context-Sensitive Dependency Languages.
Proceedings of the ACL 2007, 2007

2006
Extended Cross-Serial Dependencies in Tree Adjoining Grammars.
Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms, 2006

Mildly Non-Projective Dependency Structures.
Proceedings of the ACL 2006, 2006

2004
TAG Parsing as Model Enumeration.
Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms, 2004

Multi-dimensional Graph Configuration for Natural Language Processing.
Proceedings of the Constraint Solving and Language Processing, 2004

A Relational Syntax-Semantics Interface Based on Dependency Grammar.
Proceedings of the COLING 2004, 2004


  Loading...