Package edu.cmu.sphinx.decoder.search

Examples of edu.cmu.sphinx.decoder.search.Token

288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
     * Returns the maximum relative beam for a the chain of tokens reachable from the given token
     *
     * @param result the result of interest
     */
    private void collectRelativeBeamStatistics(Result result) {
        Token token = result.getBestToken();
        int count = 0;
        double sumBeam = 0.0;

        maxRelativeBeam = -Float.MAX_VALUE;

        while (token != null) {
            if (token.isEmitting()) {
                TokenRank rank = (TokenRank) token.getTokenProps().get(TOKEN_RANK);
                if (rank != null) {
                    if (rank.getRelativeRank() > maxRelativeBeam) {
                        maxRelativeBeam = rank.getRelativeRank();
                    }
                    sumBeam += rank.getRelativeRank();
                    count++;
                } else {
                    if (token.getFrameNumber() > 0) {
                        System.out.println("Null rank! for " + token);
                    }
                }
            }
            token = token.getPredecessor();
        }

        if (count > 0) {
            avgRelativeBeam = (float) (sumBeam / count);
            if (maxRelativeBeam > totMaxRelativeBeam) {
View Full Code Here
29
30
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
      int tokenListSize, boolean tokenListLarger) {

    Random random = new Random(System.currentTimeMillis());
    Partitioner partitioner = new Partitioner();

    Token parent = new Token(null, 0);
    Token[] tokens = new Token[tokenListSize];

    for (int i = 0; i < tokens.length; i++) {
      float logTotalScore = random.nextFloat();
      tokens[i] = new Token(parent, null, logTotalScore, 0.0f, 0.0f, i);
    }

    final int r = partitioner.partition(tokens, tokens.length,
        absoluteBeamWidth);

    if (tokenListLarger) {
      Assert.assertEquals(r, absoluteBeamWidth - 1);
    } else {
      Assert.assertEquals (r, tokenListSize - 1);
    }

    List<Token> firstList = new LinkedList<Token>();
    if (r >= 0) {
      float lowestScore = tokens[r].getScore();

      for (int i = 0; i <= r; i++) {
        Assert.assertTrue(tokens[i].getScore() >= lowestScore);
        firstList.add(tokens[i]);
      }
      for (int i = r + 1; i < tokens.length; i++) {
        Assert.assertTrue(lowestScore > tokens[i].getScore());
      }

      Collections.sort(firstList, Scoreable.COMPARATOR);

      List<Token> secondList = Arrays.asList(tokens);
      Collections.sort(secondList, Scoreable.COMPARATOR);

      for (Iterator<Token> i1 = firstList.iterator(), i2 = secondList
          .iterator(); i1.hasNext() && i2.hasNext();) {
        Token t1 = i1.next();
        Token t2 = i2.next();
        Assert.assertEquals(t1, t2);
      }
    }
  }
View Full Code Here
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
    int p;
    Token[] tokens = new Token[100000];
    Partitioner partitioner = new Partitioner();

    for (int i = 0; i < 100000; i++)
      tokens[i] = new Token(null, null, 1 - i, 0, 0, 0);
    p = partitioner.partition(tokens, 100000, 3000);
    Assert.assertEquals(p, 2999);
    testSorted(tokens, p);

    for (int i = 0; i < 100000; i++)
      tokens[i] = new Token(null, null, i, 0, 0, 0);
    p = partitioner.partition(tokens, 100000, 3000);
    Assert.assertEquals(p, 2999);
    testSorted(tokens, p);

    for (int i = 0; i < 100000; i++)
      tokens[i] = new Token(null, null, 0, 0, 0, 0);
    p = partitioner.partition(tokens, 100000, 3000);
    Assert.assertEquals(p, 2999);
    testSorted(tokens, p);

    for (int i = 0; i < 100000; i++)
      tokens[i] = new Token(null, null, (float) Math.random(), 0, 0, 0);
    p = partitioner.partition(tokens, 100000, 3000);
    Assert.assertEquals(p, 2999);
    testSorted(tokens, p);
  }
View Full Code Here
TOP

Related Classes of edu.cmu.sphinx.decoder.search.Token

  • edu.cmu.sphinx.decoder.adaptation.Stats
  • edu.cmu.sphinx.decoder.scorer.BackgroundModelNormalizer
  • edu.cmu.sphinx.decoder.search.test.PartitionerTest
  • edu.cmu.sphinx.instrumentation.BeamFinder
  • edu.cmu.sphinx.instrumentation.BestPathAccuracyTracker
  • edu.cmu.sphinx.instrumentation.SausageAccuracyTracker
  • edu.cmu.sphinx.linguist.acoustic.Unit
  • edu.cmu.sphinx.linguist.dictionary.Pronunciation
  • edu.cmu.sphinx.linguist.dictionary.Word
  • edu.cmu.sphinx.linguist.SearchState
    • 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.