mnalis/apps-android-commons
1
0
Fork 0
mirror of https://github.com/commons-app/apps-android-commons.git synced 2025-10-27 21:03:54 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Implementing String similarity algorithm for searching category functionality

Browse source
This commit is contained in:
pszklarska 2017-09-05 18:02:44 +02:00
parent d4a89afafd
commit 5094cbc58a
4 changed files with 85 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

8
app/src/main/java/fr/free/nrw/commons/category/CategorizationFragment.java
View file

@ -25,6 +25,7 @@ import com.pedrogomez.renderers.RVRendererAdapter;
import java.util.ArrayList;
import java.util.Calendar;
import java.util.Comparator;
import java.util.Date;
import java.util.HashMap;
import java.util.List;
@ -36,6 +37,7 @@ import fr.free.nrw.commons.CommonsApplication;
import fr.free.nrw.commons.R;
import fr.free.nrw.commons.data.Category;
import fr.free.nrw.commons.upload.MwVolleyApi;
import fr.free.nrw.commons.utils.StringSortingUtils;
import io.reactivex.Observable;
import io.reactivex.android.schedulers.AndroidSchedulers;
import io.reactivex.schedulers.Schedulers;
@ -199,6 +201,7 @@ public class CategorizationFragment extends Fragment {
)
.filter(categoryItem -> !containsYear(categoryItem.getName()))
.distinct()
.sorted(sortByMatches(filter))
.observeOn(AndroidSchedulers.mainThread())
.subscribe(
s -> categoriesAdapter.add(s),
@ -222,6 +225,11 @@ public class CategorizationFragment extends Fragment {
);
}
private Comparator<CategoryItem> sortByMatches(final String filter) {
Comparator<String> stringSimilarityComparator = StringSortingUtils.sortBySimilarity(filter);
return (firstItem, secondItem) -> stringSimilarityComparator.compare(firstItem.getName(), secondItem.getName());
}
private List<String> getStringList(List<CategoryItem> input) {
List<String> output = new ArrayList<>();
for (CategoryItem item : input) {

36
app/src/main/java/fr/free/nrw/commons/utils/StringSortingUtils.java Normal file
View file

@ -0,0 +1,36 @@
package fr.free.nrw.commons.utils;
import info.debatty.java.stringsimilarity.Levenshtein;
import java.util.Comparator;
public class StringSortingUtils {
private StringSortingUtils() {
//no-op
}
public static Comparator<String> sortBySimilarity(final String filter) {
return (firstItem, secondItem) -> {
double firstItemSimilarity = StringSortingUtils.calculateSimilarity(firstItem, filter);
double secondItemSimilarity = StringSortingUtils.calculateSimilarity(secondItem, filter);
return (int) Math.signum(secondItemSimilarity - firstItemSimilarity);
};
}
private static double calculateSimilarity(String firstString, String secondString) {
String longer = firstString.toLowerCase();
String shorter = secondString.toLowerCase();
if (firstString.length() < secondString.length()) {
longer = secondString;
shorter = firstString;
}
int longerLength = longer.length();
if (longerLength == 0) {
return 1.0;
}
double distanceBetweenStrings = new Levenshtein().distance(longer, shorter);
return (longerLength - distanceBetweenStrings) / (double) longerLength;
}
}