{"title":"基于输出层的严格2-局部函数的高效学习","authors":"Phillip Burness, Kevin McMullin","doi":"10.18653/v1/W19-5707","DOIUrl":null,"url":null,"abstract":"This paper characterizes the Output Tier-based Strictly k-Local (OTSLk) class of string-tostring functions, which are relevant for modeling long-distance phonological processes as input-output maps. After showing that any OTSLk function can be learned when k and the tier are given, we present a new algorithm that induces the tier itself when k = 2 and provably learns any total OTSL2 function in polynomial time and data—the first such learner for any class of tier-based functions.","PeriodicalId":298538,"journal":{"name":"Proceedings of the 16th Meeting on the Mathematics of Language","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Efficient learning of Output Tier-based Strictly 2-Local functions\",\"authors\":\"Phillip Burness, Kevin McMullin\",\"doi\":\"10.18653/v1/W19-5707\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper characterizes the Output Tier-based Strictly k-Local (OTSLk) class of string-tostring functions, which are relevant for modeling long-distance phonological processes as input-output maps. After showing that any OTSLk function can be learned when k and the tier are given, we present a new algorithm that induces the tier itself when k = 2 and provably learns any total OTSL2 function in polynomial time and data—the first such learner for any class of tier-based functions.\",\"PeriodicalId\":298538,\"journal\":{\"name\":\"Proceedings of the 16th Meeting on the Mathematics of Language\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 16th Meeting on the Mathematics of Language\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18653/v1/W19-5707\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 16th Meeting on the Mathematics of Language","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18653/v1/W19-5707","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient learning of Output Tier-based Strictly 2-Local functions
This paper characterizes the Output Tier-based Strictly k-Local (OTSLk) class of string-tostring functions, which are relevant for modeling long-distance phonological processes as input-output maps. After showing that any OTSLk function can be learned when k and the tier are given, we present a new algorithm that induces the tier itself when k = 2 and provably learns any total OTSL2 function in polynomial time and data—the first such learner for any class of tier-based functions.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
