← Latest papers
💬 NLP

MiNER: A Two-Stage Pipeline for Metadata Extraction from Municipal Meeting Minutes

This paper introduces MiNER, a two-stage pipeline combining question answering and Transformer-based models for extracting metadata from heterogeneous municipal meeting minutes, which demonstrates strong in-domain performance and establishes the first benchmark for this task despite challenges in cross-municipality generalization.

Original authors: Rodrigo Batista, Luís Filipe Cunha, Purificação Silvano, Nuno Guimarães, Alípio Jorge, Evelin Amorim, Ricardo Campos

Published 2026-03-30
📖 5 min read🧠 Deep dive

Original authors: Rodrigo Batista, Luís Filipe Cunha, Purificação Silvano, Nuno Guimarães, Alípio Jorge, Evelin Amorim, Ricardo Campos

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a detective trying to solve a mystery, but instead of a crime scene, your crime scene is a massive, messy pile of city council meeting notes.

These notes are the official records of how a city makes decisions. They contain gold: Who was there? When did they meet? What was the meeting about? When did it start and end? But here's the problem: these notes are written by humans, for humans. They are messy, inconsistent, and look different in every city. One city might put the date at the top; another might hide it in the second paragraph.

Trying to find this specific information automatically is like trying to find a needle in a haystack where the haystack is made of different types of hay, and the needles are sometimes made of rubber.

This paper introduces MiNER (Minutes Named Entity Recognizer), a smart robot detective designed specifically to solve this messy problem. Here is how it works, broken down into simple steps:

The Problem: The "One-Size-Fits-All" Failure

The authors tried using standard "AI detectives" (general-purpose models) to find this info. But these general AI models are like a Swiss Army knife: great for opening bottles and cutting string, but terrible at performing surgery. They are trained on general text (like news articles) and don't understand the weird, specific jargon of city council meetings. They get confused and miss the details.

The Solution: The Two-Stage Pipeline

Instead of trying to read the entire 50-page document at once, MiNER uses a two-stage strategy. Think of it as a two-person team: The Scout and The Surgeon.

Stage 1: The Scout (Finding the Clues)

The first job is to find where the important info is hiding.

  • The Analogy: Imagine you are looking for a specific recipe in a giant cookbook. Instead of reading every single word from page 1 to page 500, you first scan the Table of Contents or the headers to find the "Start" and "End" of the recipe section.
  • What MiNER does: It uses a "Question Answering" model (The Scout) to scan the document and say, "Okay, the meeting details are in the first 3 paragraphs and the last 2 paragraphs. Ignore the middle part where they discuss the budget for 20 years."
  • Why this helps: It cuts out 90% of the "noise" (the boring, irrelevant text) so the next step doesn't have to waste time on it.

Stage 2: The Surgeon (Extracting the Details)

Once the Scout has found the relevant sections, the Surgeon steps in.

  • The Analogy: Now that you have the specific recipe page, you need to pull out the exact ingredients: "2 cups of flour," "1 egg," "300 degrees."
  • What MiNER does: It uses a specialized AI (The Surgeon) to look only at those specific paragraphs and pull out the exact metadata: Meeting Number, Date, Location, Who attended, Start Time, End Time.
  • The Secret Sauce (Deslexicalization): To make sure this Surgeon works for any city (not just the one it was trained on), the team taught it to ignore specific names. If the text says "Meeting in Porto," the AI is trained to see it as "Meeting in [CITY]." If it says "Mayor Silva," it sees "Mayor [NAME]." This is like teaching a detective to recognize a "suspect" without caring if the suspect is named Bob or Alice. This helps the AI generalize to new cities it has never seen before.

The Results: The Specialist vs. The Generalist

The team tested MiNER against two famous, powerful AI giants (Gemini and Phi), which are like "Super-Computers" that know everything about the world.

  • The Result: MiNER (the specialist) crushed the Super-Computers.
    • Accuracy: MiNER was much better at finding the right info.
    • Speed: MiNER was 1,800 times faster. The Super-Computers took over 12 minutes to process a document; MiNER took less than a second.
    • Cost & Energy: MiNER used almost 400 times less energy (carbon footprint). Using the Super-Computers was like driving a massive semi-truck to deliver a single letter; MiNER was like riding a bicycle.

The Catch: The "New City" Problem

There is one hiccup. When the team tested MiNER on a city it had never seen before (a "cross-city" test), its performance dropped a bit.

  • The Analogy: It's like a detective who is an expert in New York City. If you send them to Tokyo, they know the concept of a city, but they get confused by the specific street names and local slang.
  • The Fix: The paper shows that if you just show the AI one or two examples from the new city, it learns instantly and gets back to near-perfect performance.

The Bottom Line

This paper gives us a new, highly efficient tool called MiNER. It proves that for specific, messy jobs like reading city council minutes, you don't need a giant, expensive, slow "Super-Computer." You need a specialized, two-step team that knows exactly where to look and how to ignore the noise.

It's the difference between hiring a generalist who tries to do everything and hiring a master locksmith who can open a specific door in seconds.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →