{"title":"有界无上下文语言的树状采样器","authors":"Breandan Considine","doi":"arxiv-2408.01849","DOIUrl":null,"url":null,"abstract":"In the following paper, we present a simple method for sampling trees with or\nwithout replacement from BCFLs. A BCFL is a context-free language (CFL)\ncorresponding to an incomplete string with holes, which can be completed by\nvalid terminals. To solve this problem, we introduce an algebraic datatype that\ncompactly represents candidate parse forests for porous strings. Once\nconstructed, sampling trees is a straightforward matter of sampling integers\nuniformly without replacement, then lazily decoding them into trees.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"13 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Tree Sampler for Bounded Context-Free Languages\",\"authors\":\"Breandan Considine\",\"doi\":\"arxiv-2408.01849\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the following paper, we present a simple method for sampling trees with or\\nwithout replacement from BCFLs. A BCFL is a context-free language (CFL)\\ncorresponding to an incomplete string with holes, which can be completed by\\nvalid terminals. To solve this problem, we introduce an algebraic datatype that\\ncompactly represents candidate parse forests for porous strings. Once\\nconstructed, sampling trees is a straightforward matter of sampling integers\\nuniformly without replacement, then lazily decoding them into trees.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"13 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Formal Languages and Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.01849\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.01849","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In the following paper, we present a simple method for sampling trees with or
without replacement from BCFLs. A BCFL is a context-free language (CFL)
corresponding to an incomplete string with holes, which can be completed by
valid terminals. To solve this problem, we introduce an algebraic datatype that
compactly represents candidate parse forests for porous strings. Once
constructed, sampling trees is a straightforward matter of sampling integers
uniformly without replacement, then lazily decoding them into trees.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
