org.deeplearning4j.util.StringCluster Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of deeplearning4j-core Show documentation

There is a newer version: 1.0.0-M2.1

package org.deeplearning4j.util;

import java.io.Serializable;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;

/**
 * Clusters strings based on fingerprint: for example
 * Two words and TWO words or WORDS TWO would be put together
 * @author Adam Gibson
 *
 */
public class StringCluster extends HashMap> {

    /**
     *
     */
    private static final long serialVersionUID = -4120559428585520276L;
    private FingerPrintKeyer keyer = new FingerPrintKeyer();

    public StringCluster(List list) {
        for(int i = 0; i< list.size(); i++) {
            String s = list.get(i);
            String key = keyer.key(s);
            if (containsKey(key)) {
                Map m = get(key);
                if (m.containsKey(s)) {
                    m.put(s, m.get(s) + 1);
                } else {
                    m.put(s,1);
                }
            } else {
                Map m = new TreeMap();
                m.put(s,1);
                put(key, m);
            }
        }
    }

    public List> getClusters() {
        List>_clusters = new ArrayList>(values());
        Collections.sort(_clusters,new StringCluster.SizeComparator());
        return _clusters;
    }


    public void sort() {
        Collections.sort(new ArrayList>(values()),new SizeComparator());
    }


    public static class SizeComparator implements Comparator>, Serializable {
        private static final long serialVersionUID = -1390696157208674054L;
        @Override
        public int compare(Map o1, Map o2) {
            int s1 = o1.size();
            int s2 = o2.size();
            if (o1 == o2) {
                int total1 = 0;
                for (int i : o1.values()) {
                    total1 += i;
                }
                int total2 = 0;
                for (int i : o2.values()) {
                    total2 += i;
                }
                return total2 - total1;
            } else {
                return s2 - s1;
            }
        }
    }

}