LECOM(ID:263/lec001)

LeHigh COMIT 

Augmented version of COMIT developed at LeHigh by Donald Hillman and his postgraduate students to carry out experiments in information retrieval at the Center for the Information Sciences.

It ran on a GE 225
Places
Related languages
COMIT => LECOM   Port
References:
  • Hillman, Donald J. "Graphs and algorithms for term relations" Report No 7 1964 view details
          in Series: "Document retrieval theory, relevance, and the methodology of evaluation" Center for the Information Sciences, Lehigh University, Bethlehem, Pa. 1966- 1969 view details
  • Hillman, Donald J. "Grammars and text analysis" Report No 1 1965 view details
          in Series: "Document retrieval theory, relevance, and the methodology of evaluation" Center for the Information Sciences, Lehigh University, Bethlehem, Pa. 1966- 1969 view details
  • Hilton, W. Ralph and Hillman, Donald J. The Structure of LECOM" Report No 2 June, 1966 view details
          in Series: "Document retrieval theory, relevance, and the methodology of evaluation" Center for the Information Sciences, Lehigh University, Bethlehem, Pa. 1966- 1969 view details
  • Reed, David M.; and Hillman, Donald J. "Canonical decomposition" Report No. 4, August 1966 view details
          in Series: "Document retrieval theory, relevance, and the methodology of evaluation" Center for the Information Sciences, Lehigh University, Bethlehem, Pa. 1966- 1969 view details
  • Hillman, Donald J. "Arithmetization of syntactic analysis" Report No 5 1967 view details
          in Series: "Document retrieval theory, relevance, and the methodology of evaluation" Center for the Information Sciences, Lehigh University, Bethlehem, Pa. 1966- 1969 view details
  • Bennett, J. L. review of Reed and Hillman 1966 (LECOM) view details Abstract: This is another in a series of reports by Hillman and his students on information storage and retrieval. Giveninthis third report on experimental procedures is an account of a program written for the GE 225 computer in LECOM (a version of COMIT). The words of the input English sentences have been tagged with parts of speech, and phrase boundaries have been identified by a previous program. The present program provides output strings of words rearranged in a "canonical form." Examples are given in an appendix, but there is no discussion of limitations on input sentences which can be processed, or of the well-known problems of structural ambiguity.

    To gain a reasonable understanding of, and perspective on, this work, the report probably should be read after study of the earlier theoretical and experimental papers listed as references.
          in ACM Computing Reviews 9(01) January 1968 view details
  • Sammet, Jean E. "Computer Languages - Principles and History" Englewood Cliffs, N.J. Prentice-Hall 1969. p.419. view details
          in ACM Computing Reviews 9(01) January 1968 view details