{"title":"结合有限状态自动机和贪婪学习算法来确定逗号的句法角色","authors":"S. V. Delden, F. Gomez","doi":"10.1109/TAI.2002.1180817","DOIUrl":null,"url":null,"abstract":"A method has been developed and implemented that assigns syntactic roles to commas. Text that has been tagged using a part-of-speech tagger serves as the input to the system. A set of Finite State Automata first assigns temporary syntactic roles to each comma in the sentence. A greedy learning algorithm is then used to determine the final syntactic roles of the commas. The system requires no training and is not domain specific. The performance of the system on numerous corpora is given.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Combining finite state automata and a greedy learning algorithm to determine the syntactic roles of commas\",\"authors\":\"S. V. Delden, F. Gomez\",\"doi\":\"10.1109/TAI.2002.1180817\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method has been developed and implemented that assigns syntactic roles to commas. Text that has been tagged using a part-of-speech tagger serves as the input to the system. A set of Finite State Automata first assigns temporary syntactic roles to each comma in the sentence. A greedy learning algorithm is then used to determine the final syntactic roles of the commas. The system requires no training and is not domain specific. The performance of the system on numerous corpora is given.\",\"PeriodicalId\":197064,\"journal\":{\"name\":\"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.2002.1180817\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.2002.1180817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Combining finite state automata and a greedy learning algorithm to determine the syntactic roles of commas
A method has been developed and implemented that assigns syntactic roles to commas. Text that has been tagged using a part-of-speech tagger serves as the input to the system. A set of Finite State Automata first assigns temporary syntactic roles to each comma in the sentence. A greedy learning algorithm is then used to determine the final syntactic roles of the commas. The system requires no training and is not domain specific. The performance of the system on numerous corpora is given.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
