Inference of Finite-State Probabilistic Grammars
From MaRDI portal
Recommendations
Cited in
(17)- Sequential fuzzy system identification
- A beam search algorithm for PFSA inference
- Comprehension grammars generated from machine learning of natural languages
- scientific article; zbMATH DE number 4039342 (Why is no real title available?)
- Decision problems resulting from grammatical inference
- Syntactic/semantic techniques in pattern recognition: A survey
- Learning deterministic regular grammars from stochastic samples in polynomial time
- Accurate computation of the relative entropy between stochastic regular grammars
- Probabilistic grammars and languages
- scientific article; zbMATH DE number 2019601 (Why is no real title available?)
- scientific article; zbMATH DE number 2019611 (Why is no real title available?)
- An approach to the inference of finite state machines based on a gravitationally-inspired search algorithm
- A Spectral Approach for Probabilistic Grammatical Inference on Trees
- Three models for the description of language
- scientific article; zbMATH DE number 957411 (Why is no real title available?)
- Improvement of the state merging rule on noisy data in probabilistic grammatical inference.
- The syntactic prediction with token automata: Application to HandiAS system
This page was built for publication: Inference of Finite-State Probabilistic Grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140914)