Search Results for author: Frank Drewes

Found 15 papers, 2 papers with code

Improved N-Best Extraction with an Evaluation on Language Data

1 code implementation CL (ACL) 2022 Johanna Björklund, Frank Drewes, Anna Jonsson

We show that a previously proposed algorithm for the N-best trees problem can be made more efficient by changing how it arranges and explores the search space.

Bridging Perception, Memory, and Inference through Semantic Relations

no code implementations EMNLP 2021 Johanna Björklund, Adam Dahlgren Lindström, Frank Drewes

There is a growing consensus that surface form alone does not enable models to learn meaning and gain language understanding.

An Algebraic Approach to Learning and Grounding

no code implementations6 Apr 2022 Johanna Björklund, Adam Dahlgren Lindström, Frank Drewes

The objective is to simultaneously fill in the missing algebraic operations in $\alg$ and ground the variables of every $\varphi_i$ in $O_i$, so that the combined value of the terms is optimised.

Polynomial Graph Parsing with Non-Structural Reentrancies

no code implementations5 May 2021 Johanna Björklund, Frank Drewes, Anna Jonsson

Graph-based semantic representations are valuable in natural language processing, where it is often simple and effective to represent linguistic concepts as nodes, and relations as edges between them.

Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case

1 code implementation COLING 2020 Adam Dahlgren Lindström, Suna Bensch, Johanna Björklund, Frank Drewes

Semantic embeddings have advanced the state of the art for countless natural language processing tasks, and various extensions to multimodal domains, such as visual-semantic embeddings, have been proposed.

Weighted DAG Automata for Semantic Graphs

no code implementations CL 2018 David Chiang, Frank Drewes, Daniel Gildea, Adam Lopez, Giorgio Satta

Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning.

Cannot find the paper you are looking for? You can Submit a new open access paper.