Examples of edu.umd.cloud9.io.pair.PairOfStringFloat

edu.umd.cloud9.io.pair.PairOfStringFloat
WritableComparable representing a pair consisting of a String and a float. The elements in the pair are referred to as the left and right elements. The natural sort order is: first by the left element, and then by the right element. @author Ferhan Ture

      float sumProb2 = 0;
      for (Entry<String> entry : probDist.entrySet()) {
        float pr = entry.getValue() / sumProb;
        if (pr > lexProbThreshold) {
          sumProb2 += pr;
          sortedFilteredProbDist.add(new PairOfStringFloat(entry.getKey(), pr));
        }
      }


      // re-normalize values after removal of low-prob entries
      float cumProb = 0;
      int cnt = 0;
      while (cnt < maxNumTrans && cumProb < cumProbThreshold && !sortedFilteredProbDist.isEmpty()) {
        PairOfStringFloat entry = sortedFilteredProbDist.pollLast();
        float pr = entry.getValue() / sumProb2;
        cumProb += pr;
        normProbDist.put(entry.getKey(), pr);
        cnt++;
      }


      probMap.put(sourceTerm, normProbDist);
    }

View Full Code Here

    assertTrue(pair.getRightElement() == 1.0f);
  }


  @Test
  public void testSerialize() throws IOException {
    PairOfStringFloat origPair = new PairOfStringFloat("hi", 2.0f);


    ByteArrayOutputStream bytesOut = new ByteArrayOutputStream();
    DataOutputStream dataOut = new DataOutputStream(bytesOut);


    origPair.write(dataOut);


    PairOfStringFloat pair = new PairOfStringFloat();


    pair.readFields(new DataInputStream(new ByteArrayInputStream(bytesOut.toByteArray())));


    assertEquals("hi", pair.getLeftElement());
    assertTrue(pair.getRightElement() == 2.0f);
  }

View Full Code Here

    assertTrue(pair.getRightElement() == 2.0f);
  }


  @Test
  public void testComparison1() throws IOException {
    PairOfStringFloat pair1 = new PairOfStringFloat("hi", 1.0f);
    PairOfStringFloat pair2 = new PairOfStringFloat("hi", 1.0f);
    PairOfStringFloat pair3 = new PairOfStringFloat("hi", 0.0f);
    PairOfStringFloat pair4 = new PairOfStringFloat("a", 0.0f);
    PairOfStringFloat pair5 = new PairOfStringFloat("hi", 2.0f);
    
    assertTrue(pair1.equals(pair2));
    assertFalse(pair1.equals(pair3));


    assertTrue(pair1.compareTo(pair2) == 0);

View Full Code Here


  @Test
  public void testComparison2() throws IOException {
    WritableComparator comparator = new PairOfStringFloat.Comparator();


    PairOfStringFloat pair1 = new PairOfStringFloat("hi", 1.0f);
    PairOfStringFloat pair2 = new PairOfStringFloat("hi", 1.0f);
    PairOfStringFloat pair3 = new PairOfStringFloat("hi", 0.0f);
    PairOfStringFloat pair4 = new PairOfStringFloat("a", 0.0f);
    PairOfStringFloat pair5 = new PairOfStringFloat("hi", 2.0f);
    
    assertTrue(pair1.equals(pair2));
    assertFalse(pair1.equals(pair3));


    assertTrue(WritableComparatorTestHarness.compare(comparator, pair1, pair2) == 0);

View Full Code Here


public class PairOfStringFloatTest {


  @Test
  public void testBasic() throws IOException {
    PairOfStringFloat pair = new PairOfStringFloat("hi", 1.0f);


    assertEquals("hi", pair.getLeftElement());
    assertTrue(pair.getRightElement() == 1.0f);
  }

View Full Code Here

      float sumProb2 = 0;
      for (Entry<String> entry : probDist.entrySet()) {
        float pr = entry.getValue() / sumProb;
        if (pr > lexProbThreshold) {
          sumProb2 += pr;
          sortedFilteredProbDist.add(new PairOfStringFloat(entry.getKey(), pr));
        }
      }


      // re-normalize values after removal of low-prob entries
      float cumProb = 0;
      int cnt = 0;
      while (cnt < maxNumTrans && cumProb < cumProbThreshold && !sortedFilteredProbDist.isEmpty()) {
        PairOfStringFloat entry = sortedFilteredProbDist.pollLast();
        float pr = entry.getValue() / sumProb2;
        cumProb += pr;
        normProbDist.put(entry.getKey(), pr);
        cnt++;
      }


      probMap.put(sourceTerm, normProbDist);
    }

View Full Code Here

      float sumProb2 = 0;
      for (Entry<String> entry : probDist.entrySet()) {
        float pr = entry.getValue() / sumProb;
        if (pr > lexProbThreshold) {
          sumProb2 += pr;
          sortedFilteredProbDist.add(new PairOfStringFloat(entry.getKey(), pr));
        }
      }


      // re-normalize values after removal of low-prob entries
      float cumProb = 0;
      int cnt = 0;
      while (cnt < maxNumTrans && cumProb < cumProbThreshold && !sortedFilteredProbDist.isEmpty()) {
        PairOfStringFloat entry = sortedFilteredProbDist.pollLast();
        float pr = entry.getValue() / sumProb2;
        cumProb += pr;
        normProbDist.put(entry.getKey(), pr);
        cnt++;
      }


      probMap.put(sourceTerm, normProbDist);
    }

View Full Code Here

      float sumProb2 = 0;
      for (Entry<String> entry : probDist.entrySet()) {
        float pr = entry.getValue() / sumProb;
        if (pr > lexProbThreshold) {
          sumProb2 += pr;
          sortedFilteredProbDist.add(new PairOfStringFloat(entry.getKey(), pr));
        }
      }


      // re-normalize values after removal of low-prob entries
      float cumProb = 0;
      int cnt = 0;
      while (cnt < maxNumTrans && cumProb < cumProbThreshold && !sortedFilteredProbDist.isEmpty()) {
        PairOfStringFloat entry = sortedFilteredProbDist.pollLast();
        float pr = entry.getValue() / sumProb2;
        cumProb += pr;
        normProbDist.put(entry.getKey(), pr);
        cnt++;
      }


      probMap.put(sourceTerm, normProbDist);
    }

