edu.upenn.seas.mstparser.Alphabet Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of jcore-mstparser-ae Show documentation

Slightly modified version of the MST parser to fit into the UIMA framework. This dependency parser determines all syntactic dependencies between words within a sentence. Certain level of adaptation of the original source code was necessary to neatly integrate the parser in UIMA.

The newest version!

/* 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 [email protected]
*/

package edu.upenn.seas.mstparser;

import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
import java.io.Serializable;

import de.julielab.gnu.trove.TObjectIntHashMap;

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

    public Alphabet(int capacity) {
        this.map = new de.julielab.gnu.trove.TObjectIntHashMap(capacity);
        // this.map.setDefaultValue(-1);

        numEntries = 0;
    }

    public Alphabet() {
        this(10000);
    }

    /** Return -1 if entry isn't present. */
    public int lookupIndex(Object entry) {
        if (entry == null) {
            throw new IllegalArgumentException("Can't lookup \"null\" in an Alphabet.");
        }

        int ret = map.get(entry);

        if (ret == -1 && !growthStopped) {
            ret = numEntries;
            map.put(entry, ret);
            numEntries++;

        }

        return ret;
    }

    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;
        map.compact();
    }

    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);
        out.writeObject(map);
        out.writeBoolean(growthStopped);
    }

    private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException {
        int version = in.readInt();
        numEntries = in.readInt();
        map = (TObjectIntHashMap) in.readObject();
        growthStopped = in.readBoolean();
    }

}