Information Retrieval MCQ Quiz in தமிழ் - Objective Question with Answer for Information Retrieval - இலவச PDF ஐப் பதிவிறக்கவும்

The correct answer is Search Formulation.

Key Points

•  Truncation
  • Truncation means the concatenation of words.
  • In other words, if the root string of the words is searched it brings all the derivatives derived out of the given root string.
  • ​Truncation is also known as wildcard searching.
  • It lets you search for a term and variant spellings of that term. 

Additional Information

Citation Analysis:

• ​Citation analysis is the examination of the frequency, patterns, and graphs of citations in documents.
• It uses the directed graph of citations — links from one document to another document — to reveal the properties of the documents.

Machine translation:

• Machine translation is the application of computers to the task of translating text from one natural language to another.

The correct answer is Operators in searching;

Key Points

•  Boolean operators are a type of logical operator used in information retrieval and search engines to refine and define search queries. They include three operators: 'AND', 'OR', and 'NOT'.
• In the context of information search, 'AND', 'OR', and 'NOT' are logical operators that are used to refine search queries and improve search results.
  • AND': The 'AND' operator is used to narrow down search results by specifying that all search terms must be present in the search results. For example, searching for "cats AND dogs" will return results that include both "cats" and "dogs."
    • AND is productive.
  • OR': The 'OR' operator is used to broaden search results by specifying that any of the search terms can be present in the search results. For example, searching for "cats OR dogs" will return results that include either "cats" or "dogs."
    • ​OR is Additive
  • NOT': The 'NOT' operator is used to exclude certain terms from the search results. For example, searching for "cats NOT dogs" will return results that include "cats" but exclude any results that include "dogs."
    • NOT is a logical difference;
• ​These operators were devised by Gorge Boole.

The Correct answer is Rate of obsolescence.

Key Points

• In the field of information and knowledge management, half-life represents the time it takes for information or knowledge to become outdated or obsolete.
• Just like in radioactive decay, where half-life refers to the time it takes for half of the radioactive substance to decay, in information science, it signifies how quickly information loses its relevance.
• Factors such as technological advancements, changing paradigms, and evolving contexts contribute to the diminishing relevance of information over time.
• Researchers and practitioners in information science study this phenomenon to understand how to manage and update information effectively.

Additional InformationHalf-life in information science can be determined based on citation or circulation data.

• For citation-based half-life, the median publication year of documents citing the source document is subtracted from the publication year of the source document.
• For instance, if an article was published in 1994 and received 83 citations over 16 years, with the median citing document published in 2000, the half-life would be 6 years (2000 - 1994).
• For circulation-based half-life, the median issue year of circulated items is subtracted from the acquisition year of the source item.
• For example, if a library acquired a book in 1995 and it circulated 83 times over 16 years, with the median issue year being 2000, the half-life would be 5 years (2000 - 1995).

The Correct answer is N.J. Belkin;

Key Points

Anomalous State of Knowledge model:

• The anomalous State of Knowledge model, one of the user-centered models of information retrieval was proposed by Nicholas James Belkin.
• In this model, there are four (4) dimensions that characterize search behavior and it can be combined in 16 different ways:
  • Method of interaction (Searching/Scanning)
  • The goal of Interaction (Learning /Selecting)
  • Mode of retrieval (Recognition/ Specification)
  • Resource Considered (Information/Meta-information).

Additional Information

• Other models of information retrieval Based on Theories and Tools:
  • Boolean Retrieval Model:
  • Set-Theoretic Model
  • Vector Space.Model
  • Probabilistic Retrieval Model
  • Linguistic Model
  • Mathematical Model
  • Economic Model
  • Hypertext Linkage Model,
• Models Based on Input/Output:
  • Data Retrieval Model
  • Information Retrieval Model
  • Knowledge Retrieval Model.

The correct answer is Search Formulation.

Key Points

•  Truncation
  • Truncation means the concatenation of words.
  • In other words, if the root string of the words is searched it brings all the derivatives derived out of the given root string.
  • ​Truncation is also known as wildcard searching.
  • It lets you search for a term and variant spellings of that term. 

