default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Kuhlmann
Person information
- affiliation: Linköping University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]Jenny Kunz, Marco Kuhlmann:
Properties and Challenges of LLM-Generated Explanations. CoRR abs/2402.10532 (2024)- [i11]Ehsan Doostmohammadi, Oskar Holmström, Marco Kuhlmann:
How Reliable Are Automatic Evaluation Methods for Instruction-Tuned LLMs? CoRR abs/2402.10770 (2024) - [i10]Elliot Gestrin, Marco Kuhlmann, Jendrik Seipp:
NL2Plan: Robust LLM-Driven Planning from Minimal Text Descriptions. CoRR abs/2405.04215 (2024) - 2023
- [c35]Ehsan Doostmohammadi, Tobias Norlund, Marco Kuhlmann, Richard Johansson:
Surface-Based Retrieval Reduces Perplexity of Retrieval-Augmented Language Models. ACL (2) 2023: 521-529 - [c34]Emanuel Sanchez Aimar, Arvi Jonnarth
, Michael Felsberg, Marco Kuhlmann:
Balanced Product of Calibrated Experts for Long-Tailed Recognition. CVPR 2023: 19967-19977 - [c33]Tobias Norlund, Ehsan Doostmohammadi, Richard Johansson, Marco Kuhlmann:
On the Generalization Ability of Retrieval-Enhanced Transformers. EACL (Findings) 2023: 1455-1463 - [i9]Tobias Norlund, Ehsan Doostmohammadi, Richard Johansson, Marco Kuhlmann:
On the Generalization Ability of Retrieval-Enhanced Transformers. CoRR abs/2302.12128 (2023) - [i8]Ehsan Doostmohammadi, Tobias Norlund, Marco Kuhlmann, Richard Johansson:
Surface-Based Retrieval Reduces Perplexity of Retrieval-Augmented Language Models. CoRR abs/2305.16243 (2023) - [i7]Emanuel Sanchez Aimar, Hannah Helgesen, Michael Felsberg, Marco Kuhlmann:
Align, Distill, and Augment Everything All at Once for Imbalanced Semi-Supervised Learning. CoRR abs/2306.04621 (2023) - 2022
- [j11]Lena Katharina Schiffer, Marco Kuhlmann, Giorgio Satta:
Tractable Parsing for CCGs of Bounded Degree. Comput. Linguistics 48(3): 593-633 (2022) - [j10]Marco Kuhlmann, Andreas Maletti, Lena Katharina Schiffer:
The tree-generative capacity of combinatory categorial grammars. J. Comput. Syst. Sci. 124: 214-233 (2022) - [c32]Jenny Kunz, Martin Jirenius, Oskar Holmström, Marco Kuhlmann:
Human Ratings Do Not Reflect Downstream Utility: A Study of Free-Text Explanations for Model Predictions. BlackboxNLP@EMNLP 2022: 164-177 - [c31]Jenny Kunz, Marco Kuhlmann:
Where Does Linguistic Information Emerge in Neural Language Models? Measuring Gains and Contributions across Layers. COLING 2022: 4664-4676 - [i6]Emanuel Sanchez Aimar, Arvi Jonnarth, Michael Felsberg, Marco Kuhlmann:
Balanced Product of Experts for Long-Tailed Recognition. CoRR abs/2206.05260 (2022) - 2021
- [c30]Jenny Kunz, Marco Kuhlmann:
Test Harder than You Train: Probing with Extrapolation Splits. BlackboxNLP@EMNLP 2021: 15-25 - 2020
- [c29]Jenny Kunz, Marco Kuhlmann:
Classifier Probes May Just Learn from Linear Context Features. COLING 2020: 5136-5146 - [c28]Riley Capshaw, Marco Kuhlmann, Eva Blomqvist:
Probing a Semantic Dependency Parser for Translational Relation Embeddings. DL4KG@ESWC 2020 - [c27]Robin Kurtz, Stephan Oepen, Marco Kuhlmann:
End-to-End Negation Resolution as Graph Parsing. IWPT 2020 2020: 14-24
2010 – 2019
- 2019
- [c26]Stephan Oepen, Omri Abend, Jan Hajic, Daniel Hershcovich, Marco Kuhlmann, Tim O'Gorman, Nianwen Xue, Jayeol Chun, Milan Straka, Zdenka Uresová:
MRP 2019: Cross-Framework Meaning Representation Parsing. CoNLL Shared Task 2019: 1-27 - [c25]Marco Kuhlmann, Andreas Maletti, Lena Katharina Schiffer:
The Tree-Generative Capacity of Combinatory Categorial Grammars. FSTTCS 2019: 44:1-44:14 - [e6]Stephan Oepen, Omri Abend, Jan Hajic, Daniel Hershcovich, Marco Kuhlmann, Tim O'Gorman, Nianwen Xue:
Proceedings of the Shared Task on Cross-Framework Meaning Representation Parsing at the 2019 Conference on Natural Language Learning, CoNLL 2019, Hong Kong, Novemer 3, 2019. Association for Computational Linguistics 2019, ISBN 978-1-950737-60-4 [contents] - 2018
- [j9]Marco Kuhlmann, Giorgio Satta, Peter Jonsson:
On the Complexity of CCG Parsing. Comput. Linguistics 44(3) (2018) - 2017
- [j8]Marco Kuhlmann, Christian Wurm:
Finite-state methods and mathematics of language, introduction to the special issue. J. Lang. Model. 5(1): 1-2 (2017) - [c24]Robin Kurtz, Marco Kuhlmann:
Exploiting Structure in Parsing to 1-Endpoint-Crossing Graphs. IWPT 2017: 78-87 - [e5]Marco Kuhlmann, Tatjana Scheffler:
Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms, TAG 2017, Umeå, Sweden, September 4-6, 2017. Association for Computational Linguistics 2017, ISBN 978-1-945626-98-2 [contents] - [i5]Marco Kuhlmann, Giorgio Satta, Peter Jonsson:
On the Complexity of CCG Parsing. CoRR abs/1702.06594 (2017) - 2016
- [j7]Marco Kuhlmann, Stephan Oepen:
Towards a Catalogue of Linguistic Graph Banks. Comput. Linguistics 42(4): 819-827 (2016) - [c23]Stephan Oepen, Marco Kuhlmann, Yusuke Miyao, Daniel Zeman, Silvie Cinková, Dan Flickinger, Jan Hajic, Angelina Ivanova, Zdenka Uresová:
Towards Comparability of Linguistic Graph Banks for Semantic Parsing. LREC 2016 - 2015
- [j6]Marco Kuhlmann, Alexander Koller, Giorgio Satta:
Lexicalization and Generative Power in CCG. Comput. Linguistics 41(2): 215-247 (2015) - [j5]Marco Kuhlmann, Peter Jonsson:
Parsing to Noncrossing Dependency Graphs. Trans. Assoc. Comput. Linguistics 3: 559-570 (2015) - [c22]Stephan Oepen, Marco Kuhlmann, Yusuke Miyao, Daniel Zeman, Silvie Cinková, Dan Flickinger, Jan Hajic, Zdenka Uresová:
SemEval 2015 Task 18: Broad-Coverage Semantic Dependency Parsing. SemEval@NAACL-HLT 2015: 915-926 - [e4]Marco Kuhlmann, Makoto Kanazawa, Gregory M. Kobele:
Proceedings of the 14th Meeting on the Mathematics of Language, MoL 2015, Chicago, IL, USA, July 25-26, 2015. ACL 2015, ISBN 978-1-941643-56-3 [contents] - [i4]Marco Kuhlmann:
Tabulation of Noncrossing Acyclic Digraphs. CoRR abs/1504.04993 (2015) - [i3]Peter Jonsson, Marco Kuhlmann:
Maximum Pagenumber-k Subgraph is NP-Complete. CoRR abs/1504.05908 (2015) - [i2]Frank Drewes, Kevin Knight, Marco Kuhlmann:
Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122). Dagstuhl Reports 5(3): 143-161 (2015) - 2014
- [j4]Marco Kuhlmann, Giorgio Satta:
A New Parsing Algorithm for Combinatory Categorial Grammar. Trans. Assoc. Comput. Linguistics 2: 405-418 (2014) - [c21]Stephan Oepen, Marco Kuhlmann, Yusuke Miyao, Daniel Zeman, Dan Flickinger, Jan Hajic, Angelina Ivanova, Yi Zhang:
SemEval 2014 Task 8: Broad-Coverage Semantic Dependency Parsing. SemEval@COLING 2014: 63-72 - [c20]Marco Kuhlmann:
Linköping: Cubic-Time Graph Parsing with a Simple Scoring Scheme. SemEval@COLING 2014: 395-399 - 2013
- [j3]Marco Kuhlmann:
Mildly Non-Projective Dependency Grammar. Comput. Linguistics 39(2): 355-387 (2013) - [j2]Giorgio Satta, Marco Kuhlmann:
Efficient Parsing for Head-Split Dependency Trees. Trans. Assoc. Comput. Linguistics 1: 267-278 (2013) - [c19]Djamé Seddah, Reut Tsarfaty, Sandra Kübler, Marie Candito, Jinho D. Choi, Richárd Farkas, Jennifer Foster, Iakes Goenaga, Koldo Gojenola Galletebeitia, Yoav Goldberg, Spence Green, Nizar Habash, Marco Kuhlmann, Wolfgang Maier, Joakim Nivre, Adam Przepiórkowski, Ryan Roth, Wolfgang Seeker, Yannick Versley, Veronika Vincze, Marcin Wolinski, Alina Wróblewska, Éric Villemonte de la Clergerie:
Overview of the SPMRL 2013 Shared Task: A Cross-Framework Evaluation of Parsing Morphologically Rich Languages. SPMRL@EMNLP 2013: 146-182 - [e3]András Kornai, Marco Kuhlmann:
Proceedings of the 13th Meeting on the Mathematics of Language, MoL 2013, Sofia, Bulgaria, August 9, 2013. ACL 2013, ISBN 978-1-937284-65-7 [contents] - 2012
- [j1]Marco Kuhlmann, Giorgio Satta:
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization. Comput. Linguistics 38(3): 617-629 (2012) - [c18]Laura Kallmeyer, Marco Kuhlmann:
A Formal Model for Plausible Dependencies in Lexicalized Tree Adjoining Grammar. TAG 2012: 108-116 - [c17]Alexander Koller, Marco Kuhlmann:
Decomposing TAG Algorithms Using Simple Algebraizations. TAG 2012: 135-143 - [e2]Frank Drewes, Marco Kuhlmann:
Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing, ATANLP 2012, Avignon, France, April 24, 2012. The Association for Computer Linguistics 2012, ISBN 978-1-937284-19-0 [contents] - 2011
- [c16]Marco Kuhlmann, Carlos Gómez-Rodríguez, Giorgio Satta:
Dynamic Programming Algorithms for Transition-Based Dependency Parsers. ACL 2011: 673-682 - [c15]Alexander Koller, Marco Kuhlmann:
A Generalized View on Parsing and Translation. IWPT 2011: 2-13 - [p1]Ralph Debusmann, Marco Kuhlmann:
Dependency Grammar: Classification and Exploration. Resource-Adaptive Cognitive Processes 2011: 365-388 - 2010
- [b2]Marco Kuhlmann:
Dependency Structures and Lexicalized Grammars An Algebraic Approach. Lecture Notes in Computer Science 6270, Springer 2010, ISBN 978-3-642-14567-4, pp. 1-137 - [c14]Marco Kuhlmann, Alexander Koller, Giorgio Satta:
The Importance of Rule Restrictions in CCG. ACL 2010: 534-543 - [c13]Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta:
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems. HLT-NAACL 2010: 276-284 - [e1]Frank Drewes, Marco Kuhlmann:
Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, ATANLP@ACL 2010, Uppsala, Sweden, July 16, 2010. Association for Computational Linguistics 2010, ISBN 978-1-932432-79-4 [contents]
2000 – 2009
- 2009
- [c12]Alexander Koller, Marco Kuhlmann:
Dependency Trees and the Strong Generative Capacity of CCG. EACL 2009: 460-468 - [c11]Marco Kuhlmann, Giorgio Satta:
Treebank Grammar Techniques for Non-Projective Dependency Parsing. EACL 2009: 478-486 - [c10]Joakim Nivre, Marco Kuhlmann, Johan Hall:
An Improved Oracle for Dependency Parsing with Online Reordering. IWPT 2009: 73-76 - [c9]Marisa Ferrara Boston, John T. Hale, Marco Kuhlmann:
Dependency Structures Derived from Minimalist Grammars. MOL 2009: 1-12 - [c8]Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta, David J. Weir:
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems. HLT-NAACL 2009: 539-547 - 2008
- [c7]Marco Kuhlmann, Joachim Niehren:
Logics and Automata for Totally Ordered Trees. RTA 2008: 217-231 - [i1]Marco Kuhlmann:
Ogden's Lemma for Regular Tree Languages. CoRR abs/0810.4249 (2008) - 2007
- [b1]Marco Kuhlmann:
Dependency structures and lexicalized grammars. Saarland University, Germany, 2007 - [c6]Marco Kuhlmann, Mathias Möhl:
Mildly Context-Sensitive Dependency Languages. ACL 2007 - 2006
- [c5]Marco Kuhlmann, Joakim Nivre:
Mildly Non-Projective Dependency Structures. ACL 2006 - [c4]Marco Kuhlmann, Mathias Möhl:
Extended Cross-Serial Dependencies in Tree Adjoining Grammars. TAG 2006: 121-126 - 2004
- [c3]Ralph Debusmann, Denys Duchier, Alexander Koller, Marco Kuhlmann, Gert Smolka, Stefan Thater:
A Relational Syntax-Semantics Interface Based on Dependency Grammar. COLING 2004 - [c2]Ralph Debusmann, Denys Duchier, Marco Kuhlmann:
Multi-dimensional Graph Configuration for Natural Language Processing. CSLP 2004: 104-120 - [c1]Ralph Debusmann, Denys Duchier, Marco Kuhlmann, Stefan Thater:
TAG Parsing as Model Enumeration. TAG+ 2004: 148-154
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-20 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
