Modern Language Models and Computation

DOI10.1007/978-3-319-63100-4MaRDI QIDQ4596600zbMATH OpenOpenAlexFDO

Authors Alexander Meduna, Ondřej Soukup

Publication date 1 December 2017

Full work available at URL https://doi.org/10.1007/978-3-319-63100-4

zbMATH Keywords

computational biologycontext-free grammarformal languagecomputational linguisticsexpressive powerfinite automatonregulated rewritingcontext-sensitive grammarpushdown automatonformal grammarparallel rewritingjumping automaton

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 1560216
• Recent advances in computational linguistics
• scientific article; zbMATH DE number 193634
• Language models based on deep learning: a review
• scientific article; zbMATH DE number 2130846
• scientific article; zbMATH DE number 5533334
• Machine learning for natural language processing: contemporary state
• scientific article; zbMATH DE number 44851
• Semantics-oriented natural language processing. Mathematical models and algorithms

Cited in

(5)

• scientific article; zbMATH DE number 193524 (Why is no real title available?)
• Grammars for language and genes. Theoretical and empirical investigations. Foreword by Aravind K. Joshi
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
• Models of computation
• How to demonstrate metalinearness and regularity by tree-restricted general grammars

This page was built for publication: Modern Language Models and Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596600)