alphabet.java

MSTParser是以最大生成树理论为基础的判别式依存句法分析器。它将一科依存树的得分看作是 所有依存关系的得分的总和

/* Copyright (C) 2002 Univ. of Massachusetts Amherst, Computer Science Dept.
   This file is part of "MALLET" (MAchine Learning for LanguagE Toolkit).
   http://www.cs.umass.edu/~mccallum/mallet
   This software is provided under the terms of the Common Public License,
   version 1.0, as published by http://www.opensource.org.  For further
   information, see the file `LICENSE' included with this distribution. */




/** 
    @author Andrew McCallum <a href="mailto:[e-mail]">[e-mail]</a>
*/

package mstparser;

import java.util.ArrayList;
import java.io.*;
import java.util.Iterator;

public class Alphabet implements Serializable
{
    gnu.trove.TObjectIntHashMap map;
    int numEntries;
    boolean growthStopped = false;

    public Alphabet (int capacity)
    {
	this.map = new gnu.trove.TObjectIntHashMap (capacity);
	numEntries = 0;
    }

    public Alphabet ()
    {
	this (10000);
    }

	
    /** Return -1 if entry isn't present. */
    public int lookupIndex (Object entry, boolean addIfNotPresent)
    {
	if (entry == null)
	    throw new IllegalArgumentException ("Can't lookup \"null\" in an Alphabet.");
	int ret = map.get(entry);
	if (ret == -1 && !growthStopped && addIfNotPresent) {
	    ret = numEntries;
	    map.put (entry, ret);
	    numEntries++;
	}
	return ret;
    }

    public int lookupIndex (Object entry)
    {
	return lookupIndex (entry, true);
    }
	
    public Object[] toArray () {
	return map.keys();
    }

    public boolean contains (Object entry)
    {
	return map.contains (entry);
    }

    public int size ()
    {
	return numEntries;
    }

    public void stopGrowth ()
    {
	growthStopped = true;
    }

    public void allowGrowth ()
    {
	growthStopped = false;
    }

    public boolean growthStopped ()
    {
	return growthStopped;
    }


    // Serialization 
		
    private static final long serialVersionUID = 1;
    private static final int CURRENT_SERIAL_VERSION = 0;

    private void writeObject (ObjectOutputStream out) throws IOException {
	out.writeInt (CURRENT_SERIAL_VERSION);
	out.writeInt (numEntries);
	/*
	Object[] keys = map.keys();
	for(int i = 0; i < keys.length; i++) {
	    out.writeObject(keys[i]); out.writeInt(map.get(keys[i]));
	}
	*/
	out.writeObject(map);
	out.writeBoolean (growthStopped);
    }

    private void readObject (ObjectInputStream in) throws IOException, ClassNotFoundException {
	int version = in.readInt ();
	numEntries = in.readInt();
	/*
	map =  new gnu.trove.TObjectIntHashMap(numEntries);
	for(int i = 0; i < keys.length; i++) {
	    map.put(in.readObject(),in.readInt());
	}
	*/
	map = (gnu.trove.TObjectIntHashMap)in.readObject();
	growthStopped = in.readBoolean();
    }
	
}