{"title":"具有错误恢复功能的表格解析算法","authors":"F. Hadlock","doi":"10.1145/1122018.1122074","DOIUrl":null,"url":null,"abstract":"In this article, a general tabular parsing algorithm is developed which permits isolated errors due to deletion, replacement, or insertion of a word or phrase, and which finds the derivation with minimum errors.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A tabular parsing algorithm with error recovery\",\"authors\":\"F. Hadlock\",\"doi\":\"10.1145/1122018.1122074\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, a general tabular parsing algorithm is developed which permits isolated errors due to deletion, replacement, or insertion of a word or phrase, and which finds the derivation with minimum errors.\",\"PeriodicalId\":349974,\"journal\":{\"name\":\"ACM-SE 33\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM-SE 33\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1122018.1122074\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 33","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1122018.1122074","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this article, a general tabular parsing algorithm is developed which permits isolated errors due to deletion, replacement, or insertion of a word or phrase, and which finds the derivation with minimum errors.