信息存储及检索——Boolean IR model.pptVIP

Information Storage and Retrieval 540-671 Boolean IR model Boolean logic Boolean query is a query in which the search terms (operand) are combined with the Boolean operators such as NOT, OR, AND and parentheses etc. Boolean logic [1] AND requires that both search terms in this connect be present in the retrieved document set, e.g. A AND B. A=computer, B=archive. [2] OR requires that at least one of the two search terms in this connects be present in the retrieved document set, e.g. A OR B. A=computer, B=medicine. Boolean logic [3] NOT requires that the specified search term be absent in the retrieved document set, e.g. A AND NOT B. A=computer, B=archive. [4] Combination of logic operations Boolean logic [5] Order of precedence in a Boolean operation, [5.1] Role of parentheses: expression within parentheses should be executed first. [5.2] The operator order of precedence: “NOT” “AND” “OR” [5.3] At the same level operation starts from left to right. Boolean logic [6] DeMorgan Law: NOT (A AND B) == NOT A OR NOT B NOT (A OR B) == (NOT A) AND (NOT B) Boolean logic Other laws: A AND (C OR B) == A AND C OR A AND B A AND B == B AND A A OR B == B OR A NOT(NOT A)= A Note: A, B, C can be another logic expression. Boolean Logic Please complete following questions: [1] ~(A*B+C*D) == ~(A*B)*~(C*D) == (~A+~B)*(~C+~D) == ~A*~C+~A*~D+~B*~C+~B*~D Boolean Logic Please simplify following questions: [1] A*(B+~(C*D))== [2] ~(A*~(C+D))== Process a Boolean query Why does a machine can not understand a regular Boolean query? [1]. A machine can only read a series of codes sequentially in nature [2]. A machine does not understand level relation within a Boolean query [3]. A machine does not understand logic operator precedence Processing logic expression: reverse Poland Expression Processing logic expression: reverse Poland Expression [2] Stack: stack is a list, or a storage area, data entering or exiting follows the