Finite-state transducer cascades to extract named entities in texts.
From MaRDI portal
Publication:1426164
DOI10.1016/J.TCS.2003.10.007zbMATH Open1069.68107OpenAlexW2088818577MaRDI QIDQ1426164FDOQ1426164
Authors: N. Friburger, Denis Maurel
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.007
Recommendations
Cites Work
Cited In (9)
- Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
- Iterated uniform finite-state transducers on unary languages
- Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach
- Title not available (Why is that?)
- Descriptional complexity of iterated uniform finite-state transducers
- Context Hidden Markov Model for Named Entity Recognition
- Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
- Title not available (Why is that?)
- Iterated uniform finite-state transducers on unary languages
Uses Software
This page was built for publication: Finite-state transducer cascades to extract named entities in texts.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426164)