Finite Approximations and Similarity of Languages

B. Rovan, A. Varga
{"title":"Finite Approximations and Similarity of Languages","authors":"B. Rovan, A. Varga","doi":"10.1142/s0129054122500113","DOIUrl":null,"url":null,"abstract":"A new framework to measure distances (similarity) between formal languages and between grammars based on distances between words is introduced. It is based on approximating languages by their finite subsets and using monotone sequences of such finite approximations to define an infinite language in the limit. Distances between finite languages are defined and extended to distances between monotone sequences of finite languages leading to distances between infinite languages. The framework captures several distances studied in the literature. Context-free grammars with energy are introduced to enable finite approximations emphasizing “syntactically important” parts of words. Grammars with energy are also used to extend distances between monotone sequences of finite languages to distances between context-free grammars. A basic toolkit for monotone sequences of finite languages and distances between languages resp. grammars is provided. As part of this toolkit a non-symmetric version of distances is defined, providing additional characterisation of distances in general. Additional properties of distances between grammars are derived by restricting the“energy use” of grammars with energy. Some methods of estimating the distances are presented to be used in cases where the distance is not computable or difficult to compute.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Found. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129054122500113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A new framework to measure distances (similarity) between formal languages and between grammars based on distances between words is introduced. It is based on approximating languages by their finite subsets and using monotone sequences of such finite approximations to define an infinite language in the limit. Distances between finite languages are defined and extended to distances between monotone sequences of finite languages leading to distances between infinite languages. The framework captures several distances studied in the literature. Context-free grammars with energy are introduced to enable finite approximations emphasizing “syntactically important” parts of words. Grammars with energy are also used to extend distances between monotone sequences of finite languages to distances between context-free grammars. A basic toolkit for monotone sequences of finite languages and distances between languages resp. grammars is provided. As part of this toolkit a non-symmetric version of distances is defined, providing additional characterisation of distances in general. Additional properties of distances between grammars are derived by restricting the“energy use” of grammars with energy. Some methods of estimating the distances are presented to be used in cases where the distance is not computable or difficult to compute.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
语言的有限近似和相似性
提出了一种新的基于词间距离的形式语言之间和语法之间距离(相似度)度量框架。它基于语言的有限子集逼近,并利用这些有限逼近的单调序列在极限上定义无限语言。有限语言之间的距离被定义并扩展为有限语言单调序列之间的距离,从而导致无限语言之间的距离。该框架涵盖了文献中研究的几个距离。引入了具有能量的上下文无关语法,以实现强调单词“语法重要”部分的有限近似。带能量语法也用于将有限语言单调序列之间的距离扩展到上下文无关语法之间的距离。有限语言的单调序列和语言间距离的基本工具箱。提供语法。作为该工具包的一部分,定义了距离的非对称版本,提供了一般距离的附加特征。语法之间距离的附加属性是通过用能量限制语法的“能量使用”而得到的。在距离不可计算或难以计算的情况下,提出了一些估计距离的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Hardest LL(k) Language Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface Transportation Problem Allowing Sending and Bringing Back Online and Approximate Network Construction from Bounded Connectivity Constraints
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1