J. A. Craig, Susan C. Berezner, Homer C. Carney, Christopher R. Longyear
{"title":"执事:直接英语访问和控制","authors":"J. A. Craig, Susan C. Berezner, Homer C. Carney, Christopher R. Longyear","doi":"10.1145/1464291.1464330","DOIUrl":null,"url":null,"abstract":"The extensive syntactic ambiguity inherent in natural language has been convincingly shown by such systems as the Harvard syntactic analyzer. Furthermore, no semantic techniques are in prospect for satisfactory resolution of this ambiguity by computer. In contrast, well-developed semantic techniques exist for formal languages.","PeriodicalId":297471,"journal":{"name":"AFIPS '66 (Fall)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1966-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"DEACON: direct English access and control\",\"authors\":\"J. A. Craig, Susan C. Berezner, Homer C. Carney, Christopher R. Longyear\",\"doi\":\"10.1145/1464291.1464330\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The extensive syntactic ambiguity inherent in natural language has been convincingly shown by such systems as the Harvard syntactic analyzer. Furthermore, no semantic techniques are in prospect for satisfactory resolution of this ambiguity by computer. In contrast, well-developed semantic techniques exist for formal languages.\",\"PeriodicalId\":297471,\"journal\":{\"name\":\"AFIPS '66 (Fall)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1966-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AFIPS '66 (Fall)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1464291.1464330\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AFIPS '66 (Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1464291.1464330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The extensive syntactic ambiguity inherent in natural language has been convincingly shown by such systems as the Harvard syntactic analyzer. Furthermore, no semantic techniques are in prospect for satisfactory resolution of this ambiguity by computer. In contrast, well-developed semantic techniques exist for formal languages.