/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, Collection candidates) { return getClosestLevenshteinDistance(str, candidates, Integer.MAX_VALUE); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, Collection candidates) { return getClosestLevenshteinDistance(str, candidates, Integer.MAX_VALUE); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, Collection candidates) { return getClosestLevenshteinDistance(str, candidates, Integer.MAX_VALUE); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, Collection candidates) { return getClosestLevenshteinDistance(str, candidates, Integer.MAX_VALUE); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, String[] candidates) { if (candidates == null) return null; return getClosestLevenshteinDistance(str, Arrays.asList(candidates)); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, String[] candidates) { if (candidates == null) return null; return getClosestLevenshteinDistance(str, Arrays.asList(candidates)); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, String[] candidates) { if (candidates == null) return null; return getClosestLevenshteinDistance(str, Arrays.asList(candidates)); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, String[] candidates) { if (candidates == null) return null; return getClosestLevenshteinDistance(str, Arrays.asList(candidates)); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, String[] candidates, int threshold) { if (candidates == null) return null; return getClosestLevenshteinDistance(str, Arrays.asList(candidates), threshold); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, String[] candidates, int threshold) { if (candidates == null) return null; return getClosestLevenshteinDistance(str, Arrays.asList(candidates), threshold); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, String[] candidates, int threshold) { if (candidates == null) return null; return getClosestLevenshteinDistance(str, Arrays.asList(candidates), threshold); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string and using the threshold as the specified * percentage of the length of the candidate string(0.0f-1.0f). * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, String[] candidates, float thresholdPercentage) { if (candidates == null) return null; return getClosestLevenshteinDistance(str, Arrays.asList(candidates), thresholdPercentage); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string. * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, String[] candidates, int threshold) { if (candidates == null) return null; return getClosestLevenshteinDistance(str, Arrays.asList(candidates), threshold); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string and using the threshold as the specified * percentage of the length of the candidate string(0.0f-1.0f). * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, String[] candidates, float thresholdPercentage) { if (candidates == null) return null; return getClosestLevenshteinDistance(str, Arrays.asList(candidates), thresholdPercentage); }
/** * Returns the candidate string with the closest Levenshtein distance * to the given string and using the threshold as the specified * percentage of the length of the candidate string(0.0f-1.0f). * * @see #getClosestLevenshteinDistance(String,Collection,int) */ public static String getClosestLevenshteinDistance(String str, String[] candidates, float thresholdPercentage) { if (candidates == null) return null; return getClosestLevenshteinDistance(str, Arrays.asList(candidates), thresholdPercentage); }
/** * @return the nearest match to the specified alias name * @since 1.1.0 */ public String getClosestAliasName(String alias) { Collection<String> aliases = getAliasNames(); return StringDistance.getClosestLevenshteinDistance(alias, aliases); }
/** * @return the nearest match to the specified alias name * @since 1.1.0 */ public String getClosestAliasName(String alias) { Collection<String> aliases = getAliasNames(); return StringDistance.getClosestLevenshteinDistance(alias, aliases); }
/** * @return the nearest match to the specified alias name * @since 1.1.0 */ public String getClosestAliasName(String alias) { Collection<String> aliases = getAliasNames(); return StringDistance.getClosestLevenshteinDistance(alias, aliases); }
/** * @return the nearest match to the specified alias name * @since 1.1.0 */ public String getClosestAliasName(String alias) { Collection aliases = getAliasNames(); return StringDistance.getClosestLevenshteinDistance(alias, aliases); }
/** * @return the nearest match to the specified alias name * @since 1.1.0 */ public String getClosestAliasName(String alias) { Collection<String> aliases = getAliasNames(); return StringDistance.getClosestLevenshteinDistance(alias, aliases); }