Additional Information

Citation Analysis:

• ​Citation analysis is the examination of the frequency, patterns, and graphs of citations in documents.
• It uses the directed graph of citations — links from one document to another document — to reveal the properties of the documents.

Machine translation:

• Machine translation is the application of computers to the task of translating text from one natural language to another.

The Correct answer is B and D.

Key Points

• Network databases:
  • ​Network databases resemble the Hierarchical database model, often referred to as a modified version of it.
  • In the network database model, data is organized in a manner similar to a graph, allowing for more than one parent node.
  • A Network Database Management System is a system in which data elements maintain either a one-to-one relationship (1:1) or a many-to-many relationship (N:N).
  • While it retains a hierarchical structure, the data is organized in a graph-like manner, allowing one child record to have more than one parent.
  • Advantages:
    • Conceptually, the network model is simple and easy to design.
    • Redundancy in data can be more effectively represented in the network model compared to the hierarchical model.
    • The network model handles one-to-many and many-to-many relationships, making it suitable for modeling real-life situations.
    • Data access is easier and more flexible than in the hierarchical model.
    • The network model excels in isolating programs from complex physical storage details.
  • Disadvantages:
    • ​The database structure becomes complex as all records are maintained using pointers.
    • Operations like insertion, deletion, and updating of records require a large number of pointer adjustments.
    • Implementing structural changes to the database is challenging.

The Correct answer is Boolean operators.

Key Points

•  Boolean Search:
  • ​Boolean Operators are simple words (AND, OR, NOT, or AND NOT) used as conjunctions to combine or exclude keywords in a search, resulting in more focus and productivity.
  • When Boolean operators are used for searching it is known as Boolean search
  • This kind of searching is also known as Combinatorial search.
  • The basic operations of Boolean algebra are conjunction, disjunction, and negation.
• AND:
  • This operator will retrieve all the documents which contain all the keywords occurring at both ends of the AND operator.
• OR:
  • This operator will retrieve all the documents which contain all the keywords occurring at both ends of the OR operator.
• NOT or AND NOT:
  • These operators increase the precision of the search result. 

Additional InformationPhrase Searching:

• ​Phrase searching involves placing search keywords within quotes (e.g., "...").

​Proximity Search:

• A proximity search enables you to define the closeness required between two or more words to constitute a match.

Truncation, marked by an asterisk (*) during searching, aims to broaden search results.

The Correct answer is ​​Deep Structure and Surface Structure.

Key Points

• Transformational Grammar:
  • ​Transformational grammar is a generative grammar.  It was first introduced by Noam Chomsky.
  • Chomsky developed the idea that each sentence in a language has two levels of representation:
    • a deep structure and a
    • surface structure.
  • The deep structure represents the core semantic relations of a sentence and is mapped onto the surface structure via transformations.
  • It is to be noted that context-free grammars fail to represent subject-verb agreement in all cases.
  • Transformational grammar starts with context-free rules to build up the basics of the sentence but then modifies the basic sentences with the transformational rules.
  • Chomsky's theories have evolved, with transformations remaining significant, although the original distinction between deep structure and surface structure has been abandoned.
  • In the 1990s, Chomsky introduced a new research program called Minimalism, where deep structure and surface structure are no longer emphasized, and logical form (LF) and phonetic form (PF) are the sole levels of representation.

Additional Information

• Syntactic analysis:
  • ​Syntax deals with the structural properties of the texts.
  • It is the grammatical arrangement of words in sentences.
  • In the syntactic analysis, valid sentences are recognized and their underlying structures are determined.
  • The syntactic analysis process involves analyzing and decomposing the sentences into parts of speech with an explanation of the form, function, and syntactical relationship of each part
  • Context-free Grammar:
    • ​Context-free grammar was developed by Noam Chomsky in the mid of 1950's.
    •  A grammar is called context-free when its production rules can be applied regardless of the context of a non-terminal.
    • According to this grammar in each production, there must be only a single nonterminal symbol on its left-hand side

The Correct answer is a - i, b - iv, c - ii, d - iii

