paper-with-me

홈 › Papers

Named Entity Extraction with Finite State Transducers

2020-06-20 · Diego Alexander Huérfano Villalba, Elizabeth León Guzmán

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_{\beta = 1}$ measure of $60\%.$ Also, we present an algorithm for the construction of the final transducer used to encode all the learned contextual rules.

📄 PDF Abstract BibTeX arXiv:2006.11548

Code (2)

dahuerfanov/NER
dahuerfanov/NER-System

Tasks

Entity Extraction using GANTAG

Similar Papers 제목 키워드 기반

Decoding with Finite-State Transducers on GPUs

2017-01-11 · EACL 2017 4 · Arturo Argueta, David Chiang

Weighted finite automata and transducers (including hidden Markov models and conditional random fields) are widely used in natural language processing (NLP) to perform tasks such as morphological analysis, part-of-speech…

ChunkingGPUMorphological Analysisnamed-entity-recognition+5

Finite-state Model of Shupamem Reduplication

2021-08-01 · ACL (SIGMORPHON) 2021 8 · Magdalena Markowska, Jeffrey Heinz, Owen Rambow

Shupamem, a language of Western Cameroon, is a tonal language which also exhibits the morpho-phonological process of full reduplication. This creates two challenges for finite-state model of its morpho-syntax and morphop…

model

Finite-state morphological transducers for three Kypchak languages

2014-05-01 · LREC 2014 5 · Jonathan Washington, Ilnar Salimzyanov, Francis Tyers

This paper describes the development of free/open-source finite-state morphological transducers for three Turkic languages―Kazakh, Tatar, and Kumyk―representing one language from each of the three sub-branches of the Kyp…

Machine Translation

A Transaction Represented with Weighted Finite-State Transducers

2023-02-01 · J. Nathaniel Holmes, Homayoon Beigi

Not all contracts are good, but all good contracts can be expressed as a finite-state transition system ("State-Transition Contracts"). Contracts that can be represented as State-Transition Contracts discretize fat-taile…

TurkicNLP: An NLP Toolkit for Turkic Languages

2026-02-22 · Sherzod Hakimov arxiv

Natural language processing for the Turkic language family, spoken by over 200 million people across Eurasia, remains fragmented, with most languages lacking unified tooling and resources. We present TurkicNLP, an open-s…

Part-Of-Speech TaggingMachine TranslationDependency Parsing