Survey: finite-state technology in natural language processing
From MaRDI portal
Publication:2357102
DOI10.1016/j.tcs.2016.05.030zbMath1373.68420OpenAlexW2405265672MaRDI QIDQ2357102
Publication date: 19 June 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.030
natural language processingmachine translationcontext-free grammarparsingtree automatonfinite-state automatonpart-of-speech taggingtokenization
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Natural language processing (68T50)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Handbook of weighted automata
- Recognizable formal power series on trees
- Tutorial on maximum likelihood estimation
- Learning Domain Ontologies from Document Warehouses and Dedicated Web Sites
- Weighted and Probabilistic Context-Free Grammars Are Equally Expressive
- On the definition of a family of automata
- Statistical Machine Translation
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library
- Statistical Inference for Probabilistic Functions of Finite State Markov Chains
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Probabilistic and weighted grammars
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
- Tiburon: A Weighted Tree Automata Toolkit
This page was built for publication: Survey: finite-state technology in natural language processing
