Work with us

What are you looking for?

  1. Choose a proposal

    Open a proposal to read its description and supervisors, then select Choose this proposal.

  2. Write to us

    Tell us how many exams you still have to pass and when you expect to finish them, when you can start, and the degree session in which you intend to graduate. We reserve at least six months for a thesis, so the session must be at least six months after your start, and not before the end of your exams. You may start before your last exam.

    To Paolo Torroni, Andrea Galassi, Federico Ruggeri

    Email us directly
  3. For inspiration

    Work done with students.

  1. Read the course pages

    The course page and the Virtuale page describe the project work and how it is assessed.

  2. Choose a topic

    Select Choose this proposal on one of our research proposals, or write a topic of your own in the next step.

  3. Write to us

    Describe the topic and your intended approach.

    To Paolo Torroni, Andrea Galassi, Federico Ruggeri

    Email us directly
  4. For inspiration

    Work done with students.

  1. Find a research topic

    Our research proposals show the topics we currently work on.

  2. Write to us

    Agree with us on the visit and its research topic. Tell us how the visit is funded: by your home institution, or by the lab, and in that case how much funding you need. Researchers attach a curriculum vitae, a research statement, and a proposal for the research activity during the visit.

    To Paolo Torroni, Andrea Galassi, Federico Ruggeri

    Email us directly
  3. Complete the formalities

    Students complete the required formalities with the administrations of their home institution and of the University of Bologna.

  1. See our recent projects

    The Projects page lists all of them.

  2. Write to us

    Describe your organisation and your idea.

    To Paolo Torroni, Andrea Galassi, Federico Ruggeri

    Email us directly
Research proposals 10 proposals

Context

Hate speech often relies on implicit content: meaning that a text suggests without stating it. It also relies on subtle reasoning nuances. Argument mining is the problem of automatically detecting and extracting arguments from text. An argument usually combines a premise and a claim. The premise is a fact, and it supports the claim, a subjective conclusion.

Objective

This proposal applies argumentative reasoning to hate speech, to make its implicit content explicit. The resulting hate speech detection systems should be more interpretable and more user-friendly.

A text that relies on implicit content and subtle reasoning goes to argumentative reasoning, which makes the implicit content explicit as an argument: a premise, a fact, that supports a claim, a subjective conclusion. Premise and claim then feed hate speech detection, which aims to be more interpretable and more user-friendly.INPUT TEXTTextrelies on implicit content and subtle reasoningArgumentative reasoningmakes the implicit content explicitARGUMENTPremisea factsupportsClaima subjective conclusionHate speech detectionmore interpretable and more user-friendly
Argumentative reasoning makes the implicit content of a text explicit as a premise that supports a claim, toward hate speech detection. The schema uses no example text.

Context

Argument mining automatically detects and extracts arguments from text. An argument usually combines a premise and a claim. The premise is a fact, and it supports the claim, a subjective conclusion. Spoken arguments also carry speech information, such as prosody, which is the rhythm and intonation of speech. A spoken argument comes as recorded speech together with its transcript, the written words of that speech.

Objective

This proposal aims to detect arguments with speech information in addition to text. Speech information enhances the set of features used to find premises and claims.

A spoken argument has a transcript and recorded speech. Text features come from the transcript and speech features, such as prosody, come from the recorded speech. Argument detection uses both sets of features and finds premises and claims.INPUTTranscriptthe written words of the speechRecorded speechthe spoken argumentFEATURESText featuresfrom the transcriptSpeech featuressuch as prosodyDETECTIONArgument detectionuses both sets of featuresOUTPUTpremiseclaim
Text features from the transcript and speech features from the recorded speech of one spoken argument both feed argument detection, which finds premises and claims.

Context

Selective rationalization explains the prediction of a classification model with highlights of the input text. These highlights, called rationales, are a subset of the input that a user can read. A rationale should also describe faithfully how the model reaches its prediction. A rationale is a local explanation: it explains the prediction for one example.

Objective

Examples that belong to the same class might share similar rationales. This proposal aims to go from local explanations to a global explanation, such as a knowledge base, by aggregating and summarizing extracted rationales.

Three examples of the same class, negative, each with its rationale highlighted: cold, cold, and rude. Aggregation reads the three rationales, aggregates and summarizes them, and outputs a global explanation, such as a knowledge base.EXAMPLES OF ONE CLASSthefoodwascoldnegativethesouparrivedcoldnegativethestaffwasrudenegativehighlighted words: the rationale of each exampleAggregationaggregates and summarizesGlobal explanationsuch as a knowledge base
From local explanations to a global explanation, on illustrative sentences that come from no dataset. Aggregation turns the rationales of three examples of one class into one global explanation, such as a knowledge base.

Context

Selective rationalization trains a model to explain each prediction with highlights of its input text. These highlights, called rationales, are a part of the input that a user can read and that faithfully shows how the model classifies. In the Select-then-Predict Pipeline (SPP), a generator selects the rationale and a predictor classifies it. Training an SPP can get stuck in poor solutions, called local minima, because of interlocking: a suboptimal interplay between generator and predictor.

Objective

A mixture of experts (MoE) trains several models, called experts, on the same data, and each expert specializes in a subset of it. This proposal studies whether an MoE model for selective rationalization can address interlocking.

