| /dports/devel/p5-Text-Levenshtein-Damerau/Text-Levenshtein-Damerau-0.41/ |
| H A D | README | 2 Text::Levenshtein::Damerau - Damerau Levenshtein edit distance.
5 use Text::Levenshtein::Damerau;
10 my $tld = Text::Levenshtein::Damerau->new('four');
27 use Text::Levenshtein::Damerau qw/edistance/;
40 "Text::Levenshtein::Damerau::PP" and "Text::Levenshtein::Damerau::XS".
42 use Text::Levenshtein::Damerau;
80 use Text::Levenshtein::Damerau;
81 requires Text::Levenshtein::Damerau::XS;
142 * Text::Levenshtein::Damerau::XS xs_edistance
144 * Text::Levenshtein::Damerau::PP pp_edistance
[all …]
|
| H A D | META.yml | 2 abstract: 'Damerau Levenshtein edit distance.'
15 name: Text-Levenshtein-Damerau
21 Text::Levenshtein::Damerau:
22 file: lib/Text/Levenshtein/Damerau.pm
24 Text::Levenshtein::Damerau::PP:
25 file: lib/Text/Levenshtein/Damerau/PP.pm
31 bugtracker: https://rt.cpan.org/Public/Dist/Display.html?Name=Text-Levenshtein-Damerau
32 repository: https://github.com/ugexe/Text--Levenshtein--Damerau
|
| /dports/audio/pms-devel/pms-c94e3c6/vendor/github.com/couchbase/vellum/levenshtein/ |
| H A D | levenshtein.go | 32 type Levenshtein struct { struct
39 func New(query string, distance int) (*Levenshtein, error) {
49 return &Levenshtein{
56 func (l *Levenshtein) Start() int { argument
61 func (l *Levenshtein) IsMatch(s int) bool { argument
70 func (l *Levenshtein) CanMatch(s int) bool { argument
79 func (l *Levenshtein) WillAlwaysMatch(s int) bool { argument
85 func (l *Levenshtein) Accept(s int, b byte) int { argument
|
| /dports/devel/py-python-Levenshtein/python-Levenshtein-0.12.2/ |
| H A D | README.rst | 18 The Levenshtein Python C extension module contains functions for fast
21 * Levenshtein (edit) distance, and edit operations
34 Levenshtein. It misses some SequenceMatcher's functionality, and has some
37 Levenshtein.c can be used as a pure C library, too. You only have to define
42 * C functions exported when compiling with -DNO_PYTHON (see Levenshtein.h)
53 pip install python-Levenshtein
58 …n for the current version <https://rawgit.com/ztane/python-Levenshtein/master/docs/Levenshtein.htm…
62 in ``./gendoc.sh --selfcontained``. It needs Levenshtein already installed
68 Levenshtein is free software; you can redistribute it and/or modify it
78 …kout only, but can now `be found on PyPI again <https://pypi.python.org/pypi/python-Levenshtein>`_.
[all …]
|
| H A D | PKG-INFO | 2 Name: python-Levenshtein
5 Home-page: http://github.com/ztane/python-Levenshtein
26 The Levenshtein Python C extension module contains functions for fast
29 * Levenshtein (edit) distance, and edit operations
42 Levenshtein. It misses some SequenceMatcher's functionality, and has some
61 pip install python-Levenshtein
66 …n for the current version <https://rawgit.com/ztane/python-Levenshtein/master/docs/Levenshtein.htm…
76 Levenshtein is free software; you can redistribute it and/or modify it
94 * http://github.com/ztane/python-Levenshtein/
148 * Added Levenshtein.h to MANIFEST.in
[all …]
|
| /dports/devel/p5-Text-Levenshtein/Text-Levenshtein-0.14/ |
| H A D | README | 2 Text::Levenshtein is an implementation of the Levenshtein edit distance in Perl.
19 You install Text::Levenshtein by running these commands in the *nix environment:
26 To install Text::Levenshtein in the Win32 environment, use nmake instead of make.
34 POD format documentation is included in Levenshtein.pm.
37 https://metacpan.org/pod/Text::Levenshtein
41 perldoc Text::Levenshtein
47 The latest version of Text::Levenshtein is available from CPAN
50 https://metacpan.org/pod/Text::Levenshtein
|
| H A D | META.yml | 2 abstract: 'calculate the Levenshtein edit distance between two strings'
21 name: Text-Levenshtein
24 - Text::Levenshtein::TestUtils
34 homepage: https://github.com/neilbowers/Text-Levenshtein
35 repository: https://github.com/neilbowers/Text-Levenshtein.git
|
| /dports/devel/py-python-Levenshtein/python-Levenshtein-0.12.2/python_Levenshtein.egg-info/ |
| H A D | PKG-INFO | 2 Name: python-Levenshtein
5 Home-page: http://github.com/ztane/python-Levenshtein
26 The Levenshtein Python C extension module contains functions for fast
29 * Levenshtein (edit) distance, and edit operations
42 Levenshtein. It misses some SequenceMatcher's functionality, and has some
61 pip install python-Levenshtein
66 …n for the current version <https://rawgit.com/ztane/python-Levenshtein/master/docs/Levenshtein.htm…
76 Levenshtein is free software; you can redistribute it and/or modify it
94 * http://github.com/ztane/python-Levenshtein/
148 * Added Levenshtein.h to MANIFEST.in
[all …]
|
| /dports/sysutils/czkawka/czkawka-3.3.1/cargo-crates/bk-tree-0.4.0/benches/ |
| H A D | lib.rs | 6 use bk_tree::metrics::Levenshtein;
22 let mut tree: BKTree<String> = BKTree::new(Levenshtein); in bench_find_exact()
34 let mut tree: BKTree<String> = BKTree::new(Levenshtein); in bench_find_tol_one()
47 let mut tree: BKTree<String> = BKTree::new(Levenshtein); in bench_find_tol_two()
62 let mut tree: BKTree<String> = BKTree::new(Levenshtein); in bench_add()
74 let mut tree: BKTree<String> = BKTree::new(Levenshtein); in bench_extend()
|
| /dports/multimedia/gstreamer1-plugins-rust/gst-plugins-rs-d0466b3eee114207f851b37cae0015c0e718f021/cargo-crates/fst-0.4.7/tests/ |
| H A D | test.rs | 2 use fst::automaton::Levenshtein;
38 let q = Levenshtein::new("woog", 1).unwrap(); in levenshtein_simple()
47 let q = Levenshtein::new("snoman", 3).unwrap(); in levenshtein_unicode()
57 let lev = Levenshtein::new("foo", 1).unwrap(); in complement_small()
72 let lev = Levenshtein::new("foo", 1).unwrap(); in startswith_small()
89 let lev = Levenshtein::new("foo", 1).unwrap(); in intersection_small()
102 let lev = Levenshtein::new("foo", 1).unwrap(); in union_small()
116 let lev = Levenshtein::new("foo", 3).unwrap(); in intersection_large()
135 let lev = Levenshtein::new("foo", 3).unwrap(); in union_large()
|
| /dports/devel/rust-analyzer/rust-analyzer-2021-12-20/cargo-crates/fst-0.4.7/tests/ |
| H A D | test.rs | 2 use fst::automaton::Levenshtein;
38 let q = Levenshtein::new("woog", 1).unwrap(); in levenshtein_simple()
47 let q = Levenshtein::new("snoman", 3).unwrap(); in levenshtein_unicode()
57 let lev = Levenshtein::new("foo", 1).unwrap(); in complement_small()
72 let lev = Levenshtein::new("foo", 1).unwrap(); in startswith_small()
89 let lev = Levenshtein::new("foo", 1).unwrap(); in intersection_small()
102 let lev = Levenshtein::new("foo", 1).unwrap(); in union_small()
116 let lev = Levenshtein::new("foo", 3).unwrap(); in intersection_large()
135 let lev = Levenshtein::new("foo", 3).unwrap(); in union_large()
|
| /dports/textproc/sonic/sonic-1.3.0/cargo-crates/fst-0.3.5/tests/ |
| H A D | test.rs | 5 use fst_levenshtein::Levenshtein;
46 let q = Levenshtein::new("woog", 1).unwrap(); in levenshtein_simple()
54 let q = Levenshtein::new("snoman", 3).unwrap(); in levenshtein_unicode()
63 let lev = Levenshtein::new("foo", 1).unwrap(); in complement_small()
77 let lev = Levenshtein::new("foo", 1).unwrap(); in startswith_small()
90 let lev = Levenshtein::new("foo", 1).unwrap(); in intersection_small()
102 let lev = Levenshtein::new("foo", 1).unwrap(); in union_small()
113 let lev = Levenshtein::new("foo", 3).unwrap(); in intersection_large()
129 let lev = Levenshtein::new("foo", 3).unwrap(); in union_large()
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/fst-0.4.5/tests/ |
| H A D | test.rs | 2 use fst::automaton::Levenshtein;
38 let q = Levenshtein::new("woog", 1).unwrap(); in levenshtein_simple()
47 let q = Levenshtein::new("snoman", 3).unwrap(); in levenshtein_unicode()
57 let lev = Levenshtein::new("foo", 1).unwrap(); in complement_small()
72 let lev = Levenshtein::new("foo", 1).unwrap(); in startswith_small()
89 let lev = Levenshtein::new("foo", 1).unwrap(); in intersection_small()
102 let lev = Levenshtein::new("foo", 1).unwrap(); in union_small()
116 let lev = Levenshtein::new("foo", 3).unwrap(); in intersection_large()
135 let lev = Levenshtein::new("foo", 3).unwrap(); in union_large()
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/fst/tests/ |
| H A D | test.rs | 2 use fst::automaton::Levenshtein;
38 let q = Levenshtein::new("woog", 1).unwrap(); in levenshtein_simple()
47 let q = Levenshtein::new("snoman", 3).unwrap(); in levenshtein_unicode()
57 let lev = Levenshtein::new("foo", 1).unwrap(); in complement_small()
72 let lev = Levenshtein::new("foo", 1).unwrap(); in startswith_small()
89 let lev = Levenshtein::new("foo", 1).unwrap(); in intersection_small()
102 let lev = Levenshtein::new("foo", 1).unwrap(); in union_small()
116 let lev = Levenshtein::new("foo", 3).unwrap(); in intersection_large()
135 let lev = Levenshtein::new("foo", 3).unwrap(); in union_large()
|
| /dports/textproc/py-textdistance/textdistance-4.2.2/ |
| H A D | PKG-INFO | 35 …| [Levenshtein](https://en.wikipedia.org/wiki/Levenshtein_distance) | `Lev…
237 1. [python-Levenshtein](https://github.com/ztane/python-Levenshtein)
246 1. Levenshtein
259 | Hamming | Levenshtein | hamming | 0.0014428 |
264 | Jaro | Levenshtein | jaro | 0.00313561 |
271 | Levenshtein | Levenshtein | distance | 0.00414404 |
274 | Levenshtein | pylev | levenshtein | 0.569182 |
275 | Levenshtein | distance | levenshtein | 1.15726 |
276 | Levenshtein | abydos | levenshtein | 3.68451 |
277 | Levenshtein | **textdistance** | Levenshtein | 8.63674 |
[all …]
|
| /dports/textproc/py-textdistance/textdistance-4.2.2/textdistance.egg-info/ |
| H A D | PKG-INFO | 35 …| [Levenshtein](https://en.wikipedia.org/wiki/Levenshtein_distance) | `Lev…
237 1. [python-Levenshtein](https://github.com/ztane/python-Levenshtein)
246 1. Levenshtein
259 | Hamming | Levenshtein | hamming | 0.0014428 |
264 | Jaro | Levenshtein | jaro | 0.00313561 |
271 | Levenshtein | Levenshtein | distance | 0.00414404 |
274 | Levenshtein | pylev | levenshtein | 0.569182 |
275 | Levenshtein | distance | levenshtein | 1.15726 |
276 | Levenshtein | abydos | levenshtein | 3.68451 |
277 | Levenshtein | **textdistance** | Levenshtein | 8.63674 |
[all …]
|
| /dports/lang/gleam/gleam-0.18.2/cargo-crates/strsim-0.10.0/ |
| H A D | CHANGELOG.md | 28 Damerau-Levenshtein
34 - Faster Damerau-Levenshtein implementation (thanks [@lovasoa](https://github.com/lovasoa))
46 - Normalized versions of Levenshtein and Damerau-Levenshtein (thanks [@gentoid](https://github.com/…
52 - Faster Levenshtein implementation (thanks [@wdv4758h](https://github.com/wdv4758h))
72 - Fix Damerau-Levenshtein implementation (previous implementation was actually
73 optimal string alignment; see this [Damerau-Levenshtein explanation])
157 - Implement Damerau-Levenshtein
176 - Implement Hamming, Jaro, Jaro-Winkler, and Levenshtein
202 [Damerau-Levenshtein explanation]:
|
| /dports/databases/ods2sql/ods2sql-aca63183274038487cecb6be17d7f65e92178b8c/cargo-crates/strsim-0.10.0/ |
| H A D | CHANGELOG.md | 28 Damerau-Levenshtein
34 - Faster Damerau-Levenshtein implementation (thanks [@lovasoa](https://github.com/lovasoa))
46 - Normalized versions of Levenshtein and Damerau-Levenshtein (thanks [@gentoid](https://github.com/…
52 - Faster Levenshtein implementation (thanks [@wdv4758h](https://github.com/wdv4758h))
72 - Fix Damerau-Levenshtein implementation (previous implementation was actually
73 optimal string alignment; see this [Damerau-Levenshtein explanation])
157 - Implement Damerau-Levenshtein
176 - Implement Hamming, Jaro, Jaro-Winkler, and Levenshtein
202 [Damerau-Levenshtein explanation]:
|
| /dports/accessibility/wl-gammarelay-rs/wl-gammarelay-rs-0.2.1/cargo-crates/strsim-0.10.0/ |
| H A D | CHANGELOG.md | 28 Damerau-Levenshtein
34 - Faster Damerau-Levenshtein implementation (thanks [@lovasoa](https://github.com/lovasoa))
46 - Normalized versions of Levenshtein and Damerau-Levenshtein (thanks [@gentoid](https://github.com/…
52 - Faster Levenshtein implementation (thanks [@wdv4758h](https://github.com/wdv4758h))
72 - Fix Damerau-Levenshtein implementation (previous implementation was actually
73 optimal string alignment; see this [Damerau-Levenshtein explanation])
157 - Implement Damerau-Levenshtein
176 - Implement Hamming, Jaro, Jaro-Winkler, and Levenshtein
202 [Damerau-Levenshtein explanation]:
|
| /dports/www/ffsend/ffsend-ccd489ce2e75b91c0f17fbf13dbd91fe84f5ad98/cargo-crates/strsim-0.10.0/ |
| H A D | CHANGELOG.md | 28 Damerau-Levenshtein
34 - Faster Damerau-Levenshtein implementation (thanks [@lovasoa](https://github.com/lovasoa))
46 - Normalized versions of Levenshtein and Damerau-Levenshtein (thanks [@gentoid](https://github.com/…
52 - Faster Levenshtein implementation (thanks [@wdv4758h](https://github.com/wdv4758h))
72 - Fix Damerau-Levenshtein implementation (previous implementation was actually
73 optimal string alignment; see this [Damerau-Levenshtein explanation])
157 - Implement Damerau-Levenshtein
176 - Implement Hamming, Jaro, Jaro-Winkler, and Levenshtein
202 [Damerau-Levenshtein explanation]:
|
| /dports/sysutils/zoxide/zoxide-0.6.0/cargo-crates/strsim-0.10.0/ |
| H A D | CHANGELOG.md | 28 Damerau-Levenshtein
34 - Faster Damerau-Levenshtein implementation (thanks [@lovasoa](https://github.com/lovasoa))
46 - Normalized versions of Levenshtein and Damerau-Levenshtein (thanks [@gentoid](https://github.com/…
52 - Faster Levenshtein implementation (thanks [@wdv4758h](https://github.com/wdv4758h))
72 - Fix Damerau-Levenshtein implementation (previous implementation was actually
73 optimal string alignment; see this [Damerau-Levenshtein explanation])
157 - Implement Damerau-Levenshtein
176 - Implement Hamming, Jaro, Jaro-Winkler, and Levenshtein
202 [Damerau-Levenshtein explanation]:
|
| /dports/security/arti/arti-9d0ede26801cdb182daa85c3eb5f0058dc178eb6/cargo-crates/strsim-0.10.0/ |
| H A D | CHANGELOG.md | 28 Damerau-Levenshtein
34 - Faster Damerau-Levenshtein implementation (thanks [@lovasoa](https://github.com/lovasoa))
46 - Normalized versions of Levenshtein and Damerau-Levenshtein (thanks [@gentoid](https://github.com/…
52 - Faster Levenshtein implementation (thanks [@wdv4758h](https://github.com/wdv4758h))
72 - Fix Damerau-Levenshtein implementation (previous implementation was actually
73 optimal string alignment; see this [Damerau-Levenshtein explanation])
157 - Implement Damerau-Levenshtein
176 - Implement Hamming, Jaro, Jaro-Winkler, and Levenshtein
202 [Damerau-Levenshtein explanation]:
|
| /dports/converters/yj-bruceadams/yj-1.1.34/cargo-crates/strsim-0.10.0/ |
| H A D | CHANGELOG.md | 28 Damerau-Levenshtein
34 - Faster Damerau-Levenshtein implementation (thanks [@lovasoa](https://github.com/lovasoa))
46 - Normalized versions of Levenshtein and Damerau-Levenshtein (thanks [@gentoid](https://github.com/…
52 - Faster Levenshtein implementation (thanks [@wdv4758h](https://github.com/wdv4758h))
72 - Fix Damerau-Levenshtein implementation (previous implementation was actually
73 optimal string alignment; see this [Damerau-Levenshtein explanation])
157 - Implement Damerau-Levenshtein
176 - Implement Hamming, Jaro, Jaro-Winkler, and Levenshtein
202 [Damerau-Levenshtein explanation]:
|
| /dports/sysutils/czkawka/czkawka-3.3.1/cargo-crates/strsim-0.9.3/ |
| H A D | CHANGELOG.md | 22 Damerau-Levenshtein
28 - Faster Damerau-Levenshtein implementation (thanks [@lovasoa](https://github.com/lovasoa))
40 - Normalized versions of Levenshtein and Damerau-Levenshtein (thanks [@gentoid](https://github.com/…
46 - Faster Levenshtein implementation (thanks [@wdv4758h](https://github.com/wdv4758h))
66 - Fix Damerau-Levenshtein implementation (previous implementation was actually
67 optimal string alignment; see this [Damerau-Levenshtein explanation])
151 - Implement Damerau-Levenshtein
170 - Implement Hamming, Jaro, Jaro-Winkler, and Levenshtein
195 [Damerau-Levenshtein explanation]:
|
| /dports/audio/gnome-podcasts/podcasts-c86f7bfdef7692bbf20f315a90450321f6ca9ce7/cargo-crates/strsim-0.10.0/ |
| H A D | CHANGELOG.md | 28 Damerau-Levenshtein
34 - Faster Damerau-Levenshtein implementation (thanks [@lovasoa](https://github.com/lovasoa))
46 - Normalized versions of Levenshtein and Damerau-Levenshtein (thanks [@gentoid](https://github.com/…
52 - Faster Levenshtein implementation (thanks [@wdv4758h](https://github.com/wdv4758h))
72 - Fix Damerau-Levenshtein implementation (previous implementation was actually
73 optimal string alignment; see this [Damerau-Levenshtein explanation])
157 - Implement Damerau-Levenshtein
176 - Implement Hamming, Jaro, Jaro-Winkler, and Levenshtein
202 [Damerau-Levenshtein explanation]:
|