A SearchTree contains all vertices that were ever touched during the search, and can produce a prehistory for every ID.
SearchTree Class Documentation
Ejemplo n.º 1
0
        public BeamSearch(OcroFST fst1, OcroFST fst2, int beam_width)
        {
            stree         = new SearchTree();
            beam          = new Intarray();
            beamcost      = new Floatarray();
            all_inputs    = new Intarray();
            all_targets1  = new Intarray();
            all_targets2  = new Intarray();
            all_outputs   = new Intarray();
            all_costs     = new Floatarray();
            parent_trails = new Intarray();

            this.fst1       = fst1;
            this.fst2       = fst2;
            this.nbest      = new PriorityQueue(beam_width);
            this.beam_width = beam_width;
            accepted_from1  = -1;
            accepted_from2  = -1;
        }
Ejemplo n.º 2
0
        public BeamSearch(OcroFST fst1, OcroFST fst2, int beam_width)
        {
            stree = new SearchTree();
            beam = new Intarray();
            beamcost = new Floatarray();
            all_inputs = new Intarray();
            all_targets1 = new Intarray();
            all_targets2 = new Intarray();
            all_outputs = new Intarray();
            all_costs = new Floatarray();
            parent_trails = new Intarray();

            this.fst1 = fst1;
            this.fst2 = fst2;
            this.nbest = new PriorityQueue(beam_width);
            this.beam_width = beam_width;
            accepted_from1 = -1;
            accepted_from2 = -1;
        }