File: control

package info (click to toggle)
golang-github-schollz-closestmatch 2.1.0-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, sid
  • size: 1,316 kB
  • sloc: makefile: 12
file content (33 lines) | stat: -rw-r--r-- 1,416 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
Source: golang-github-schollz-closestmatch
Section: devel
Priority: optional
Maintainer: Debian Go Packaging Team <team+pkg-go@tracker.debian.org>
Uploaders:
 Dawid Dziurla <dawidd0811@gmail.com>,
Rules-Requires-Root: no
Build-Depends:
 debhelper-compat (= 12),
 dh-golang,
Build-Depends-Indep:
 golang-any,
Standards-Version: 4.4.0
Homepage: https://github.com/schollz/closestmatch
Vcs-Browser: https://salsa.debian.org/go-team/packages/golang-github-schollz-closestmatch
Vcs-Git: https://salsa.debian.org/go-team/packages/golang-github-schollz-closestmatch.git
XS-Go-Import-Path: github.com/schollz/closestmatch
Testsuite: autopkgtest-pkg-go

Package: golang-github-schollz-closestmatch-dev
Architecture: all
Depends:
 ${misc:Depends},
Description: Golang library for fuzzy matching within a set of strings
 Closestmatch is a simple and fast Go library for fuzzy matching an
 input string to a list of target strings. closestmatch is useful for
 handling input from a user where the input (which could be misspelled or
 out of order) needs to match a key in a database. closestmatch uses a
 bag-of-words approach (https://en.wikipedia.org/wiki/Bag-of-words_model)
 to precompute character n-grams to represent each possible target
 string. The closest matches have highest overlap between the sets of
 n-grams. The precomputation scales well and is much faster and more
 accurate than Levenshtein for long strings.