Examples of org.apache.lucene.search.Similarity

org.apache.lucene.search.Similarity

tanford.edu/IR-book/html/htmledition/queries-as-vectors-1.html"> Introduction To Information Retrieval, Chapter 6.

The following describes how Lucene scoring evolves from underlying information retrieval models to (efficient) implementation. We first brief on VSM Score, then derive from it Lucene's Conceptual Scoring Formula, from which, finally, evolves Lucene's Practical Scoring Function (the latter is connected directly with Lucene classes and methods).

Lucene combines Boolean model (BM) of Information Retrieval with Vector Space Model (VSM) of Information Retrieval - documents "approved" by BM are scored by VSM.

In VSM, documents and queries are represented as weighted vectors in a multi-dimensional space, where each distinct index term is a dimension, and weights are Tf-idf values.

VSM does not require weights to be Tf-idf values, but Tf-idf values are believed to produce search results of high quality, and so Lucene is using Tf-idf. Tf and Idf are described in more detail below, but for now, for completion, let's just say that for given term t and document (or query) x, Tf(t,x) varies with the number of occurrences of term t in x (when one increases so does the other) and idf(t) similarly varies with the inverse of the number of index documents containing term t.

VSM score of document d for query q is the Cosine Similarity of the weighted query vectors V(q) and V(d):

cosine-similarity(q,d) =

V(q) · V(d)

–––––––––

|V(q)| |V(d)|

VSM Score

Where V(q) · V(d) is the dot product of the weighted vectors, and |V(q)| and |V(d)| are their Euclidean norms.

Note: the above equation can be viewed as the dot product of the normalized weighted vectors, in the sense that dividing V(q) by its euclidean norm is normalizing it to a unit vector.

Lucene refines VSM score for both search quality and usability:

Normalizing V(d) to the unit vector is known to be problematic in that it removes all document length information. For some documents removing this info is probably ok, e.g. a document made by duplicating a certain paragraph 10 times, especially if that paragraph is made of distinct terms. But for a document which contains no duplicated paragraphs, this might be wrong. To avoid this problem, a different document length normalization factor is used, which normalizes to a vector equal to or larger than the unit vector: doc-len-norm(d).
At indexing, users can specify that certain documents are more important than others, by assigning a document boost. For this, the score of each document is also multiplied by its boost value doc-boost(d).
Lucene is field based, hence each query term applies to a single field, document length normalization is by the length of the certain field, and in addition to document boost there are also document fields boosts.
The same field can be added to a document during indexing several times, and so the boost of that field is the multiplication of the boosts of the separate additions (or parts) of that field within the document.
At search time users can specify boosts to each query, sub-query, and each query term, hence the contribution of a query term to the score of a document is multiplied by the boost of that query term query-boost(q).
A document may match a multi term query without containing all the terms of that query (this is correct for some of the queries), and users can further reward documents matching more query terms through a coordination factor, which is usually larger when more terms are matched: coord-factor(q,d).

Under the simplifying assumption of a single field in the index, we get Lucene's Conceptual scoring formula:

score(q,d) = coord-factor(q,d) · query-boost(q) ·

V(q) · V(d)

–––––––––

|V(q)|

· doc-len-norm(d) · doc-boost(d)

Lucene Conceptual Scoring Formula

The conceptual formula is a simplification in the sense that (1) terms and documents are fielded and (2) boosts are usually per query term rather than per query.

We now describe how Lucene implements this conceptual scoring formula, and derive from it Lucene's Practical Scoring Function.

For efficient score computation some scoring components are computed and aggregated in advance:

Query-boost for the query (actually for each query term) is known when search starts.
Query Euclidean norm |V(q)| can be computed when search starts, as it is independent of the document being scored. From search optimization perspective, it is a valid question why bother to normalize the query at all, because all scored documents will be multiplied by the same |V(q)|, and hence documents ranks (their order by score) will not be affected by this normalization. There are two good reasons to keep this normalization:
- Recall that Cosine Similarity can be used find how similar two documents are. One can use Lucene for e.g. clustering, and use a document as a query to compute its similarity to other documents. In this use case it is important that the score of document d3 for query d1 is comparable to the score of document d3 for query d2. In other words, scores of a document for two distinct queries should be comparable. There are other applications that may require this. And this is exactly what normalizing the query vector V(q) provides: comparability (to a certain extent) of two or more queries.
- Applying query normalization on the scores helps to keep the scores around the unit vector, hence preventing loss of score data because of floating point precision limitations.
Document length norm doc-len-norm(d) and document boost doc-boost(d) are known at indexing time. They are computed in advance and their multiplication is saved as a single value in the index: norm(d). (In the equations below, norm(t in d) means norm(field(t) in doc d) where field(t) is the field associated with term t.)

