Package com.googlecode.gaal.suffix.api.IntervalTree

Examples of com.googlecode.gaal.suffix.api.IntervalTree.Interval

291
292
293
294
295
296
297
298
299
300
301
    }

    private static Map<Integer, Integer> mapRepeats(Corpus<String> corpus, List<Interval> intervals, List<String> labels) {
        Map<Integer, Integer> repeatsMap = new HashMap<Integer, Integer>();
        for (int i = 0; i < intervals.size(); i++) {
            Interval interval = intervals.get(i);
            String label = toString(interval, corpus);
            int index = labels.indexOf(label);
            if (index != -1) {
                mapInterval(interval, null, repeatsMap, index);
            }
View Full Code Here
28
29
30
31
32
33
34
35
36
37
38
39
        while (iterator.hasNext())
            children.add(iterator.next());
        int n = children.size();

        for (int i = 1; i < n; i++) {
            Interval child = children.get(i);
            int lb = child.left();
            result[lb] = esa.getLcpTable()[lb] * esa.alphabetSize() + depth(i + 1, n);
        }
        for (Node child : children) {
            traverseDepths(child, result, esa);
        }
View Full Code Here
168
169
170
171
172
173
174
175
176
177
178
179
        Filter<EmbeddedInterval> contextFilter = new SimpleContextFilter(0.5, 1);
        Iterable<EmbeddedInterval> contextExtractor = new EmbeddedContextExtractor(lst, corpus, intervalSetBuilder,
                contextFilter, windowSize);
        for (EmbeddedInterval embeddedInterval : contextExtractor) {
            Context context = new EmbeddedContext(embeddedInterval);
            Interval interval = embeddedInterval.getEmbeddingInterval();
            double leftRightContextRatio = (double) embeddedInterval.size() / interval.size();
            System.out.printf("%s %s %s\n", corpus.toString(context.leftSequence(), delimiter),
                    corpus.toString(embeddedInterval.fillerIterator(), delimiter),
                    corpus.toString(context.rightSequence(), delimiter));
            System.out.printf("ratio:%.2f\n", leftRightContextRatio);
        }
View Full Code Here
190
191
192
193
194
195
196
197
198
            IntervalSetBuilder intervalSetBuilder, Filter<EmbeddedInterval> contextFilter, int windowSize, int depth,
            int maxDepth) {
        Iterator<Interval> intervalIterator = new RecursiveIntervalExtractor(lst, corpus, intervalSetBuilder,
                contextFilter, windowSize).iterator(depth, maxDepth);
        while (intervalIterator.hasNext()) {
            Interval interval = intervalIterator.next();
            System.out.println(toString(interval, corpus, false));
        }
    }
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
            return intervalContextIterator.next();
        }

        private void startThreads() {
            while (threads.activeCount() < MAX_THREADS && iterator.hasNext()) {
                final Interval interval = iterator.next();
                new Thread(threads, new Runnable() {
                    @Override
                    public void run() {
                        queue.add(intervalContextExtractor.iterator(interval));
                    }
View Full Code Here
16
17
18
19
20
21
22
23
24
25
26
27
        this.minNonEmptyFillerCount = minNonEmptyFillerCount;
    }

    @Override
    public boolean passed(EmbeddedInterval embeddedInterval) {
        Interval interval = embeddedInterval.getEmbeddingInterval();
        double leftRightContextRatio = (double) embeddedInterval.size() / interval.size();
        int nonEmptyFillerCount = 0;
        int prevPrefix = -1;
        boolean hasCommonPrefix = true; // all the fillers share a common
                                        // prefix
        int prevSuffix = -1;
View Full Code Here
54
55
56
57
58
59
60
61
62
        @Override
        public Interval next() {
            if (next == null)
                throw new NoSuchElementException();
            Interval context = next;
            next = advance();
            return context;
        }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
        }

        private Interval advance() {
            while (true) {
                if (iterator.hasNext()) {
                    Interval interval = iterator.next();
                    if (maxDepth == -1 || stack.size() < maxDepth) {
                        stack.push(iterator);
                        iterator = intervalExtractor.iterator(interval);
                    }
                    if (depth == -1 || (stack.size() == depth + 1)) {
View Full Code Here
79
80
81
82
83
84
85
86
87
88
        assertArrayEquals(pNewChildTable, lpt.getChildTable());
    }

    @Test
    public void testGetTop() {
        Interval top = lst.top();
        assertTrue(top.left() == 0);
        assertTrue(top.right() == text.length - 1);
        assertTrue(top.lcp() == 0);
    }
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
    @Test
    public void testTraversePreOrder() {
        Iterator<BinaryInterval> iterator = lst.preorderIterator();
        int i = 0;
        while (iterator.hasNext()) {
            Interval node = iterator.next();
            IntervalImpl ref = preOrder[i++];
            if (!ref.equals(node)) {
                System.err.println(ref + " != " + node);
                fail("node mismatch");
            } else {
View Full Code Here
TOP

Related Classes of com.googlecode.gaal.suffix.api.IntervalTree.Interval

  • com.googlecode.gaal.analysis.impl.Analyser
  • com.googlecode.gaal.analysis.impl.ConcurrentEmbeddedContextExtractor$ContextIterator
  • com.googlecode.gaal.analysis.impl.ContextExtractorTest
  • com.googlecode.gaal.analysis.impl.RecursiveIntervalExtractor$RecursiveIntervalIterator
  • com.googlecode.gaal.analysis.impl.SimpleContextFilter
  • com.googlecode.gaal.suffix.algorithm.impl.ExtendedLcpTableBuilderImpl
  • com.googlecode.gaal.suffix.impl.EnhancedSuffixArrayImplTest
  • com.googlecode.gaal.suffix.impl.EnhancedSuffixArrayImplTest$IntervalImpl
  • com.googlecode.gaal.suffix.impl.LinearizedSuffixTreeImplTest
  • com.googlecode.gaal.vis.TableVisualizer
    • 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.