{"title":"在线索引词预测使用双词关联","authors":"Jon T. Rickman, H. W. Gardner","doi":"10.1145/800192.805715","DOIUrl":null,"url":null,"abstract":"Predicting index terms (or keywords) by examining a word's component letter strings is investigated. The weights or string-term associations for the letter strings are determined by using relative frequencies computed from a representative sample of the total abstract (or document) collection. The experimental results indicate that the terms predicted by using bigrams (letter pairs) are effectively the same as those predicted by using bigrams and longer letter strings.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"56 1","pages":"262-270"},"PeriodicalIF":0.0000,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On-line index term predictions using bigram-term associations\",\"authors\":\"Jon T. Rickman, H. W. Gardner\",\"doi\":\"10.1145/800192.805715\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Predicting index terms (or keywords) by examining a word's component letter strings is investigated. The weights or string-term associations for the letter strings are determined by using relative frequencies computed from a representative sample of the total abstract (or document) collection. The experimental results indicate that the terms predicted by using bigrams (letter pairs) are effectively the same as those predicted by using bigrams and longer letter strings.\",\"PeriodicalId\":72321,\"journal\":{\"name\":\"ASSETS. Annual ACM Conference on Assistive Technologies\",\"volume\":\"56 1\",\"pages\":\"262-270\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1973-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ASSETS. Annual ACM Conference on Assistive Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800192.805715\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ASSETS. Annual ACM Conference on Assistive Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800192.805715","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On-line index term predictions using bigram-term associations
Predicting index terms (or keywords) by examining a word's component letter strings is investigated. The weights or string-term associations for the letter strings are determined by using relative frequencies computed from a representative sample of the total abstract (or document) collection. The experimental results indicate that the terms predicted by using bigrams (letter pairs) are effectively the same as those predicted by using bigrams and longer letter strings.