A. Demaille, A. Duret-Lutz, Florian Lesaint, S. Lombardy, J. Sakarovitch, Florent Terrones
{"title":"加权自动机、换能器和正则表达式描述的XML格式建议","authors":"A. Demaille, A. Duret-Lutz, Florian Lesaint, S. Lombardy, J. Sakarovitch, Florent Terrones","doi":"10.3233/978-1-58603-975-2-199","DOIUrl":null,"url":null,"abstract":"We present an XML format that allows to describe a large class of finite weighted automata and transducers. Our design choices stem from our policy of making the implementation as simple as possible. This format has been tested for the communication between the modules of our automata manipulation platform Vaucanson, but this document is less an experiment report than a position paper intended to open the discussion among the community of automata software writers.","PeriodicalId":286427,"journal":{"name":"Finite-State Methods and Natural Language Processing","volume":"311 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions\",\"authors\":\"A. Demaille, A. Duret-Lutz, Florian Lesaint, S. Lombardy, J. Sakarovitch, Florent Terrones\",\"doi\":\"10.3233/978-1-58603-975-2-199\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an XML format that allows to describe a large class of finite weighted automata and transducers. Our design choices stem from our policy of making the implementation as simple as possible. This format has been tested for the communication between the modules of our automata manipulation platform Vaucanson, but this document is less an experiment report than a position paper intended to open the discussion among the community of automata software writers.\",\"PeriodicalId\":286427,\"journal\":{\"name\":\"Finite-State Methods and Natural Language Processing\",\"volume\":\"311 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Finite-State Methods and Natural Language Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/978-1-58603-975-2-199\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite-State Methods and Natural Language Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/978-1-58603-975-2-199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions
We present an XML format that allows to describe a large class of finite weighted automata and transducers. Our design choices stem from our policy of making the implementation as simple as possible. This format has been tested for the communication between the modules of our automata manipulation platform Vaucanson, but this document is less an experiment report than a position paper intended to open the discussion among the community of automata software writers.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
