指数字符串及其编辑距离

Ingyu Baek
{"title":"指数字符串及其编辑距离","authors":"Ingyu Baek","doi":"arxiv-2408.12931","DOIUrl":null,"url":null,"abstract":"An exponent-string is an extension of traditional strings that can\nincorporate real-numbered exponents, indicating the quantity of characters.\nThis novel representation overcomes the limitations of traditional discrete\nstring by enabling precise data representation for applications such as\nphonetic transcription that contains sound duration. Although applications of exponent-string are focused on exponent-string with\nreal-numbered exponents, formal definition uses arbitrary semigroup. For any\nsemigroup $S$, $S$-exponent-strings are allowed to have elements of $S$ as\nexponents. We investigate algebraic properties of $S$-exponent-strings and\nfurther justify $\\mathbb{R}^+$-exponent-string is a natural extension of the\nstring. Motivated by the problem of calculating the similarity between spoken phone\nsequence and correct phone sequence, we develop exp-edit distance -- a\nspecialized metric designed to measure the similarity between\n$\\mathbb{R}^+$-exponent-strings. By extending the traditional string edit\ndistance to handle continuous values, exp-edit distance deals with\n$\\mathbb{R}^+$-exponent-strings that embody both discrete and continuous\nproperties. Our exploration includes a rigorous mathematical formulation of\nexp-edit distance and an algorithm to compute it.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"5 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Exponent-Strings and Their Edit Distance\",\"authors\":\"Ingyu Baek\",\"doi\":\"arxiv-2408.12931\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An exponent-string is an extension of traditional strings that can\\nincorporate real-numbered exponents, indicating the quantity of characters.\\nThis novel representation overcomes the limitations of traditional discrete\\nstring by enabling precise data representation for applications such as\\nphonetic transcription that contains sound duration. Although applications of exponent-string are focused on exponent-string with\\nreal-numbered exponents, formal definition uses arbitrary semigroup. For any\\nsemigroup $S$, $S$-exponent-strings are allowed to have elements of $S$ as\\nexponents. We investigate algebraic properties of $S$-exponent-strings and\\nfurther justify $\\\\mathbb{R}^+$-exponent-string is a natural extension of the\\nstring. Motivated by the problem of calculating the similarity between spoken phone\\nsequence and correct phone sequence, we develop exp-edit distance -- a\\nspecialized metric designed to measure the similarity between\\n$\\\\mathbb{R}^+$-exponent-strings. By extending the traditional string edit\\ndistance to handle continuous values, exp-edit distance deals with\\n$\\\\mathbb{R}^+$-exponent-strings that embody both discrete and continuous\\nproperties. Our exploration includes a rigorous mathematical formulation of\\nexp-edit distance and an algorithm to compute it.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-23\",\"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.12931\",\"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.12931","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

幂级数字符串是传统字符串的扩展,它可以包含实数指数,表示字符的数量。这种新颖的表示方法克服了传统离散字符串的局限性,可以为包含声音持续时间的语音转录等应用提供精确的数据表示。虽然指数字符串的应用主要集中在有实数指数的指数字符串上,但其正式定义可使用任意半群。对于任意半群 $S$,$S$-指数字符串允许以 $S$ 的元素为幂级数。我们研究了$S$-幂级数弦的代数性质,并进一步证明$mathbb{R}^+$-幂级数弦是该弦的自然扩展。受计算口语语音序列与正确语音序列之间相似性问题的启发,我们开发了exp-edit距离--一种专门用于测量$\mathbb{R}^+$-外分量-字符串之间相似性的度量。通过扩展传统的字符串编辑距离以处理连续值,exp-edit 距离可以处理同时体现离散和连续属性的元组字符串。我们的探索包括对exp-edit distance的严格数学表述以及计算它的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Exponent-Strings and Their Edit Distance
An exponent-string is an extension of traditional strings that can incorporate real-numbered exponents, indicating the quantity of characters. This novel representation overcomes the limitations of traditional discrete string by enabling precise data representation for applications such as phonetic transcription that contains sound duration. Although applications of exponent-string are focused on exponent-string with real-numbered exponents, formal definition uses arbitrary semigroup. For any semigroup $S$, $S$-exponent-strings are allowed to have elements of $S$ as exponents. We investigate algebraic properties of $S$-exponent-strings and further justify $\mathbb{R}^+$-exponent-string is a natural extension of the string. Motivated by the problem of calculating the similarity between spoken phone sequence and correct phone sequence, we develop exp-edit distance -- a specialized metric designed to measure the similarity between $\mathbb{R}^+$-exponent-strings. By extending the traditional string edit distance to handle continuous values, exp-edit distance deals with $\mathbb{R}^+$-exponent-strings that embody both discrete and continuous properties. Our exploration includes a rigorous mathematical formulation of exp-edit distance and an algorithm to compute it.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Query Learning of Advice and Nominal Automata Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny Run supports and initial algebra supports of weighted automata Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata $\mathbb{N}$-polyregular functions arise from well-quasi-orderings
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1