{"title":"语法和计算","authors":"Jane J. Robinson","doi":"10.1145/1499586.1499589","DOIUrl":null,"url":null,"abstract":"Algorithms have been developed for generating and parsing with context-sensitive grammars. In principle, the contexts to which a grammar is sensitive can be syntactic, semantic, pragmatic, or phonetic. This development points up the need to develop a new kind of lexicon, whose entries contain large amounts of several kinds of contextual information about each word or morpheme, provided in computable form. Ways in which both the form and content of the entries differ from those of traditional dictionaries are indicated.","PeriodicalId":376661,"journal":{"name":"AFIPS National Computer Conference","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1973-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Syntax and computation\",\"authors\":\"Jane J. Robinson\",\"doi\":\"10.1145/1499586.1499589\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Algorithms have been developed for generating and parsing with context-sensitive grammars. In principle, the contexts to which a grammar is sensitive can be syntactic, semantic, pragmatic, or phonetic. This development points up the need to develop a new kind of lexicon, whose entries contain large amounts of several kinds of contextual information about each word or morpheme, provided in computable form. Ways in which both the form and content of the entries differ from those of traditional dictionaries are indicated.\",\"PeriodicalId\":376661,\"journal\":{\"name\":\"AFIPS National Computer Conference\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1973-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AFIPS National Computer Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1499586.1499589\",\"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 National Computer Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1499586.1499589","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Algorithms have been developed for generating and parsing with context-sensitive grammars. In principle, the contexts to which a grammar is sensitive can be syntactic, semantic, pragmatic, or phonetic. This development points up the need to develop a new kind of lexicon, whose entries contain large amounts of several kinds of contextual information about each word or morpheme, provided in computable form. Ways in which both the form and content of the entries differ from those of traditional dictionaries are indicated.