Demo Data from VLDB 2026 / reviewers in the wild / expert
Emilio Monti
dblp:202/2554
· DBLP profile ↗
4ranked-venue papers
0as first author
3since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Information extraction and text analysis · 77% Deep learning architectures and training · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis › semantic parsing
task-oriented semantic parsing |
0.4 | 1 | 2020 | Don't Parse, Generate! A Sequence to Sequence Architecture for Task-Oriented Semantic Parsing · WWW 2020 |
Machine learning › Deep learning architectures and training › sequence modeling › sequence generation
sequence-to-sequence generation |
0.1 | 1 | 2020 | Don't Parse, Generate! A Sequence to Sequence Architecture for Task-Oriented Semantic Parsing · WWW 2020 |
Methods — techniques the papers use, named apart from their topics
weak supervision · 0.4sequence-to-sequence architecture · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Enhancing Contextual Understanding in Large Language Models through Contrastive DecodingabstractZheng Zhao, Emilio Monti, Jens Lehmann, Haytham Assem. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024. Zheng Zhao 0005, Emilio Monti, Jens Lehmann 0001, Haytham Assem |
NAACL-HLT | 2 |
| 2023 | Semantic Parsing for Conversational Question Answering over Knowledge GraphsabstractIn this paper, we are interested in developing semantic parsers which understand natural language questions embedded in a conversation with a user and ground them to formal queries over definitions in a general purpose knowledge graph (KG) with very large vocabularies (covering thousands of concept names and relations, and millions of entities).To this end, we develop a dataset where user questions are annotated with SPARQL parses and system answers correspond to execution results thereof.We present two different semantic parsing approaches and highlight the challenges of the task: dealing with large vocabularies, modelling conversation context, predicting queries with multiple entities, and generalising to new questions at test time.We hope our dataset will serve as useful testbed for the development of conversational semantic parsers. 1 Laura Perez-Beltrachini, Parag Jain, Emilio Monti, Mirella Lapata |
EACL | 3 |
| 2023 | We Need to Talk About Classification Evaluation Metrics in NLPabstractPeter Vickers, Loic Barrault, Emilio Monti, Nikolaos Aletras. Proceedings of the 13th International Joint Conference on Natural Language Processing and the 3rd Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (Volume 1: Long Papers). 2023. Peter Vickers, Loïc Barrault, Emilio Monti, Nikolaos Aletras |
IJCNLP (1) | 3 |
| 2020 | Don't Parse, Generate! A Sequence to Sequence Architecture for Task-Oriented Semantic ParsingabstractVirtual assistants such as Amazon Alexa, Apple Siri, and Google Assistant often rely on a semantic parsing component to understand which action(s) to execute for an utterance spoken by its users. Traditionally, rule-based or statistical slot-filling systems have been used to parse “simple” queries; that is, queries that contain a single action and can be decomposed into a set of non-overlapping entities. More recently, shift-reduce parsers have been proposed to process more complex utterances. These methods, while powerful, impose specific limitations on the type of queries that can be parsed; namely, they require a query to be representable as a parse tree. Subendhu Rongali, Luca Soldaini, Emilio Monti, Wael Hamza |
WWW | 3 |