有界无上下文语言的树状采样器

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-08-03 DOI:arxiv-2408.01849

Breandan Considine

{"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}

引用次数: 0

摘要

在下面的论文中，我们将介绍一种从 BCFL 中抽取有或无替换树的简单方法。BCFL 是一种上下文无漏洞语言（CFL），对应于一个有漏洞的不完整字符串，它可以通过有效终端来完成。为了解决这个问题，我们引入了一种代数数据类型，它能紧凑地表示多孔字符串的候选解析森林。一旦构建完成，对树的采样就变得简单易行了，只需对整数进行均匀采样，无需替换，然后将它们轻松解码成树即可。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Tree Sampler for Bounded Context-Free Languages

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Formal Languages and Automata Theory

自引率

0.00%

发文量