Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Learning Context Free Grammars"'
Autor:
Gail Weiss, Daniel M. Yellin
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030720155
TACAS (1)
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030720155
TACAS (1)
We present an algorithm for extracting a subclass of the context free grammars (CFGs) from a trained recurrent neural network (RNN). We develop a new framework,pattern rule sets(PRSs), which describe sequences of deterministic finite automata (DFAs)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c328725f8bb33bd99c86712302e4e68a
http://europepmc.org/articles/PMC7979173
http://europepmc.org/articles/PMC7979173
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
In the COLT'94 Conference A. Burago showed that the class of structurally reversible grammars is learnable in polynomial time using membership and equivalence queries. The paper shows that this class of grammars is not learnable using either membersh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::79aef8bbb54082acea6dda992b063ea3
https://hdl.handle.net/2117/97281
https://hdl.handle.net/2117/97281
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.