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