A beam search algorithm for PFSA inference

DOI10.1007/BF01237940MaRDI QIDQ1271320zbMATH OpenFDO

Authors K. Appert

Publication date 19 April 1999

Published in PAA. Pattern Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

probabilistic finite state automata

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Inference of Finite-State Probabilistic Grammars
• Incremental beam search
• Pruning State Spaces with Extended Beam Search
• Beam search algorithms for multilabel learning
• An approach to the inference of finite state machines based on a gravitationally-inspired search algorithm

Cites work

• An Information Measure for Classification
• Behaviour/structure transformations under uncertainty
• Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships
• Linear Automaton Transformations
• Modeling by shortest data description
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Optimization by simulated annealing

Cited in

(3)

• Pruning State Spaces with Extended Beam Search
• Beam search algorithms for multilabel learning
• Incremental beam search

This page was built for publication: A beam search algorithm for PFSA inference

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