Highlights: Language‐ and domain‐independent automatic indexing terms for abstracting

Journal of the American Society for Information Science

Volumn 46, Issue 3, 1995, Pages 162-174

  Cohen, Jonathan D ^a  

^a Department of Defense ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84982395055     PISSN: 00028231     EISSN: 10974571     Source Type: Journal    
DOI: 10.1002/(SICI)1097-4571(199504)46:3<162::AID-ASI2>3.0.CO;2-6     Document Type: Article

References (68)

1. Automatic spelling correction using trigram similarity measure
2. An information‐theoretic approach to text searching in direct access systems
3. Document retrieval experiments using indexing vocabularies of varying size. I. Variety generation symbols assigned to the fronts of index terms
4. Computer selection of keywords using word‐frequency analysis
5. A statistical method of spelling correction
6. A technique for computer detection and correction of spelling errors
7. An experiment in automatic indexing
8. The reactive keyboard: A predictive typing aid
9. The application of the concept of homeosemy to natural language information retrieval
10. Automatic abstracting and indexing—Survey and recommendations
11. Context in word recognition
12. How effective is suffixing?
13. Implementation of the substring test for hashing
14. A probabilistic approach to automatic keyword indexing. Part I. On the distribution of specialty words in a technical literature
15. A probabilistic approach to automatic keyword indexing. Part II. An algorithm for probabilistic indexing
16. Experiments in text recognition with binary n‐gram and Viterbi algorithms
17. Suboptimal sequential decision schemes with on‐line feature ordering
18. Accelerated text searching through signature trees
19. Techniques for automatically correcting words in text
20. The decline of subject searching: Long‐term trends and patterns of index use in an online catalog
21. A statistical approach to the mechanized encoding and searching of literary information
22. Variety generation—A reinterpretation of Shannon's mathematical theory of communication, and its implications for information science
23. The degarbler—A program for correcting machine‐read Morse code
24. Computer detection of typographical errors
25. A study of English word category prediction based on neural networks
26. Generalized linear models
27. The Viterbi algorithm as an aid in text recognition
28. A performance evaluation of similarity measures, document term weighting schemes and representations in a Boolean environment
29. The effectiveness of stemming for natural‐language access to Slovene textual data
30. Continuous‐speech recognition using a stochastic language model
31. Adaptive language modeling using minimum discriminant estimation
32. A contextual postprocessing system for error correction using binary n‐grams
33. An evaluation of the applicability of ranking algorithms to improve the effectiveness of full‐text retrieval. II. On the effectiveness of ranking algorithms on full‐text retrieval
34. Classification of ranking algorithms
35. Term‐weighting approaches in automatic text retrieval
36. On the specification of term values in automatic indexing
37. A theory of term importance in automatic text analysis
38. Another look at automatic text‐retrieval systems
39. Selection of equifrequent word fragments for information retrieval
40. Prediction and entropy of printed english
41. A simplified heuristic version of a recursive Bayes algorithm for using context in text recognition
42. A statistical interpretation of term specificity and its application in retrieval
43. Index term weighting
44. On generalizing the two‐Poisson model
45. n‐Gram statistics for natural language understanding and text processing
46. Character recognition in context
47. Binary n‐gram technique for automatic correction of substitution, deletion. insertion, and reversal errors in words
48. Document retrieval experiments using indexing vocabularies of varying size. II. Hashing, truncation, digram and trigram encoding of index terms
49. Effective text compression with simultaneous digram and trigram encoding
50. Hybrid grammar‐bigram speech recognition system with first‐order dependence model
51. An insight into the entropy and redundancy of the English dictionary
52. An assessment of N‐phoneme statistics in phoneme guessing algorithms which aim to incorporate phonotactic constraints
53. Automatic detection and correction of spelling errors in a large data base
54. The use of trigram analysis for spelling error detection