Key Points

• Boolean Search:
  • ​Boolean Operators are simple words (AND, OR, NOT, or AND NOT) used as conjunctions to combine or exclude keywords in a search, resulting in more focus and productivity.
  • When Boolean operators are used for searching it is known as Boolean search
  • This kind of searching is also known as Combinatorial search.
  • The basic operations of Boolean algebra are conjunction, disjunction, and negation.
• ​Relational Search:
  • This type of search involves using relational operators like >= (greater than or equal to) and <= (less than or equal to) to specify conditions related to numerical or date values.
  • It helps retrieve documents where certain values meet specified criteria.
  • Relational operators compare one expression to another within the context of a conditional statement, such as an if or while statement.
• Positional Search:
  • This type of search considers the relative positions of words within a document.
  • Operators like NEAR or ADJ (adjacent) are used to find documents where specified terms are located close to each other.
• Truncation Search:
  • ​Truncation involves using symbols like $, ?, or * to represent variations of a word.
  • These symbols allow for retrieving documents where words have different endings or spellings but share a common root.
  • Truncation, also called stemming, is a technique that broadens your search to include various word endings and spellings.
  • Truncation symbols may vary by database; common symbols include: *, !, ?, or #

The Correct answer is A-2, B-3, C-4, D-1.

Key Points

• STAIRS:
  • In 1985, Blair and Maron conducted a significant experiment, known as the STAIRS (Storage and Information Retrieval System) Study, to evaluate the retrieval effectiveness of a full-text search and retrieval system.
  • The study focused on a database comprising almost 40,000 documents, equivalent to approximately 350,000 pages of hard copy text, utilized in the defense of a corporate lawsuit.
  • Precision in the STAIRS Project was computed by dividing the total number of 'vital,' 'satisfactory,' and 'marginally relevant' documents by the overall number of retrieved documents.
  • To calculate recall, a sampling technique was employed, involving random samples evaluated by lawyers to estimate the total number of relevant documents in these subsets.
• SMART:
  • The SMART (System for the Mechanical Analysis and Retrieval of Text) Information Retrieval System, developed at Cornell University in the 1960s, played a pivotal role in shaping information retrieval concepts.
  • Gerard Salton, along with contributors like Mike Lesk, led the development of SMART.
  • Notable contributions stemming from SMART research include the vector space model, relevance feedback, and Rocchio classification.
  • The SMART system introduced a notable legacy element known as the "SMART triple notation." 
• ​CRANFIELD:
  • ​The initial comprehensive assessment of information retrieval systems occurred at Cranfield, UK, led by C. W. Cleverdon, known as the Cranfield 1 project.
  • Commencing in 1957, the first Cranfield Study, reported by Cleverdon in 1962, aimed to compare the effectiveness of four indexing systems:
    • An alphabetical subject catalog based on a subject heading list.
    • A UDC classified catalog with alphabetical chain index to the class headings constructed.
    • A catalog based on a faceted classification and an alphabetical index to the class headings.
    • A catalog compiled by the uni term coordinate index.
• TREC:
  • ​TREC, or the Text Retrieval Conference, originated in 1991 with funding from the US Defense Advanced Research Projects Agency (DARPA).
  • The National Institute of Science and Technology (NIST) was tasked with running TREC to facilitate the scaling up of information retrieval research from small data collections to larger experiments.
  • The main objectives of TREC include:
    • Promoting retrieval research based on extensive test collections.
    • Enhancing communication between industry, academia, and government.
    • Accelerating the transfer of technology from research labs to commercial products.
    • Increasing the availability of evaluation techniques for use by industry and academia.
  • TREC conducts an annual workshop series dedicated to developing the necessary infrastructure for extracting relevant information from large volumes of electronic documents.
  • The first TREC Conference took place in 1992, and research on improving text-retrieval methodologies has been ongoing since then.
  • The document collection used in TREC is known as the TIPSTER collection, reflecting a diverse range of subject matter, word choice, literary styles, formats, etc.
  • The primary TIPSTER collection contains gigabytes of data with over a million documents.