Finite automata for compact representation of language models in NLP
From MaRDI portal
Recommendations
Cited in
(8)- Finite automata for compact representation of tuple dictionaries.
- A method to build a super small but practically accurate language model for handheld devices
- Incremental construction of minimal tree automata
- Statistical language models within the algebra of weighted rational languages
- A general technique to train language models on language models
- scientific article; zbMATH DE number 569761 (Why is no real title available?)
- scientific article; zbMATH DE number 1532350 (Why is no real title available?)
- Using ranked semirings for representing morphology automata
This page was built for publication: Finite automata for compact representation of language models in NLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412569)