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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
%global _empty_manifest_terminate_build 0
Name: python-inexactsearch
Version: 1.0.2
Release: 1
Summary: Fuzzy String search algorithm using Soundex for Indian language
License: LGPL-2.1+
URL: https://github.com/Project-SILPA/inexactsearch
Source0: https://mirrors.nju.edu.cn/pypi/web/packages/45/23/0b398af4295da99c5ab69d7b0bff36a2cb68e260a65f64717c17f6a20035/inexactsearch-1.0.2.tar.gz
BuildArch: noarch
%description
Approximate String Search
###########################
.. image::
https://travis-ci.org/Project-SILPA/inexactsearch.svg?branch=master
:target: https://travis-ci.org/Project-SILPA/inexactsearch
.. image::
https://coveralls.io/repos/Project-SILPA/inexactsearch/badge.png?branch=master
:target: https://coveralls.io/r/Project-SILPA/inexactsearch?branch=master
This is a `Fuzzy string search
<http://en.wikipedia.org/wiki/Fuzzy_string_searching>`_
application. This application illustrates the combined use of `Edit
distance <http://en.wikipedia.org/wiki/Levenshtein_distance>`_ and
`Indic Soundex <http://silpa.org.in/Soundex>`_ algorithm.
By mixing both written like(edit distance) and sounds like(soundex),
we achieve an efficient aproximate string searching. This application
is capable of cross language string search too. That means, you can
search Hindi words in Malayalam text. If there is any Malayalam word,
which is approximate transliteration of hindi word, or sounds alike
the hindi words, it will be returned as an approximate match. The
"written like" algorithm used here is a bigram average algorithm. The
ratio of common bigrams in two strings and average number of bigrams
will give a factor which is greater than zero and less
than 1. Similarly the soundex algorithm also gives a weight. By
selecting words which has comparison weight more than the threshold
weight(which 0.6), we get the search results.
%package -n python3-inexactsearch
Summary: Fuzzy String search algorithm using Soundex for Indian language
Provides: python-inexactsearch
BuildRequires: python3-devel
BuildRequires: python3-setuptools
BuildRequires: python3-pip
%description -n python3-inexactsearch
Approximate String Search
###########################
.. image::
https://travis-ci.org/Project-SILPA/inexactsearch.svg?branch=master
:target: https://travis-ci.org/Project-SILPA/inexactsearch
.. image::
https://coveralls.io/repos/Project-SILPA/inexactsearch/badge.png?branch=master
:target: https://coveralls.io/r/Project-SILPA/inexactsearch?branch=master
This is a `Fuzzy string search
<http://en.wikipedia.org/wiki/Fuzzy_string_searching>`_
application. This application illustrates the combined use of `Edit
distance <http://en.wikipedia.org/wiki/Levenshtein_distance>`_ and
`Indic Soundex <http://silpa.org.in/Soundex>`_ algorithm.
By mixing both written like(edit distance) and sounds like(soundex),
we achieve an efficient aproximate string searching. This application
is capable of cross language string search too. That means, you can
search Hindi words in Malayalam text. If there is any Malayalam word,
which is approximate transliteration of hindi word, or sounds alike
the hindi words, it will be returned as an approximate match. The
"written like" algorithm used here is a bigram average algorithm. The
ratio of common bigrams in two strings and average number of bigrams
will give a factor which is greater than zero and less
than 1. Similarly the soundex algorithm also gives a weight. By
selecting words which has comparison weight more than the threshold
weight(which 0.6), we get the search results.
%package help
Summary: Development documents and examples for inexactsearch
Provides: python3-inexactsearch-doc
%description help
Approximate String Search
###########################
.. image::
https://travis-ci.org/Project-SILPA/inexactsearch.svg?branch=master
:target: https://travis-ci.org/Project-SILPA/inexactsearch
.. image::
https://coveralls.io/repos/Project-SILPA/inexactsearch/badge.png?branch=master
:target: https://coveralls.io/r/Project-SILPA/inexactsearch?branch=master
This is a `Fuzzy string search
<http://en.wikipedia.org/wiki/Fuzzy_string_searching>`_
application. This application illustrates the combined use of `Edit
distance <http://en.wikipedia.org/wiki/Levenshtein_distance>`_ and
`Indic Soundex <http://silpa.org.in/Soundex>`_ algorithm.
By mixing both written like(edit distance) and sounds like(soundex),
we achieve an efficient aproximate string searching. This application
is capable of cross language string search too. That means, you can
search Hindi words in Malayalam text. If there is any Malayalam word,
which is approximate transliteration of hindi word, or sounds alike
the hindi words, it will be returned as an approximate match. The
"written like" algorithm used here is a bigram average algorithm. The
ratio of common bigrams in two strings and average number of bigrams
will give a factor which is greater than zero and less
than 1. Similarly the soundex algorithm also gives a weight. By
selecting words which has comparison weight more than the threshold
weight(which 0.6), we get the search results.
%prep
%autosetup -n inexactsearch-1.0.2
%build
%py3_build
%install
%py3_install
install -d -m755 %{buildroot}/%{_pkgdocdir}
if [ -d doc ]; then cp -arf doc %{buildroot}/%{_pkgdocdir}; fi
if [ -d docs ]; then cp -arf docs %{buildroot}/%{_pkgdocdir}; fi
if [ -d example ]; then cp -arf example %{buildroot}/%{_pkgdocdir}; fi
if [ -d examples ]; then cp -arf examples %{buildroot}/%{_pkgdocdir}; fi
pushd %{buildroot}
if [ -d usr/lib ]; then
find usr/lib -type f -printf "/%h/%f\n" >> filelist.lst
fi
if [ -d usr/lib64 ]; then
find usr/lib64 -type f -printf "/%h/%f\n" >> filelist.lst
fi
if [ -d usr/bin ]; then
find usr/bin -type f -printf "/%h/%f\n" >> filelist.lst
fi
if [ -d usr/sbin ]; then
find usr/sbin -type f -printf "/%h/%f\n" >> filelist.lst
fi
touch doclist.lst
if [ -d usr/share/man ]; then
find usr/share/man -type f -printf "/%h/%f.gz\n" >> doclist.lst
fi
popd
mv %{buildroot}/filelist.lst .
mv %{buildroot}/doclist.lst .
%files -n python3-inexactsearch -f filelist.lst
%dir %{python3_sitelib}/*
%files help -f doclist.lst
%{_docdir}/*
%changelog
* Fri May 05 2023 Python_Bot <Python_Bot@openeuler.org> - 1.0.2-1
- Package Spec generated
|
