Document retrieval
Document retrieval is defined as the matching of some stated user query against a set of free-text records. These records could be any type of mainly unstructured text, such as newspaper articles, real estate records or paragraphs in a manual. User queries can range from multi-sentence full descriptions of an information need to a few words. Document retrieval is sometimes referred to as, or as a branch of, text retrieval. Text retrieval is a branch of information retrieval where the information is stored primarily in the form of text. Text databases became decentralized thanks to the  personal computer. Text retrieval is a critical area of study today, since it is the fundamental basis of all internet search engines. Description. Document retrieval systems find information to given criteria by matching text records ("documents") against user queries, as opposed to expert systems that answer questions by inferring over a logical knowledge database. A document retrieval system consists of a database of documents, a classification algorithm to build a full text index, and a user interface to access the database. A document retrieval system has two main tasks: Internet search engines are classical applications of document retrieval. The vast  majority of retrieval systems currently in use range from simple Boolean systems through to systems using statistical or natural language processing techniques. Variations. There are two main classes of indexing schemata for document retrieval systems: "form based" (or "word based"), and "content based" indexing. The document classification scheme (or indexing algorithm) in use determines the nature of the document retrieval system. Form based. Form based document retrieval addresses the exact syntactic properties of a text, comparable to substring matching in string searches. The text is generally unstructured and not necessarily in a natural language, the system could for example be  used to process large sets of chemical representations in molecular biology. A suffix tree algorithm is an example for form based indexing. Content based. The content based approach exploits semantic connections between documents and parts thereof, and semantic connections between queries and documents. Most content based document retrieval systems use an inverted index algorithm. A "signature file" is a technique that creates a "quick and dirty" filter, for example a Bloom filter, that will keep all the documents that match to the query and "hopefully" a few ones that do not. The way this is done is by creating for  each file a signature, typically a hash coded version. One method is superimposed coding. A post-processing step is done to discard the false alarms. Since in most cases this structure is inferior to inverted files in terms of speed, size and functionality, it is not used widely. However, with proper parameters it can beat the inverted files in certain environments. Example: PubMed. The PubMed form interface features the "related articles" search which works through a comparison of words from the documents' title, abstract, and MeSH terms using a word-weighted algorithm.