Regular approximation of weighted linear nondeleting context-free tree languages
Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Contributed › peer-review
Contributors
Abstract
We show how to train a weighted regular tree grammar such that it best approximates a weighted linear nondeleting contextfree tree grammar concerning the Kullback-Leibler divergence between both grammars.
Details
| Original language | English |
|---|---|
| Title of host publication | Implementation and Application of Automata |
| Editors | Kai Salomaa, Yo-Sub Han |
| Publisher | Springer-Verlag |
| Pages | 273-284 |
| Number of pages | 12 |
| ISBN (electronic) | 978-3-319-40946-7 |
| ISBN (print) | 978-3-319-40945-0 |
| Publication status | Published - 2016 |
| Peer-reviewed | Yes |
Publication series
| Series | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 9705 |
| ISSN | 0302-9743 |
Conference
| Title | 21st International Conference on Implementation and Application of Automata |
|---|---|
| Abbreviated title | CIAA 2016 |
| Conference number | 21 |
| Duration | 19 - 22 July 2016 |
| Website | |
| Location | Sangnam Institute of Management (SIM) |
| City | Seoul |
| Country | Korea, Republic of |