mirrors
/
StringDistances.jl
mirror of https://github.com/matthieugomez/StringDistances.jl.git
1
0
Fork 0
Code Issues Releases Wiki Activity

Update README.md

pull/44/head
matthieugomez 2020-11-11 21:17:12 -08:00
parent aeb26abdba
commit 5cc8363264
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -66,7 +66,7 @@ It is particularly fast for QGram-distances (each element is processed once).
#> 0.0 #> 0.0
compare("martha", "martha", Levenshtein()) compare("martha", "martha", Levenshtein())
#> 1.0 #> 1.0
``` ```
- `findnearest` returns the value and index of the element in `itr` with the highest similarity score with `s`. Its syntax is: - `findnearest` returns the value and index of the element in `itr` with the highest similarity score with `s`. Its syntax is:
```julia ```julia