Stochastic grammatical inference with multinomial tests

DOI10.1007/3-540-45790-9_12MaRDI QIDQ4440393zbMATH OpenFDO

Authors Christopher Kermorvant, Pierre Dupont

Publication date 17 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2484/24840149.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)

Recommendations

• Inference of Finite-State Probabilistic Grammars
• Improvement of the state merging rule on noisy data in probabilistic grammatical inference.
• Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference
• Towards General Algorithms for Grammatical Inference
• Stochastic inference of regular tree languages

Cited in

(5)

• Syntactic stochastic processes: definitions, models, and related inference problems
• Inference of regular languages using state merging algorithms with search
• Efficiently identifying deterministic real-time automata from labeled data
• A Spectral Approach for Probabilistic Grammatical Inference on Trees
• Improvement of the state merging rule on noisy data in probabilistic grammatical inference.

This page was built for publication: Stochastic grammatical inference with multinomial tests

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