{"title":"使用概率语法进行有效的自然语言解析","authors":"Pawel Skórzewski","doi":"10.1109/IMCSIT.2010.5679860","DOIUrl":null,"url":null,"abstract":"This paper presents an example of application of a PCFG parsing algorithm based on the A* search procedure in a machine translation system. We modified the existing CYK-based parser used in the machine translation system Translatica and applied the A* parsing algorithm in order to improve the performance of the parser.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Effective natural language parsing with probabilistic grammars\",\"authors\":\"Pawel Skórzewski\",\"doi\":\"10.1109/IMCSIT.2010.5679860\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an example of application of a PCFG parsing algorithm based on the A* search procedure in a machine translation system. We modified the existing CYK-based parser used in the machine translation system Translatica and applied the A* parsing algorithm in order to improve the performance of the parser.\",\"PeriodicalId\":147803,\"journal\":{\"name\":\"Proceedings of the International Multiconference on Computer Science and Information Technology\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Multiconference on Computer Science and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMCSIT.2010.5679860\",\"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 International Multiconference on Computer Science and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCSIT.2010.5679860","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Effective natural language parsing with probabilistic grammars
This paper presents an example of application of a PCFG parsing algorithm based on the A* search procedure in a machine translation system. We modified the existing CYK-based parser used in the machine translation system Translatica and applied the A* parsing algorithm in order to improve the performance of the parser.