View Full Code Here

      float sumProb2 = 0;
      for (Entry<String> entry : probDist.entrySet()) {
        float pr = entry.getValue() / sumProb;
        if (pr > lexProbThreshold) {
          sumProb2 += pr;
          sortedFilteredProbDist.add(new PairOfStringFloat(entry.getKey(), pr));
        }
      }


      // re-normalize values after removal of low-prob entries
      float cumProb = 0;
      int cnt = 0;
      while (cnt < maxNumTrans && cumProb < cumProbThreshold && !sortedFilteredProbDist.isEmpty()) {
        PairOfStringFloat entry = sortedFilteredProbDist.pollLast();
        float pr = entry.getValue() / sumProb2;
        cumProb += pr;
        normProbDist.put(entry.getKey(), pr);
        cnt++;
      }


      probMap.put(sourceTerm, normProbDist);
    }

View Full Code Here

      float sumProb2 = 0;
      for (Entry<String> entry : probDist.entrySet()) {
        float pr = entry.getValue() / sumProb;
        if (pr > lexProbThreshold) {
          sumProb2 += pr;
          sortedFilteredProbDist.add(new PairOfStringFloat(entry.getKey(), pr));
        }
      }


      // re-normalize values after removal of low-prob entries
      float cumProb = 0;
      int cnt = 0;
      while (cnt < maxNumTrans && cumProb < cumProbThreshold && !sortedFilteredProbDist.isEmpty()) {
        PairOfStringFloat entry = sortedFilteredProbDist.pollLast();
        float pr = entry.getValue() / sumProb2;
        cumProb += pr;
        normProbDist.put(entry.getKey(), pr);
        cnt++;
      }


      probMap.put(sourceTerm, normProbDist);
    }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of edu.umd.cloud9.io.pair.PairOfStringFloat

bak.pcj.IntIterator

edu.umd.cloud9.example.bfs.BfsNodeTest

edu.umd.cloud9.example.pagerank.PageRankNodeTest

edu.umd.cloud9.io.array.ArrayListOfIntsWritable

edu.umd.cloud9.io.fastutil.Int2FloatOpenHashMapWritableTest

edu.umd.cloud9.io.fastutil.Int2IntOpenHashMapWritableTest

edu.umd.cloud9.io.fastutil.String2FloatOpenHashMapWritableTest

edu.umd.cloud9.io.fastutil.String2IntOpenHashMapWritableTest

edu.umd.cloud9.io.map.HMapIDW

edu.umd.cloud9.io.map.HMapIDWTest

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.