CSC 379 SUM2008:Week 2, Group 3: Difference between revisions

From Expertiza_Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 9: Line 9:


==Function==
==Function==
A search engine is an information retrieval system that match queries with an index it creates. Search engines consist of four essential modules:
:* Document Processor - this prepares, processes, and inputs the documents, pages, or sites that users search against.
:* Query processor - this consist of seven possible steps
:**Tokenizing usually by breaking inputs into strings separated by white space.
:**Parsing operators like reserved punctuation or reserved terms in specialized format (e.g., AND, OR). This may also include boolean, adjacency, or proximity operators.
:**Stop list and stemming might contain words from commonly occurring querying phrases. Engines may drop these two steps.
:**Creating the query depends on the method used to do the matching.
:**Query expansion employs synonyms to optimize the search results.
:**Query term weighting is used to judge the importance of each term in the query.
:* Search and matching function - this is based on which theoretical model of information retrieval underlies the system's design philosophy.
:* Ranking capability - this is done many ways
:**Term frequency
:**Location of terms
:**Link analysis
:**Popularity
:**Date of Publication
:**Length
:**Proximity of query terms
:**Proper nouns


==History==
==History==

Revision as of 19:43, 18 July 2008

Search Engines

Search engines fill an important role in our lives, helping us locate information within a wide array of multimedia. However many ethical considerations are involved in their operation; the ordering of rankings, the range of content indexed (or not), and how advertisements are incorporated, are a few. Broadly examine the ethics of search engine operation and use.

Function

A search engine is an information retrieval system that match queries with an index it creates. Search engines consist of four essential modules:

  • Document Processor - this prepares, processes, and inputs the documents, pages, or sites that users search against.
  • Query processor - this consist of seven possible steps
    • Tokenizing usually by breaking inputs into strings separated by white space.
    • Parsing operators like reserved punctuation or reserved terms in specialized format (e.g., AND, OR). This may also include boolean, adjacency, or proximity operators.
    • Stop list and stemming might contain words from commonly occurring querying phrases. Engines may drop these two steps.
    • Creating the query depends on the method used to do the matching.
    • Query expansion employs synonyms to optimize the search results.
    • Query term weighting is used to judge the importance of each term in the query.
  • Search and matching function - this is based on which theoretical model of information retrieval underlies the system's design philosophy.
  • Ranking capability - this is done many ways
    • Term frequency
    • Location of terms
    • Link analysis
    • Popularity
    • Date of Publication
    • Length
    • Proximity of query terms
    • Proper nouns

History

Issues

Algorithms

Politics