Two ideas side by side. Left, the Select-then-Predict Pipeline: a generator selects the rationale and a predictor classifies it, and their interplay can cause interlocking. Right, a mixture of experts: three experts train on the same data, and each specializes in a subset. Both lead to the research question: can a mixture of experts model for selective rationalization address interlocking?SELECT-THEN-PREDICT PIPELINEGeneratorselects the rationaleINTERLOCKINGPredictorclassifies the rationaleMIXTURE OF EXPERTSSame dataExpert 1subset 1Expert 2subset 2Expert 3subset 3each expert specializes in a subset of the dataResearch questionCan an MoE model for selective rationalization address interlocking?
The two ideas this proposal brings together. Left, the SPP, where the interplay between generator and predictor can cause interlocking. Right, an MoE, where three experts stand for several.

Context

Selective rationalization explains a prediction with a rationale: a short part of the input text that a user can read and that faithfully shows what the prediction is based on. The Select-then-Predict Pipeline (SPP) builds this into the model: a generator selects the rationale, and a predictor classifies the rationale only.

Objective

Large language models (LLMs) can select a rationale and predict a label in a single answer when a prompt asks them to. This proposal evaluates how well they perform selective rationalization through prompting, compared with traditional SPP models.

The same input text in two settings. Left, the Select-then-Predict Pipeline: a generator selects the rationale cold and rude, and a predictor that sees only the rationale outputs the label negative. Right, a prompted LLM reads the whole text and returns both the rationale and the label.INPUT TEXTthefoodwascoldandtheservicewasrudeSELECT-THEN-PREDICT PIPELINEPROMPTED LLMGeneratorselects the rationaleRATIONALEcoldrudePredictorsees only the rationaleLABELnegativePromptasks for a rationale and a labelLLMreads the whole text, then answerscoldrudenegativeRATIONALELABEL
The two settings this proposal compares, on an illustrative sentence that comes from no dataset. In the SPP, the label comes from the rationale alone. The prompted LLM reads the whole text and returns both.

Context

Selective rationalization explains the prediction of a classification model with highlights of the input text, called rationales. A rationale should be readable by a user and should faithfully describe how the model reaches its prediction. Several techniques transform text into structured content, such as parse trees and abstract meaning representation graphs.

Objective

This proposal applies rationalization to structured content and constrains the structures that a rationale can take. These structural constraints depend on the application scenario and define which types of structures the rationalization system can extract. With tree kernels, functions that measure the similarity between two trees, the allowed structures are different types of trees.

The input text the food was cold goes through a transformation technique that turns it into a tree, the structured content. A rationalization system, guided by a structural constraint on the allowed types of trees, extracts a rationale from that tree: the connected nodes was and cold, while food and the are left out.INPUT TEXTthefoodwascoldTransformation techniqueturns the text into a treeSTRUCTURED CONTENTwasfoodcoldtheRationalization systemextracts a rationaleStructural constraintallowed: types of treesRATIONALEwasfoodcoldthe
The setup this proposal studies, on an illustrative sentence and tree that come from no dataset. The structural constraint defines which types of trees the rationalization system can extract as a rationale.

Context

What counts as abusive or hate speech depends on the socio-cultural context: the culture, norms, and laws of the people who read a text. The same text might be deemed offensive in one culture, allowed in another, and legally prosecutable in a third. A detection model is a machine learning model that flags a text as abusive or hate speech. It learns from labeled examples.

Objective

This proposal evaluates how different definitions of abusive and hate speech affect detection models. The aim is to promote awareness when developing accurate detection models.

The same text goes to three socio-cultural contexts, cultures A, B, and C, each with its own definition of abusive and hate speech. Culture A deems the text offensive, culture B allows it, and culture C deems it legally prosecutable. All three judgments feed a detection model, and the question is how each definition affects it.INPUT TEXTthe same textCulture Adefinition ACulture Bdefinition BCulture Cdefinition Coffensiveallowedlegally prosecutableDetection modelhow does each definition affect it?
One text judged in three socio-cultural contexts, each with its own definition of abusive and hate speech. Cultures A, B, and C are placeholders, not real cultures.

Context

The standard way to train a machine learning model is to give it an annotated dataset: data paired with class labels. Annotators build this dataset after training on annotation guidelines, the rules that define how to assign the classes. They label the data with classes from a given class set. The model learns from the labels alone, without the guidelines, so it can learn any mapping from data to classes that fits the given data.

Objective

This proposal gives the annotation guidelines directly to the model. During training, the model receives the guidelines and unlabeled data, but no class labels.

Two training settings side by side. Left, standard training: the guidelines train the annotators, the annotators label the data into an annotated dataset, and the model learns from the labels alone. Right, guidelines-only training: the model receives the guidelines and unlabeled data with no class labels, learns the mapping from the guidelines, and assigns classes to the data.STANDARD TRAININGGuidelinesdefine how to assign the classesAnnotatorslabel the data with the classesAnnotated datasetthe data and their class labelsModellearns from the labels aloneGUIDELINES-ONLY TRAININGGuidelinessame as annotatorsUnlabeled datano class labelsModellearns the mapping from the guidelinesClassesassigned to the data
The two settings this proposal compares. In standard training, only the annotators learn from the guidelines; in guidelines-only training, the model receives the guidelines and no class labels.
Work done with students 70 theses and publications

2025

2024

2023

2022

2020

  • Bachelor thesis Development of an Argumentative Chatbot in Python Federico Spurio Argument miningDialoguePrototype