Languages of Recovery Web
Recovery and organization of the information
Languages of Recovery Web
The most important part of a finder is the language search, by means of which the user can express, or better worse, its necessity of information, to establish diverse filters or conditions, to limit the number of answers, to review the question, to sail by the list of results, etc.
A finder can be very exhaustive and to have thus or located 90% or more of documents published in the Network, but the data base keeps little information with respect to those documents or the recovery language is little flexible, the set as a whole provides a low yield. Like in a chain of audio, the final quality will be the one of the worse one of the components.
For example, one of servants more exhaustive, Lycos, is at the same time the one that worse language of recovery provides, whereas one of that less documents review, WebCrawler, is the one that one of the most flexible languages has, which, against this background, is equivalent to being one of most powerful.
Really, a recovery language is a command set, operators and structures that, organized according to norms logics, allow the consultation of resources of electronic intelligence.
Elements of an equation
After keywords, the equations are formed by operators, who will define the existing relation between the introduced words search.
- Boolean operators (OR/AND/NOT)
Operator AND forces the finder to find results that contain the two words to which it affects.
Operator OR accepts all the possibilities that tegan at least one of the two words.
Operator NOT excludes those results from the search that contain the word to which it makes reference.
- Positional operators
The use of positional operators tries to surpass some of the limitations that offer the Boolean operators. They take like departure point the consideration from the value from the term within the context, that is to say, that the position of that term in relation to others, or within the own registry, is significant to value its pertinencia to the looked for objectives. The positional operators can divide themselves in two types:
- Positional absolute
They are those that allow to look for a term in a given place of the document or registry. As a rule, they are field operators, that is to say, they allow the user to fix to which present field or fields in the structure of data base must appear the looked for term. The presence of the term in a given field (for example, in the field title), can be a guarantee of the adjustment of the document to the objectives, in most of the situations.
- Positional relative
Also proximity calls, are operators who allow to settle down the position of a term with respect to another dice. It is considered that the proximity between both terms can reflect an intimate relation between the concepts reflected by such. These operators allow to define the level of proximity between the terms (same field, line, phrase, number of significant terms that he separates them…).
- Positional absolute
- Operators of comparison.
They specify the rank search, fixing limits for the same one. These limits can as much be numerical as alphabetical, corresponding the operators to forms of the type “greater thanâ€, “minor or just asâ€. They are used mainly in documents that can contain numeric data.
- Operators of truncamiento.
Situations can occur in which it is necessary to use not a simple term, but also its derivatives, fixed by prefixation or sufijación, lexical variant minims, etc. In order to facilitate the search of this type truncamiento operators have introduced themselves, to which also he is called masks. One is operators (normally symbols like *, $), whose presence can replace a character or a set of characters, located to the left, inside or to the right of the term at issue.
English Spanish
![[Valid RSS]](valid-rss.png "Validate my RSS feed")