Lucene's Practical Scoring Function is derived from the above. The color codes demonstrate how it relates to those of the conceptual formula:

score(q,d) = coord(q,d) · queryNorm(q) ·	∑	( tf(t in d) · idf(t)² · t.getBoost() · norm(t,d) )
	t in q

Lucene Practical Scoring Function

where

tf(t in d) correlates to the term's frequency, defined as the number of times term t appears in the currently scored document d. Documents that have more occurrences of a given term receive a higher score. Note that tf(t in q) is assumed to be 1 and therefore it does not appear in this equation, However if a query contains twice the same term, there will be two term-queries with that same term and hence the computation would still be correct (although not very efficient). The default computation for tf(t in d) in {@link org.apache.lucene.search.DefaultSimilarity#tf(float) DefaultSimilarity} is:

{@link org.apache.lucene.search.DefaultSimilarity#tf(float) tf(t in d)} = frequency^½
idf(t) stands for Inverse Document Frequency. This value correlates to the inverse of docFreq (the number of documents in which the term t appears). This means rarer terms give higher contribution to the total score. idf(t) appears for t in both the query and the document, hence it is squared in the equation. The default computation for idf(t) in {@link org.apache.lucene.search.DefaultSimilarity#idf(int,int) DefaultSimilarity} is:

{@link org.apache.lucene.search.DefaultSimilarity#idf(int,int) idf(t)} = 1 + log (

numDocs

–––––––––

docFreq+1

)
coord(q,d) is a score factor based on how many of the query terms are found in the specified document. Typically, a document that contains more of the query's terms will receive a higher score than another document with fewer query terms. This is a search time factor computed in {@link #coord(int,int) coord(q,d)}by the Similarity in effect at search time.

queryNorm(q) is a normalizing factor used to make scores between queries comparable. This factor does not affect document ranking (since all ranked documents are multiplied by the same factor), but rather just attempts to make scores from different queries (or even different indexes) comparable. This is a search time factor computed by the Similarity in effect at search time. The default computation in {@link org.apache.lucene.search.DefaultSimilarity#queryNorm(float) DefaultSimilarity}produces a Euclidean norm:

queryNorm(q) = {@link org.apache.lucene.search.DefaultSimilarity#queryNorm(float) queryNorm(sumOfSquaredWeights)} =

––––––––––––––

sumOfSquaredWeights^½

The sum of squared weights (of the query terms) is computed by the query {@link org.apache.lucene.search.Weight} object.For example, a {@link org.apache.lucene.search.BooleanQuery boolean query}computes this value as:

{@link org.apache.lucene.search.Weight#sumOfSquaredWeights() sumOfSquaredWeights} = {@link org.apache.lucene.search.Query#getBoost() q.getBoost()} ² ·	∑	( idf(t) · t.getBoost() ) ²
	t in q

t.getBoost() is a search time boost of term t in the query q as specified in the query text (see query syntax), or as set by application calls to {@link org.apache.lucene.search.Query#setBoost(float) setBoost()}. Notice that there is really no direct API for accessing a boost of one term in a multi term query, but rather multi terms are represented in a query as multi {@link org.apache.lucene.search.TermQuery TermQuery} objects,and so the boost of a term in the query is accessible by calling the sub-query {@link org.apache.lucene.search.Query#getBoost() getBoost()}.

norm(t,d) encapsulates a few (indexing time) boost and length factors:

Document boost - set by calling {@link org.apache.lucene.document.Document#setBoost(float) doc.setBoost()}before adding the document to the index.
Field boost - set by calling {@link org.apache.lucene.document.Fieldable#setBoost(float) field.setBoost()}before adding the field to a document.
{@link #lengthNorm(String,int) lengthNorm(field)} - computedwhen the document is added to the index in accordance with the number of tokens of this field in the document, so that shorter fields contribute more to the score. LengthNorm is computed by the Similarity class in effect at indexing.

When a document is added to the index, all the above factors are multiplied. If the document has multiple fields with the same name, all their boosts are multiplied together:

norm(t,d) = {@link org.apache.lucene.document.Document#getBoost() doc.getBoost()} · {@link #lengthNorm(String,int) lengthNorm(field)} ·	∏	{@link org.apache.lucene.document.Fieldable#getBoost() f.getBoost}()
	field f in d named as t

However the resulted norm value is {@link #encodeNorm(float) encoded} as a single bytebefore being stored. At search time, the norm byte value is read from the index {@link org.apache.lucene.store.Directory directory} and{@link #decodeNorm(byte) decoded} back to a float norm value.This encoding/decoding, while reducing index size, comes with the price of precision loss - it is not guaranteed that decode(encode(x)) = x. For instance, decode(encode(0.89)) = 0.75.

Compression of norm values to a single byte saves memory at search time, because once a field is referenced at search time, its norms - for all documents - are maintained in memory.

The rationale supporting such lossy compression of norm values is that given the difficulty (and inaccuracy) of users to express their true information need by a query, only big differences matter.

Last, note that search time is too late to modify this norm part of scoring, e.g. by using a different {@link Similarity} for search.

@see #setDefault(Similarity) @see org.apache.lucene.index.IndexWriter#setSimilarity(Similarity) @see Searcher#setSimilarity(Similarity)

    // Initialize similarity
    if ( similarityClass == null ) {
      return Similarity.getDefault();
    }
    else {
      Similarity defaultSimilarity;
      try {
        defaultSimilarity = (Similarity) similarityClass.newInstance();
      } catch (ClassCastException e) {
        throw new SearchException("Lucene similarity does not extend " + Similarity.class.getName() + ": "
            + similarityClassName, e);

View Full Code Here

   */
  private IndexSearcher buildSearcher(SearchFactoryImplementor searchFactoryImplementor) {
    Map<Class<?>, DocumentBuilder<?>> builders = searchFactoryImplementor.getDocumentBuilders();
    List<DirectoryProvider> directories = new ArrayList<DirectoryProvider>();


    Similarity searcherSimilarity = null;
    //TODO check if caching this work for the last n list of classes makes a perf boost
    if ( classes == null || classes.length == 0 ) {
      // empty classes array means search over all indexed enities,
      // but we have to make sure there is at least one
      if ( builders.isEmpty() ) {

View Full Code Here

    batchBackend.initialize( batchBackendConfiguration, progressMonitor, this );
    return batchBackend;
  }


  public Similarity getSimilarity(DirectoryProvider<?> provider) {
    Similarity similarity = dirProviderData.get( provider ).getSimilarity();
    if ( similarity == null ) {
      throw new SearchException( "Assertion error: a similarity should be defined for each provider" );
    }
    return similarity;
  }

View Full Code Here

  private IndexSearcher buildSearcher(SearchFactoryImplementor searchFactoryImplementor) {
    Map<Class<?>, DocumentBuilderIndexedEntity<?>> builders = searchFactoryImplementor.getDocumentBuildersIndexedEntities();
    List<DirectoryProvider> targetedDirectories = new ArrayList<DirectoryProvider>();
    Set<String> idFieldNames = new HashSet<String>();


    Similarity searcherSimilarity = null;
    //TODO check if caching this work for the last n list of indexedTargetedEntities makes a perf boost
    if ( indexedTargetedEntities.size() == 0 ) {
      // empty indexedTargetedEntities array means search over all indexed enities,
      // but we have to make sure there is at least one
      if ( builders.isEmpty() ) {

View Full Code Here


  private void fillSimilarityMapping() {
    for ( DirectoryProviderData directoryConfiguration : dirProviderData.values() ) {
      for ( Class<?> indexedType : directoryConfiguration.getClasses() ) {
        DocumentBuilderIndexedEntity<?> documentBuilder = documentBuildersIndexedEntities.get( indexedType );
        Similarity similarity = documentBuilder.getSimilarity();
        Similarity prevSimilarity = directoryConfiguration.getSimilarity();
        if ( prevSimilarity != null && !prevSimilarity.getClass().equals( similarity.getClass() ) ) {
          throw new SearchException(
              "Multiple entities are sharing the same index but are declaring an " +
                  "inconsistent Similarity. When overrriding default Similarity make sure that all types sharing a same index " +
                  "declare the same Similarity implementation."
          );

View Full Code Here

    public ReentrantLock getDirectoryProviderLock(DirectoryProvider<?> dp) {
      return SearchFactoryBuilder.this.dirProviderData.get( dp ).getDirLock();
    }


    public Similarity getSimilarity(DirectoryProvider<?> provider) {
      Similarity similarity = dirProviderData.get( provider ).getSimilarity();
      if ( similarity == null ) {
        throw new SearchException( "Assertion error: a similarity should be defined for each provider" );
      }
      return similarity;
    }

View Full Code Here

   * @param cfg the search configuration.
   * @return returns the default similarity class.
   */
  private Similarity initSimilarity(SearchConfiguration cfg) {
    String similarityClassName = cfg.getProperty(Environment.SIMILARITY_CLASS);
    Similarity defaultSimilarity;
    if ( StringHelper.isEmpty( similarityClassName ) ) {
      defaultSimilarity =  Similarity.getDefault();
    }
    else {
      defaultSimilarity = PluginLoader.instanceFromName(
          Similarity.class, similarityClassName, ConfigContext.class, "default similarity" );
    }
    log.debug( "Using default similarity implementation: {}", defaultSimilarity.getClass().getName() );    
    return defaultSimilarity;
  }

View Full Code Here

    writer.setMergeFactor(indexConf.getMergeFactor());
    String similarityName = indexConf.getSimilarityName();
    if (similarityName != null) {
      try {
        Class<?> similarityClass = Class.forName(similarityName);
        Similarity similarity = (Similarity) similarityClass.newInstance();
        writer.setSimilarity(similarity);
      } catch (Exception e) {
        throw new IOException("Error in creating a similarty object "
            + similarityName);
      }

View Full Code Here

  private IndexSearcherWithPayload buildSearcher(SearchFactoryImplementor searchFactoryImplementor, Boolean forceScoring) {
    Map<Class<?>, EntityIndexBinding> builders = searchFactoryImplementor.getIndexBindings();
    List<IndexManager> targetedIndexes = new ArrayList<IndexManager>();
    Set<String> idFieldNames = new HashSet<String>();


    Similarity searcherSimilarity = null;
    //TODO check if caching this work for the last n list of indexedTargetedEntities makes a perf boost
    if ( indexedTargetedEntities.size() == 0 ) {
      // empty indexedTargetedEntities array means search over all indexed entities,
      // but we have to make sure there is at least one
      if ( builders.isEmpty() ) {

View Full Code Here

    //TODO cleanup: this logic to select the Similarity is too complex, should likely be done in a previous phase
    final Map<Class<?>, EntityIndexBinding> documentBuildersIndexedEntities = factoryState.getIndexBindings();
    for ( Entry<Class<?>, EntityIndexBinding> entry : documentBuildersIndexedEntities.entrySet() ) {
      Class<?> clazz = entry.getKey();
      EntityIndexBinding entityIndexBinding = entry.getValue();
      Similarity entitySimilarity = entityIndexBinding.getSimilarity();
      if ( entitySimilarity == null ) {
        //might have been read from annotations, fill the missing information in the EntityIndexBinder:
        entitySimilarity = entityIndexBinding.getDocumentBuilder().getSimilarity();
        if ( entitySimilarity != null ) {
          MutableEntityIndexBinding<?> newMapping = buildTypeSafeMutableEntityBinder(
              entityIndexBinding,
              entitySimilarity
          );
          entityIndexBinding = newMapping;
          documentBuildersIndexedEntities.put( clazz, entityIndexBinding );
        }
      }
      IndexManager[] indexManagers = entityIndexBinding.getIndexManagers();
      for ( IndexManager indexManager : indexManagers ) {
        Similarity indexSimilarity = indexManager.getSimilarity();
        if ( entitySimilarity != null && indexSimilarity == null ) {
          indexManager.setSimilarity( entitySimilarity );
        }
        else if ( entitySimilarity != null && ! entitySimilarity.getClass().equals( indexSimilarity.getClass() ) ) {
          throw new SearchException(
              "Multiple entities are sharing the same index but are declaring an " +
                  "inconsistent Similarity. When overriding default Similarity make sure that all types sharing a same index " +
                  "declare the same Similarity implementation."
          );

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.apache.lucene.search.Similarity

cc.twittertools.corpus.demo.IndexStatuses

com.greplin.lucene.query.ConstantQueryNormBoostingQuery

com.greplin.lucene.query.PredicateQuery

com.senseidb.conf.SenseiServerBuilder

edu.ucla.sspace.lra.LatentRelationalAnalysis

it.unibz.instasearch.indexing.SearchResultDoc

org.apache.hadoop.hbase.mapred.IndexOutputFormat

org.apache.hadoop.hbase.mapreduce.IndexOutputFormat

org.apache.lucene.index.DocHelper

org.apache.lucene.index.FieldNormModifier

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.