All Downloads are FREE. Search and download functionalities are using the official Maven repository.

is2.parser.ParallelDecoder Maven / Gradle / Ivy

Go to download

Tools for Natural Language Analysis, Generation and Machine Learning

The newest version!
package is2.parser;


import is2.data.DataFES;


import java.util.ArrayList;
import java.util.concurrent.Callable;

/**
 * @author Bernd Bohnet, 30.08.2009
 * 
 * This class implements a parallel feature extractor.
 */
final public class ParallelDecoder implements Callable 
{
	// some constants
	private static final float INIT_BEST = (-1.0F / 0.0F);
	private static final boolean[] DIR ={false,true};

	// the data space of the weights for a dependency tree  
	final private DataFES x;

	private short[] pos;

	private Open O[][][][];
	private Closed C[][][][] ;

	private int length;

	boolean done=false;
	public boolean waiting =false;

	/**
	 * Initialize the parallel decoder.
	 * 
	 * @param pos part-of-speech
	 * @param d data
	 * @param edges part-of-speech edge mapping
	 * @param o open spans 
	 * @param c closed spans
	 * @param length number of words
	 */
	public ParallelDecoder(short[] pos, DataFES d, Open o[][][][], Closed c[][][][], int length) {

		this.pos =pos;
		this.x =d;

		this.O=o;
		this.C=c;
		this.length=length;
	}


	private static class DSet { short w1,w2;}

	@Override
	public Object call() {

		
		try {
			
		while (true){

			DSet set = get();
//			if (done && set==null) break;	

			if (set ==null) return null;

			short s=set.w1, t=set.w2;

			for(short dir =0;dir<2;dir++) {
				
				short[] labs = (dir==1) ? Edges.get(pos[s],pos[t]):Edges.get(pos[t],pos[s]);

				O[s][t][dir] = new Open[labs.length];

				for (int l =  0; l  tLPr) {
									tLPr = ((dir==1 ? x.sib[s][t][i][l] : x.gra[t][s][i][l]) + C[s][r][1][i].p);tLCld = C[s][r][1][i];}
							
						if (r == t-1) tRPr = dir==1 ? x.gra[s][t][s][l] : x.sib[t][s][s][l];
						else
							for (int i = r + 1; i < t; i++) 
								if (((dir == 1 ? x.gra[s][t][i][l] : 
									x.sib[t][s][i][l]) + 
									C[r+1][t][0][i].p) > tRPr) {
									tRPr = ((dir==1?x.gra[s][t][i][l]:x.sib[t][s][i][l]) + C[r+1][t][0][i].p); tRCld=C[r + 1][t][0][i];
								}
											
						if (tLPr + tRPr > tRP) {tRP = tLPr + tRPr; tL = tLCld;tR = tRCld;}
					}
					O[s][t][dir][l] = new Open(s, t, dir, labs[l],tL, tR, 
							(float) ( tRP+((dir==1)?x.pl[s][t]: x.pl[t][s]) + ((dir==1)? x.lab[s][t][labs[l]]:x.lab[t][s][labs[l]])));					
				}
			}
			C[s][t][1] = new Closed[length]; C[s][t][0] = new Closed[length];

			for (int m = s ; m <= t; m++) {
				for(boolean d : DIR) {
					if ((d && m!=s)||!d && (m!=t && s!=0)) {
						
						// create closed structure
						
						double top = INIT_BEST;
						
						Open tU = null; Closed tL = null;
						int numLabels =O[(d ? s : m)][(d ? m : t)][d?1:0].length;
				
						//for (int l = numLabels-1; l >=0; l--) {
						for (int l = 0; l < numLabels; l++) {
							
							Open hi = O[(d ? s : m)][(d ? m : t)][d?1:0][l];
							for (int amb = m + (d?1:-1); amb != (d?t:s) + (d?1:-1); amb += (d?1:-1)) {
								
								if ((hi.p + C[d?m:s][d?t:m][d?1:0][amb].p +x.gra[d?s:t][m][amb][l]) > top) {
									top = (hi.p + C[d?m:s][d?t:m][d?1:0][amb].p +x.gra[d?s:t][m][amb][l]); tU = hi; tL=C[d?m:s][d?t:m][d?1:0][amb];}
								
							}
						
							if ((m == (d ? t : s)) && (hi.p + x.gra[d?s:t][d?t:s][m][l]) > top) { 
								top = (hi.p + x.gra[d ? s : t][d?t:s][m][l]); tU = hi; tL = null;}
						}
						C[s][t][d?1:0][m] = new Closed(s, t, m, d?1:0,tU,tL,(float) top);
						
					
					}
				}			
			}
		}
		} catch (Exception e ) {
			e.printStackTrace();
			System.exit(0);
		}
		return null;
	}

	public static ArrayList sets = new ArrayList();

	static synchronized private DSet get() {
		synchronized (sets) {
			if (sets.size()==0) return null;
			return sets.remove(sets.size()-1);
		}
	}

	public static void add(short w1, short w2){
		DSet ds =new DSet();
		ds.w1=w1;
		ds.w2=w2;
		sets.add(ds);
	}
}
    

    

    
            
    
            







    
© 2015 - 2024 Weber Informatics LLC | Privacy Policy