Named Entity Extraction with Finite State Transducers

We describe a named entity tagging system that requires minimal linguistic knowledge and can be applied to more target languages without substantial changes. The system is based on the ideas of the Brill's tagger which makes it really simple. Using supervised machine learning, we construct a series of automatons (or transducers) in order to tag a given text. The final model is composed entirely of automatons and it requires a lineal time for tagging. It was tested with the Spanish data set provided in the CoNLL-2002 attaining an overall F_β = 1 measure of 60%. Also, we present an algorithm for the construction of the final transducer used to encode all the learned contextual rules.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/30/2016

PAMPO: using pattern matching and pos-tagging for effective Named Entities recognition in Portuguese

This paper deals with the entity extraction task (named entity recogniti...
research
05/22/2019

A Joint Named-Entity Recognizer for Heterogeneous Tag-setsUsing a Tag Hierarchy

We study a variant of domain adaptation for named-entity recognition whe...
research
07/05/2021

Weakly Supervised Named Entity Tagging with Learnable Logical Rules

We study the problem of building entity tagging systems by using a few r...
research
05/24/2017

Inclusive Flavour Tagging Algorithm

Identifying the flavour of neutral B mesons production is one of the mos...
research
10/26/2021

Part Whole Extraction: Towards A Deep Understanding of Quantitative Facts for Percentages in Text

We study the problem of quantitative facts extraction for text with perc...
research
09/17/2018

Similarity measure for Public Persons

For the webportal "Who is in the News!" with statistics about the appear...

Please sign up or login with your details

Forgot password? Click here to reset