//AmbiguityClass -- StanfordMaxEnt, A Maximum Entropy Toolkit
//Copyright (c) 2002-2008 Leland Stanford Junior University
//This program is free software; you can redistribute it and/or
//modify it under the terms of the GNU General Public License
//as published by the Free Software Foundation; either version 2
//of the License, or (at your option) any later version.
//This program is distributed in the hope that it will be useful,
//but WITHOUT ANY WARRANTY; without even the implied warranty of
//MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
//GNU General Public License for more details.
//You should have received a copy of the GNU General Public License
//along with this program; if not, write to the Free Software
//Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//For more information, bug reports, fixes, contact:
//Christopher Manning
//Dept of Computer Science, Gates 1A
//Stanford CA 94305-9010
//USA
// Support/Questions: java-nlp-user@lists.stanford.edu
// Licensing: java-nlp-support@lists.stanford.edu
//http://www-nlp.stanford.edu/software/tagger.shtml
package edu.stanford.nlp.tagger.maxent;
import java.util.ArrayList;
import java.util.Collections;
// import java.util.HashSet;
import java.util.List;
/**
* An ambiguity class for a word is the word by itself or its set of observed tags.
*/
public class AmbiguityClass {
// private final HashSet<String> s;
private final List<Integer> sortedIds;
private final String key;
private final String word;
private final boolean single;
protected AmbiguityClass(String word, boolean single, Dictionary dict, TTags ttags) {
this.single = single;
if (single) {
this.word = word;
sortedIds = Collections.emptyList();
} else {
this.word = null;
String[] tags = dict.getTags(word);
sortedIds = new ArrayList<>(tags.length);
for (String tag : tags) {
add(ttags.getIndex(tag));
}
// s = Generics.newHashSet();
// for (Integer sortedId : sortedIds) {
// s.add(ttags.getTag(sortedId));
// }
}
key = this.toString();
}
public String getWord() {
return word;
}
/*
public boolean belongs(String word) {
String[] tags = GlobalHolder.dict.getTags(word);
if (tags.length != sortedIds.size()) {
return false;
}
for (int i = 0; i < tags.length; i++) {
if (!s.contains(tags[i])) {
return false;
}
}
members++;
return true;
} // belongs
*/
private boolean add(int tagId) {
for (int j = 0; j < sortedIds.size(); j++) {
if (tagId < sortedIds.get(j)) {
sortedIds.add(j, tagId);
return true;
}
if (tagId == sortedIds.get(j)) {
return false;
}
}
sortedIds.add(tagId);
return true;
}
@Override
public String toString() {
if (single) {
return word;
}
StringBuilder sb = new StringBuilder();
for (Integer sID : sortedIds) {
sb.append(':').append(sID.intValue());
}
return sb.toString();
}
/*
public void print() {
//System.out.print(word + " ");
for (Integer sortedId : sortedIds) {
System.out.print(GlobalHolder.tags.getTag(sortedId.intValue()));
}
System.out.println();
}
*/
@Override
public int hashCode() {
return key.hashCode();
}
@Override
public boolean equals(Object o) {
return o instanceof AmbiguityClass && key.equals(((AmbiguityClass) o).key);
}
}