A note about the proximity operators in information retrieval

Mitchell, Patrick C.

doi:10.1145/951787.951778

Cited by 2 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many, if not all commercial systems based on the boolean model propose an extension of the basic model with proximity operators, typically the NEAR operator. But there are two main problems with such operators, the first one is that the semantics of these operators is not clean and it leads to some inconsistency problems [8]. The second one is that they are stuck to boolan retrieval: documents verify or not the query and there is no ranking.…”

Section: Proximity Usage In Irmentioning

confidence: 99%

Focused retrieval with proximity scoring

Beigbeder

2010

Proceedings of the 2010 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

International audienceWe present in this paper a scoring method for information retrieval based on the proximity of the query terms in the documents. The idea of the method first is to assign to each position in the document a fuzzy proximity value depending on its closeness to the surrounding keywords. These proximity values can then be summed on any range of text -- including any passage or any element -- and after normalization this sum is used as the relevance score for the extent. Some experiments on the Wikipedia collection used in the INEX 2008 evaluation campaign are presented and discussed

show abstract

Section: Proximity Usage In Irmentioning

confidence: 99%

Focused retrieval with proximity scoring

Beigbeder

2010

Proceedings of the 2010 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…Atomic predicates do not contain the OR operator-all the other operators can distribute over OR [Mitchell 1973] (see Figure 2), so it can be "pulled out" from predicates. For example,…”

Section: Atomic Predicatesmentioning

confidence: 99%

“…However, atomic Contains-predicates may contain the AND operator (in addition to the proximity operators), since the proximity operators do not distribute over AND [Mitchell 1973], e.g., (A AND B) (nW) C (A (nW) C) AND (B (nW) C). In contrast, notice that in an atomic Equals-predicate the phrase pattern is simply a single phrase, either exact or expanded.…”

Section: Atomic Predicatesmentioning

confidence: 99%

Predicate rewriting for translating Boolean queries in a heterogeneous information system

Chang

García-Molina

Paepcke

1999

ACM Trans. Inf. Syst.

View full text Add to dashboard Cite

Searching over heterogeneous information sources is difficult in part because of the nonuniform query languages. Our approach is to allow users to compose Boolean queries in one rich front-end language. For each user query and target source, we transform the user query into a subsuming query that can be supported by the source but that may return extra documents. The results are then processed by a filter query to yield the correct final results. In this article we introduce the architecture and associated mechanism for query translation. In particular, we discuss techniques for rewriting predicates in Boolean queries into native subsuming forms, which is a basis of translating complex queries. In addition, we present experimental results for evaluating the cost of postfiltering. We also discuss the drawbacks of this approach and cases when it may not be effective. We have implemented prototype versions of these mechanisms and demonstrated them on heterogeneous Boolean systems.

show abstract

A note about the proximity operators in information retrieval

Cited by 2 publications

References 2 publications

Focused retrieval with proximity scoring

Focused retrieval with proximity scoring

Predicate rewriting for translating Boolean queries in a heterogeneous information system

Contact Info

Product

Resources

About