Package org.apache.lucene.search

Examples of org.apache.lucene.search.DefaultSimilarity

277
278
279
280
281
282
283
   /**
    * Constructor requiring an IndexReader.
    */
   public MoreLikeThis(IndexReader ir)
   {
      this(ir, new DefaultSimilarity());
   }
View Full Code Here
275
276
277
278
279
280
281
    /**
     * Constructor requiring an IndexReader.
     */
    public MoreLikeThis(IndexReader ir) {
        this(ir, new DefaultSimilarity());
    }
View Full Code Here
278
279
280
281
282
283
284
   /**
    * Constructor requiring an IndexReader.
    */
   public MoreLikeThis(IndexReader ir)
   {
      this(ir, new DefaultSimilarity());
   }
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
      @Override
      public Similarity getSimilarity(final Searcher searcher) {
        final Similarity base = searcher.getSimilarity();

        return new DefaultSimilarity() {

          @Override
          public float queryNorm(final float sumOfSquaredWeights) {
            return base.queryNorm(sumOfSquaredWeights);
          }
View Full Code Here
399
400
401
402
403
404
405
406
407
408
409
  public void testSpanScorerZeroSloppyFreq() throws Exception {
    boolean ordered = true;
    int slop = 1;

    final Similarity sim = new DefaultSimilarity() {
      @Override
      public float sloppyFreq(int distance) {
        return 0.0f;
      }
    };
View Full Code Here
391
392
393
394
395
396
397
398
399
400
401
  public void testSpanScorerZeroSloppyFreq() throws Exception {
    boolean ordered = true;
    int slop = 1;

    final Similarity sim = new DefaultSimilarity() {
      @Override
      public float sloppyFreq(int distance) {
        return 0.0f;
      }
    };
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
    public Query rewrite(IndexReader reader) throws IOException {
      BooleanQuery result = new BooleanQuery() {

        @Override
        public Similarity getSimilarity(Searcher searcher) {
          return new DefaultSimilarity() {

            @Override
            public float coord(int overlap, int max) {
              switch (overlap) {
View Full Code Here
325
326
327
328
329
330
331
    /**
     * Constructor requiring an IndexReader.
     */
    public MoreLikeThis(IndexReader ir) {
        this(ir, new DefaultSimilarity());
    }
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
  public void testSweetSpotComputeNorm() {
 
    SweetSpotSimilarity ss = new SweetSpotSimilarity();
    ss.setLengthNormFactors(1,1,0.5f);

    Similarity d = new DefaultSimilarity();
    Similarity s = ss;


    // base case, should degrade
    final FieldInvertState invertState = new FieldInvertState();
    invertState.setBoost(1.0f);
    for (int i = 1; i < 1000; i++) {
      invertState.setLength(i);
      assertEquals("base case: i="+i,
                   d.computeNorm("foo", invertState),
                   s.computeNorm("foo", invertState),
                   0.0f);
    }

    // make a sweet spot
 
    ss.setLengthNormFactors(3,10,0.5f);
 
    for (int i = 3; i <=10; i++) {
      invertState.setLength(i);
      assertEquals("3,10: spot i="+i,
                   1.0f,
                   s.computeNorm("foo", invertState),
                   0.0f);
    }
 
    for (int i = 10; i < 1000; i++) {
      invertState.setLength(i-9);
      final float normD = d.computeNorm("foo", invertState);
      invertState.setLength(i);
      final float normS = s.computeNorm("foo", invertState);
      assertEquals("3,10: 10<x : i="+i,
                   normD,
                   normS,
                   0.0f);
    }


    // seperate sweet spot for certain fields

    ss.setLengthNormFactors("bar",8,13, 0.5f, false);
    ss.setLengthNormFactors("yak",6,9, 0.5f, false);

 
    for (int i = 3; i <=10; i++) {
      invertState.setLength(i);
      assertEquals("f: 3,10: spot i="+i,
                   1.0f,
                   s.computeNorm("foo", invertState),
                   0.0f);
    }
    for (int i = 10; i < 1000; i++) {
      invertState.setLength(i-9);
      final float normD = d.computeNorm("foo", invertState);
      invertState.setLength(i);
      final float normS = s.computeNorm("foo", invertState);
      assertEquals("f: 3,10: 10<x : i="+i,
                   normD,
                   normS,
                   0.0f);
    }
    for (int i = 8; i <=13; i++) {
      invertState.setLength(i);
      assertEquals("f: 8,13: spot i="+i,
                   1.0f,
                   s.computeNorm("bar", invertState),
                   0.0f);
    }
    for (int i = 6; i <=9; i++) {
      invertState.setLength(i);
      assertEquals("f: 6,9: spot i="+i,
                   1.0f,
                   s.computeNorm("yak", invertState),
                   0.0f);
    }
    for (int i = 13; i < 1000; i++) {
      invertState.setLength(i-12);
      final float normD = d.computeNorm("foo", invertState);
      invertState.setLength(i);
      final float normS = s.computeNorm("bar", invertState);
      assertEquals("f: 8,13: 13<x : i="+i,
                   normD,
                   normS,
                   0.0f);
    }
    for (int i = 9; i < 1000; i++) {
      invertState.setLength(i-8);
      final float normD = d.computeNorm("foo", invertState);
      invertState.setLength(i);
      final float normS = s.computeNorm("yak", invertState);
      assertEquals("f: 6,9: 9<x : i="+i,
                   normD,
                   normS,
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
  public void testSweetSpotTf() {
 
    SweetSpotSimilarity ss = new SweetSpotSimilarity();

    Similarity d = new DefaultSimilarity();
    Similarity s = ss;
   
    // tf equal

    ss.setBaselineTfFactors(0.0f, 0.0f);
 
    for (int i = 1; i < 1000; i++) {
      assertEquals("tf: i="+i,
                   d.tf(i), s.tf(i), 0.0f);
    }

    // tf higher
 
    ss.setBaselineTfFactors(1.0f, 0.0f);
 
    for (int i = 1; i < 1000; i++) {
      assertTrue("tf: i="+i+" : d="+d.tf(i)+
                 " < s="+s.tf(i),
                 d.tf(i) < s.tf(i));
    }

    // tf flat
 
    ss.setBaselineTfFactors(1.0f, 6.0f);
    for (int i = 1; i <=6; i++) {
      assertEquals("tf flat1: i="+i, 1.0f, s.tf(i), 0.0f);
    }
    ss.setBaselineTfFactors(2.0f, 6.0f);
    for (int i = 1; i <=6; i++) {
      assertEquals("tf flat2: i="+i, 2.0f, s.tf(i), 0.0f);
    }
    for (int i = 6; i <=1000; i++) {
      assertTrue("tf: i="+i+" : s="+s.tf(i)+
                 " < d="+d.tf(i),
                 s.tf(i) < d.tf(i));
    }

    // stupidity
    assertEquals("tf zero", 0.0f, s.tf(0), 0.0f);
  }
View Full Code Here
TOP

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

  • com.greplin.lucene.query.ConstantQueryNormBoostingQuery
  • com.senseidb.conf.SenseiServerBuilder
  • net.sf.katta.lib.lucene.LuceneServer
  • org.apache.jackrabbit.core.query.lucene.MoreLikeThis
  • org.apache.lucene.index.pruning.CarmelTopKTermPruningPolicy
  • org.apache.lucene.index.pruning.CarmelUniformTermPruningPolicy
  • org.apache.lucene.index.TestIndexReaderOnDiskFull
  • org.apache.lucene.misc.SweetSpotSimilarityTest
  • org.apache.lucene.misc.TestLengthNormModifier
  • org.apache.lucene.pruning.CarmelTermPruningPolicy
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.