Split-Based Algorithm for Weighted Context-Free Grammar Induction
The split-based method in a weighted context-free grammar (WCFG) induction was formalised and verified on a comprehensive set of context-free languages. WCFG is learned using a novel grammatical inference method. The proposed method learns WCFG from both positive and negative samples, whereas the we...
Main Authors: | Mateusz Gabor, Wojciech Wieczorek, Olgierd Unold |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-01-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/11/3/1030 |
Similar Items
-
Parsing Expression Grammars and Their Induction Algorithm
by: Wojciech Wieczorek, et al.
Published: (2020-12-01) -
Binary Context-Free Grammars
by: Sherzod Turaev, et al.
Published: (2020-07-01) -
Inductive Synthesis of Cover-Grammars with the Help of Ant Colony Optimization
by: Wieczorek Wojciech
Published: (2016-11-01) -
A New Constructive Method for the One-Letter Context-Free Grammars
by: Andrei, Å tefan, et al.
Published: (2003) -
Searching for universal model of amyloid signaling motifs using probabilistic context-free grammars
by: Witold Dyrka, et al.
Published: (2021-04-01)