NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 12 results Save | Export
Peer reviewed Peer reviewed
PDF on ERIC Download full text
Feng, Mingyu, Ed.; Käser, Tanja, Ed.; Talukdar, Partha, Ed. – International Educational Data Mining Society, 2023
The Indian Institute of Science is proud to host the fully in-person sixteenth iteration of the International Conference on Educational Data Mining (EDM) during July 11-14, 2023. EDM is the annual flagship conference of the International Educational Data Mining Society. The theme of this year's conference is "Educational data mining for…
Descriptors: Information Retrieval, Data Analysis, Computer Assisted Testing, Cheating
DOLBY, J.L.; AND OTHERS – 1965
THE STUDY IS CONCERNED WITH THE LINGUISTIC PROBLEM INVOLVED IN TEXT COMPRESSION--EXTRACTING, INDEXING, AND THE AUTOMATIC CREATION OF SPECIAL-PURPOSE CITATION DICTIONARIES. IN SPITE OF EARLY SUCCESS IN USING LARGE-SCALE COMPUTERS TO AUTOMATE CERTAIN HUMAN TASKS, THESE PROBLEMS REMAIN AMONG THE MOST DIFFICULT TO SOLVE. ESSENTIALLY, THE PROBLEM IS TO…
Descriptors: Algorithms, Computational Linguistics, Data Processing, English
Smith, David Canfield – 1970
MLISP (meta-LISP) is a high level list-processing and symbol-manipulation language based on the programing language LISP (List Processor). MLISP programs are translated into LISP programs and then executed or compiled. MLISP exists for two purposes: (1) to facilitate the writing and understanding of LISP programs; (2) to remedy certain important…
Descriptors: Algorithms, Artificial Intelligence, Computer Programs, Digital Computers
Peer reviewed Peer reviewed
Sheridan, Paraic; Smeaton, Alan F. – Information Processing and Management, 1992
Describes a process of morpho-syntactic language analysis for information retrieval. Tree Structured Analytics (TSA) used for text representation is summarized; the matching process developed for such structures is outlined with an example appended; and experiments carried out to evaluate the effectiveness of TSA matching are discussed. (26…
Descriptors: Algorithms, Full Text Databases, Information Retrieval, Research Needs
Peer reviewed Peer reviewed
Sechser, Otto – Information Processing and Management, 1982
Analyzes the formal properties, structural consequences, similarities, and differences of link indicators, brackets, and cohesion separators in the query languages employed in information retrieval. Eleven figures, a 32-item reference list, and appendices on Extended Backus Notation and the formal definition of the Formal Relevance Language are…
Descriptors: Algorithms, Indexes, Information Retrieval, Online Systems
Peer reviewed Peer reviewed
Spiegler, Israel; Elata, Smadar – Information Processing and Management, 1988
Presents a model for the a priori analysis of natural language queries which uses an algorithm to transform the query into a logical pattern that is used to determine the answerability of the query. The results of testing by a prototype system implemented in PROLOG are discussed. (20 references) (CLB)
Descriptors: Algorithms, Computational Linguistics, Databases, Information Retrieval
Peer reviewed Peer reviewed
de Heer, T. – Information Processing and Management, 1982
Addresses problem of developing machine-based information system capable of indicating one document, out of a set of documents written in natural language, which shows maximal degree of homeosemy (relationship in meaning between two texts language-fragments ) toward natural language query. Linguistic aspects, information traces, trigrams,…
Descriptors: Algorithms, Computer Programs, Information Retrieval, Information Systems
Peer reviewed Peer reviewed
Jones, Leslie P.; And Others – Journal of the American Society for Information Science, 1990
Describes two computer programs--INDEX and INDEXD--that use statistical information about repeated phrases in documents to automatically index documents at the conceptual level. Sample output of the programs is provided, and plans to combine this method with linguistic and artificial intelligence techniques to provide a general conceptual…
Descriptors: Algorithms, Artificial Intelligence, Automatic Indexing, Computational Linguistics
Peer reviewed Peer reviewed
Cohen, Sara; Kanza, Yaron; Kogan, Yakov; Sagiv, Yehoshua; Nutt, Werner; Serebrenik, Alexander – Journal of the American Society for Information Science and Technology, 2002
Describes EquiX, a search language for XML that combines querying with searching to query the data and the meta-data content of Web pages. Topics include search engines; a data model for XML documents; search query syntax; search query semantics; an algorithm for evaluating a query on a document; and indexing EquiX queries. (LRW)
Descriptors: Algorithms, Evaluation Methods, Indexing, Information Retrieval
Peer reviewed Peer reviewed
Gordon, Michael D. – Information Processing and Management, 1988
Describes the three subsystems of an information retrieval system (document descriptions, queries, and matching algorithms) and argues that the interdependency of these subsystems requires adaptation for the system to perform when any component changes. An algorithm for redescribing documents, in response to changes in queries and retrieval rules,…
Descriptors: Algorithms, Feedback, Information Retrieval, Models
Peer reviewed Peer reviewed
Molto, Mavis; Svenonius, Elaine – Information Processing and Management, 1991
Study results indicate that it is feasible to develop automatic name recognition algorithms to distinguish character strings representing names from other character strings occurring in English language titles. This finding offers cautious promise for alleviating some of the labor intensive work of cataloging. (16 references) (Author/SD)
Descriptors: Algorithms, Cataloging, Computer System Design, Expert Systems
Peer reviewed Peer reviewed
Das-Gupta, Padmini – Journal of the American Society for Information Science, 1987
Presents an algorithm for use in natural language document retrieval systems which automatically determines if the conjunction "and" in a statement representing an information need should be translated into a Boolean "and" or "or." The results of an experiment that used the algorithm are reported, and further research is suggested. (CLB)
Descriptors: Algorithms, Componential Analysis, Computational Linguistics, Conjunctions