← Latest papers
💬 NLP

Concordance Comparison as a Means of Assembling Local Grammars

This paper presents a method for assembling local grammars by comparing their concordances to identify inclusion, intersection, and disjunction relationships, which was successfully applied to improve Portuguese person name recognition in the HAREM corpus, achieving a 76.86 F-Measure and a 6-point gain over the state-of-the-art.

Original authors: Juliana Pirovani, Elias de Oliveira, Eric Laporte

Published 2026-05-13
📖 3 min read☕ Coffee break read

Original authors: Juliana Pirovani, Elias de Oliveira, Eric Laporte

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 trying to build the ultimate "Name Finder" for a computer. Your goal is to teach the machine to spot people's names in a huge pile of Portuguese text.

The authors of this paper faced a problem: they had a toolbox full of small, specialized rules (called Local Grammars) that could find names, but they didn't know which ones worked best or how to combine them without causing confusion. It was like having 30 different metal detectors, each tuned to find a slightly different type of metal, but no one knew which detectors to pack for the trip.

Here is how they solved it, using a simple analogy:

The "Concordance" as a Highlighter

First, they ran each of their small rule sets through the text. Instead of just getting a list of names, they generated concordances. Think of a concordance as a "highlighter" that shows you every time a rule found something, along with the sentence it appeared in.

The "Side-by-Side" Comparison

This is where the magic happened. They used a special tool (called ConcorDiff) to put the results of two different rule sets side-by-side, like comparing two lists of grocery items.

The tool color-coded the differences:

  • Blue: Both rules found the same name (e.g., both found "Michael Jackson").
  • Green: Only one rule found a name (e.g., Rule A found "Dr. Smith," but Rule B missed it).
  • Red: They found overlapping but different versions (e.g., Rule A found "Luther," while Rule B found the full "Luther King").

The Detective Work

By looking at these colored lists, the authors acted like detectives sorting through clues. They looked for patterns:

  • The "Copycat" Rule: If Rule B found everything Rule A found and more, they realized Rule A was redundant. They could throw Rule A away and keep Rule B.
  • The "Specialist" Rule: If Rule A found names that Rule B completely missed (and vice versa), they realized these two rules were best friends who covered different ground. They kept both and combined them.
  • The "Overachiever" Rule: If one rule found a short, incomplete name (like just "Luther") while the other found the full name ("Luther King"), they kept the one that found the complete, more useful version.

The Result: A Super-Team

After comparing every possible pair of rules, they assembled a "Super Grammar"—a single, streamlined team of 30 rules that worked together perfectly without stepping on each other's toes.

They tested this new team on a famous Portuguese text collection called the Second HAREM Gold Collection.

The Scoreboard:

  • The previous champion system (called Rembrandt) got a score of 70.76.
  • The new, hand-picked team got a score of 76.86.

That's a 6-point improvement. In the world of computer language processing, that's a huge victory. It means their new method was much better at catching people's names, especially when those names included titles like "Queen" or "Dr." which often trip up computers.

The Takeaway

The paper doesn't claim to have invented a new type of robot or a medical tool. Instead, it offers a clever manual strategy: using a visual comparison tool to help humans decide which computer rules to keep and which to discard. It's about being a smart editor for your own code, ensuring you only keep the best tools in your kit.

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 →