Applications of finite-state transducers in natural language processing
From MaRDI portal
Recommendations
Cited in
(16)- State complexity of unique rational operations
- Survey: finite-state technology in natural language processing
- Inference of finite-state transducers by using regular grammars and morphisms
- Finite-state registered automata for non-concatenative morphology
- Efficiently Matching with Local Grammars Using Prefix Overlay Transducers
- An application of virtual deterministic finite automaton (VDFA) in natural language processing (NLP)
- Finite State Transducers with Intuition
- State Complexity of Combined Operations for Prefix-Free Regular Languages
- scientific article; zbMATH DE number 1952683 (Why is no real title available?)
- scientific article; zbMATH DE number 2040887 (Why is no real title available?)
- scientific article; zbMATH DE number 2081050 (Why is no real title available?)
- Part-of-speech tagging with two sequential transducers
- scientific article; zbMATH DE number 7488335 (Why is no real title available?)
- Grammatical Inference: Algorithms and Applications
- State complexity of basic language operations combined with reversal
- Finite-state methods and natural language processing. 8th international workshop, FSMNLP 2009, Pretoria, South Africa, July 21--24, 2009. Revised selected papers
This page was built for publication: Applications of finite-state transducers in natural language processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540955)
