• Home
• com.github.dylon
• liblevenshtein
• 2.1.2
• source code
• .ICandidateFactory.java.swp

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

com.github.dylon.liblevenshtein.levenshtein.factory..ICandidateFactory.swp Maven / Gradle / Ivy

b0VIM 7.4???U??-cvandammearch-laptop~vandamme/Workspace/liblevenshtein/java/src/main/java/com/github/dylon/liblevenshtein/levenshtein/factory/ICandidateFactory.javautf-8
3210#"! Utp


ad?????p>???????D?
?
?
7
1
??}  CandidateType build(String term, int distance);   */   * @return A new spelling candidate, optionally with the distance included.   * term.   * @param distance Levenshtein distance of the dictionary term from the query   * @param term Candidate term from the dictionary.   * Levenshtein distance from the query term.   * Builds a new spelling candidate from the dictionary term and its  /**public interface ICandidateFactory { */ * @since 2.1.2 * @author Dylon Edwards * @param  Kind of spelling candidate built by this factory. * distance of the candidate from the query term. * Builds spelling candidates of the requested type, optionally including the/**package com.github.dylon.liblevenshtein.levenshtein.factory;