Marco Kuhlmann

Exploiting Structure in Parsing to 1-Endpoint-Crossing Graphs

2017 · International Workshop/Conference on Parsing Technologies

Deep dependency parsing can be cast as the search for maximum acyclic subgraphs in weighted digraphs. Because this search problem is intractable in the general case, we consider its restriction to ...

On the Complexity of CCG Parsing

2017 · arXiv (Cornell University)

We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994). As our main result, we prove that any parsing algorithm for this formalism will take in the …

Surface-Based Retrieval Reduces Perplexity of Retrieval-Augmented Language Models

2023

Augmenting language models with a retrieval mechanism has been shown to significantly improve their performance while keeping the number of parameters low. Retrieval-augmented models commonly rely on a semantic retrieval mechanism based on the similarity …

Studying the Role of Input-Neighbor Overlap in Retrieval-Augmented Language Models Training Efficiency

2025 · arXiv (Cornell University)

Retrieval-augmented language models have demonstrated performance comparable to much larger models while requiring fewer computational resources. The effectiveness of these models crucially depends on the overlap between query and retrieved context, but the optimal degree …

Towards a Catalogue of Linguistic Graph Banks

2016 · Computational Linguistics

Graphs exceeding the formal complexity of rooted trees are of growing relevance to much NLP research. Although formally well understood in graph theory, there is substantial variation in the types of linguistic graphs, as well …

SemEval 2015 Task 18: Broad-Coverage Semantic Dependency Parsing

2015

Stephan Oepen, Marco Kuhlmann, Yusuke Miyao, Daniel Zeman, Silvie Cinková, Dan Flickinger, Jan Hajič, Zdeňka Urešová. Proceedings of the 9th International Workshop on Semantic Evaluation (SemEval 2015). 2015.