{"title":"看看爱沙尼亚语的音节化","authors":"Heiki-Jaan Kaalep","doi":"10.22364/bjmc.2022.10.3.08","DOIUrl":null,"url":null,"abstract":". The paper presents a detailed description of an algorithm of Estonian syllabification. The paper has a dual goal: justify the algorithm with references to phonology, and make it robust enough for using on real-life texts. The algorithm is presented as a commented set of finite state transducer expressions.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Looking into Estonian Syllabification\",\"authors\":\"Heiki-Jaan Kaalep\",\"doi\":\"10.22364/bjmc.2022.10.3.08\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". The paper presents a detailed description of an algorithm of Estonian syllabification. The paper has a dual goal: justify the algorithm with references to phonology, and make it robust enough for using on real-life texts. The algorithm is presented as a commented set of finite state transducer expressions.\",\"PeriodicalId\":431209,\"journal\":{\"name\":\"Balt. J. Mod. Comput.\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Balt. J. Mod. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22364/bjmc.2022.10.3.08\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Balt. J. Mod. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22364/bjmc.2022.10.3.08","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
. The paper presents a detailed description of an algorithm of Estonian syllabification. The paper has a dual goal: justify the algorithm with references to phonology, and make it robust enough for using on real-life texts. The algorithm is presented as a commented set of finite state transducer expressions.