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

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

There is a newer version: 1.0.0-M2.1
Show newest version
/*-
 *
 *  * Copyright 2015 Skymind,Inc.
 *  *
 *  *    Licensed under the Apache License, Version 2.0 (the "License");
 *  *    you may not use this file except in compliance with the License.
 *  *    You may obtain a copy of the License at
 *  *
 *  *        http://www.apache.org/licenses/LICENSE-2.0
 *  *
 *  *    Unless required by applicable law or agreed to in writing, software
 *  *    distributed under the License is distributed on an "AS IS" BASIS,
 *  *    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  *    See the License for the specific language governing permissions and
 *  *    limitations under the License.
 *
 */

package org.deeplearning4j.util;

import java.io.Serializable;
import java.util.*;

/**
 * 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;

    public StringCluster(List list) {
        for (int i = 0; i < list.size(); i++) {
            String s = list.get(i);
            FingerPrintKeyer keyer = new FingerPrintKeyer();
            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 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 (s1 == s2) {
                int total1 = 0;
                for (int i : o1.values()) {
                    total1 += i;
                }
                int total2 = 0;
                for (int i : o2.values()) {
                    total2 += i;
                }
                if (total2 < total1)
                    return -1;
                if (total2 > total1)
                    return 1;
                return 0;
            } else if (s2 < s1) {
                return -1;
            } else {
                return 1;
            }
        }
    }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy