发布求助
文献互助 智能选刊 最新文献

Beyond Words最新文献

筛选
英文 中文
The presence of anthropomorphism and ecocentrism in children's literature 儿童文学中拟人化与生态中心主义的存在
Beyond Words Pub Date : 2025-11-30 DOI: 10.33508/bw.v13i2.7742
Ingrid A Gavilan Tatin, George M. Jacobs, Yingrui Wu, Wen Yi, Chenghao Zhu
{"title":"The presence of anthropomorphism and ecocentrism in children's literature","authors":"Ingrid A Gavilan Tatin, George M. Jacobs, Yingrui Wu, Wen Yi, Chenghao Zhu","doi":"10.33508/bw.v13i2.7742","DOIUrl":"https://doi.org/10.33508/bw.v13i2.7742","url":null,"abstract":"This study examined 200 English-language children’s story books as to two variables: (1) the presence or absence of anthropomorphism, i.e., nonhuman agents acting and speaking like humans; and (2) ecocentrism, i.e., giving value to all beings, or anthropocentrism, i.e., valuing humans much more than other species. Some scholars have speculated that the presence of anthropomorphized animals in children’s books might predispose children to develop more ecocentric outlooks. The fiction books were found at a Singapore public library and an internet library. They were categorized into five groups according to the intended age of the readers: (1) Pre-Kindergarten and Kindergarten, (2) Grade 1, (3) Grade 2, (4) Grade 3, and (5) Grade 4). The researchers found an expected, statistically significant trend toward more anthropomorphism in books for younger readers and more ecocentrism in books containing anthropomorphism.","PeriodicalId":31852,"journal":{"name":"Beyond Words","volume":"13 2","pages":"155-177"},"PeriodicalIF":0.0,"publicationDate":"2025-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://journal.ukwms.ac.id/index.php/BW/article/download/7742/5526","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147886699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On arch factorization and subword universality for words and compressed words 词与压缩词的拱分解与子词通用性研究
Beyond Words Pub Date : 2023-04-24 DOI: 10.48550/arXiv.2304.11932
P. Schnoebelen, Julien Veron
{"title":"On arch factorization and subword universality for words and compressed words","authors":"P. Schnoebelen, Julien Veron","doi":"10.48550/arXiv.2304.11932","DOIUrl":"https://doi.org/10.48550/arXiv.2304.11932","url":null,"abstract":"Using arch-jumping functions and properties of the arch factorization of words, we propose a new algorithm for computing the subword circular universality index of words. We also introduce the subword universality signature for words, that leads to simple algorithms for the universality indexes of SLP-compressed words.","PeriodicalId":31852,"journal":{"name":"Beyond Words","volume":"29 1","pages":"274-287"},"PeriodicalIF":0.0,"publicationDate":"2023-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73654292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Longest Common Subsequence with Gap Constraints 带间隙约束的最长公共子序列
Beyond Words Pub Date : 2023-04-11 DOI: 10.48550/arXiv.2304.05270
Duncan Adamson, Maria Kosche, Tore Koss, F. Manea, Stefan Siemer
{"title":"Longest Common Subsequence with Gap Constraints","authors":"Duncan Adamson, Maria Kosche, Tore Koss, F. Manea, Stefan Siemer","doi":"10.48550/arXiv.2304.05270","DOIUrl":"https://doi.org/10.48550/arXiv.2304.05270","url":null,"abstract":"We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the distance (i. e., the gap) between two consecutive symbols of the subsequence has to be between a lower and an upper bound (which may depend on the position of those symbols in the subsequence or on the symbols bordering the gap) as well as the case where the entire subsequence is found in a bounded range (defined by a single upper bound), considered by Kosche et al. 2022. In all these cases, we present effcient algorithms for determining the length of the longest common constrained subsequence between two given strings.","PeriodicalId":31852,"journal":{"name":"Beyond Words","volume":"70 1","pages":"60-76"},"PeriodicalIF":0.0,"publicationDate":"2023-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88466673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Ranking and Unranking k-subsequence universal words k-子序列全称词排序与取消排序
Beyond Words Pub Date : 2023-04-10 DOI: 10.48550/arXiv.2304.04583
Duncan Adamson
{"title":"Ranking and Unranking k-subsequence universal words","authors":"Duncan Adamson","doi":"10.48550/arXiv.2304.04583","DOIUrl":"https://doi.org/10.48550/arXiv.2304.04583","url":null,"abstract":"A subsequence of a word $w$ is a word $u$ such that $u = w[i_1] w[i_2] , dots w[i_{|u|}]$, for some set of indices $1 leq i_1<i_2<dots<i_k leq |w|$. A word $w$ is $k$-subsequence universal over an alphabet $Sigma$ if every word in $Sigma^k$ appears in $w$ as a subsequence. In this paper, we provide new algorithms for $k$-subsequence universal words of fixed length $n$ over the alphabet $Sigma = {1,2,dots, sigma}$. Letting $mathcal{U}(n,k,sigma)$ denote the set of $n$-length $k$-subsequence universal words over $Sigma$, we provide: * an $O(n k sigma)$ time algorithm for counting the size of $mathcal{U}(n,k,sigma)$; * an $O(n k sigma)$ time algorithm for ranking words in the set $mathcal{U}(n,k,sigma)$; * an $O(n k sigma)$ time algorithm for unranking words from the set $mathcal{U}(n,k,sigma)$; * an algorithm for enumerating the set $mathcal{U}(n,k,sigma)$ with $O(n sigma)$ delay after $O(n k sigma)$ preprocessing.","PeriodicalId":31852,"journal":{"name":"Beyond Words","volume":"114 1","pages":"47-59"},"PeriodicalIF":0.0,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80796228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
On Sensitivity of Compact Directed Acyclic Word Graphs 紧致有向无环词图的灵敏度
Beyond Words Pub Date : 2023-03-03 DOI: 10.48550/arXiv.2303.01726
Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga
{"title":"On Sensitivity of Compact Directed Acyclic Word Graphs","authors":"Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga","doi":"10.48550/arXiv.2303.01726","DOIUrl":"https://doi.org/10.48550/arXiv.2303.01726","url":null,"abstract":"Compact directed acyclic word graphs (CDAWGs) [Blumer et al. 1987] are a fundamental data structure on strings with applications in text pattern searching, data compression, and pattern discovery. Intuitively, the CDAWG of a string $T$ is obtained by merging isomorphic subtrees of the suffix tree [Weiner 1973] of the same string $T$, thus CDAWGs are a compact indexing structure. In this paper, we investigate the sensitivity of CDAWGs when a single character edit operation (insertion, deletion, or substitution) is performed at the left-end of the input string $T$, namely, we are interested in the worst-case increase in the size of the CDAWG after a left-end edit operation. We prove that if $e$ is the number of edges of the CDAWG for string $T$, then the number of new edges added to the CDAWG after a left-end edit operation on $T$ is less than $e$. Further, we present almost matching lower bounds on the sensitivity of CDAWGs for all cases of insertion, deletion, and substitution.","PeriodicalId":31852,"journal":{"name":"Beyond Words","volume":"64 1 1","pages":"168-180"},"PeriodicalIF":0.0,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87745307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
String attractors of fixed points of k-bonacci-like morphisms 类k-bonacci态射不动点的弦吸引子
Beyond Words Pub Date : 2023-02-27 DOI: 10.48550/arXiv.2302.13647
France Gheeraert, Giuseppe Romana, Manon Stipulanti
{"title":"String attractors of fixed points of k-bonacci-like morphisms","authors":"France Gheeraert, Giuseppe Romana, Manon Stipulanti","doi":"10.48550/arXiv.2302.13647","DOIUrl":"https://doi.org/10.48550/arXiv.2302.13647","url":null,"abstract":"Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms, string attractors have become a compelling object of theoretical research within the community of combinatorics on words. In this context, they have been studied for several families of finite and infinite words. In this paper, we obtain string attractors of prefixes of particular infinite words generalizing k-bonacci words (including the famous Fibonacci word) and obtained as fixed points of k-bonacci-like morphisms. In fact, our description involves the numeration systems classically derived from the considered morphisms","PeriodicalId":31852,"journal":{"name":"Beyond Words","volume":"71 1","pages":"192-205"},"PeriodicalIF":0.0,"publicationDate":"2023-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88102894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Smallest and Largest Block Palindrome Factorizations 最小和最大块回文分解
Beyond Words Pub Date : 2023-02-25 DOI: 10.48550/arXiv.2302.13147
D. Gabric, J. Shallit
{"title":"Smallest and Largest Block Palindrome Factorizations","authors":"D. Gabric, J. Shallit","doi":"10.48550/arXiv.2302.13147","DOIUrl":"https://doi.org/10.48550/arXiv.2302.13147","url":null,"abstract":"A emph{palindrome} is a word that reads the same forwards and backwards. A emph{block palindrome factorization} (or emph{BP-factorization}) is a factorization of a word into blocks that becomes palindrome if each identical block is replaced by a distinct symbol. We call the number of blocks in a BP-factorization the emph{width} of the BP-factorization. The emph{largest BP-factorization} of a word $w$ is the BP-factorization of $w$ with the maximum width. We study words with certain BP-factorizations. First, we give a recurrence for the number of length-$n$ words with largest BP-factorization of width $t$. Second, we show that the expected width of the largest BP-factorization of a word tends to a constant. Third, we give some results on another extremal variation of BP-factorization, the emph{smallest BP-factorization}. A emph{border} of a word $w$ is a non-empty word that is both a proper prefix and suffix of $w$. Finally, we conclude by showing a connection between words with a unique border and words whose smallest and largest BP-factorizations coincide.","PeriodicalId":31852,"journal":{"name":"Beyond Words","volume":"278 1","pages":"181-191"},"PeriodicalIF":0.0,"publicationDate":"2023-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75330832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rudin-Shapiro Sums Via Automata Theory and Logic Rudin-Shapiro基于自动机理论和逻辑的求和
Beyond Words Pub Date : 2023-02-01 DOI: 10.48550/arXiv.2302.00405
N. Rampersad, J. Shallit
{"title":"Rudin-Shapiro Sums Via Automata Theory and Logic","authors":"N. Rampersad, J. Shallit","doi":"10.48550/arXiv.2302.00405","DOIUrl":"https://doi.org/10.48550/arXiv.2302.00405","url":null,"abstract":"We show how to obtain, via a unified framework provided by logic and automata theory, many classical results of Brillhart and Morton on Rudin-Shapiro sums. The techniques also facilitate easy proofs for new results.","PeriodicalId":31852,"journal":{"name":"Beyond Words","volume":"10 1","pages":"233-246"},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75931482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Dyck Words, Pattern Avoidance, and Automatic Sequences Dyck单词，模式回避和自动序列
Beyond Words Pub Date : 2023-01-15 DOI: 10.48550/arXiv.2301.06145
Lucas Mol, N. Rampersad, J. Shallit
{"title":"Dyck Words, Pattern Avoidance, and Automatic Sequences","authors":"Lucas Mol, N. Rampersad, J. Shallit","doi":"10.48550/arXiv.2301.06145","DOIUrl":"https://doi.org/10.48550/arXiv.2301.06145","url":null,"abstract":"We study various aspects of Dyck words appearing in binary sequences, where $0$ is treated as a left parenthesis and $1$ as a right parenthesis. We show that binary words that are $7/3$-power-free have bounded nesting level, but this no longer holds for larger repetition exponents. We give an explicit characterization of the factors of the Thue-Morse word that are Dyck, and show how to count them. We also prove tight upper and lower bounds on $f(n)$, the number of Dyck factors of Thue-Morse of length $2n$.","PeriodicalId":31852,"journal":{"name":"Beyond Words","volume":"74 1","pages":"220-232"},"PeriodicalIF":0.0,"publicationDate":"2023-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74568044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Critical Exponents of Regular Arnoux-Rauzy Sequences 正则Arnoux-Rauzy序列的临界指数
Beyond Words Pub Date : 2023-01-01 DOI: 10.1007/978-3-031-33180-0_10
L'ubomíra Dvoráková, Jana Lepsová
{"title":"Critical Exponents of Regular Arnoux-Rauzy Sequences","authors":"L'ubomíra Dvoráková, Jana Lepsová","doi":"10.1007/978-3-031-33180-0_10","DOIUrl":"https://doi.org/10.1007/978-3-031-33180-0_10","url":null,"abstract":"","PeriodicalId":31852,"journal":{"name":"Beyond Words","volume":"3 1","pages":"130-142"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74310309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书