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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
|
%global _empty_manifest_terminate_build 0
Name: python-ahocorapy
Version: 1.6.2
Release: 1
Summary: ahocorapy - Pure python ahocorasick implementation
License: MIT
URL: https://github.com/abusix/ahocorapy
Source0: https://mirrors.nju.edu.cn/pypi/web/packages/38/d7/81b1d1533896d72186add63e3dd2fb70142aede6cc8a3cc48bf8a6d51002/ahocorapy-1.6.2.tar.gz
BuildArch: noarch
Requires: python3-future
%description
[](https://github.com/abusix/ahocorapy/actions)
[](https://codecov.io/gh/abusix/ahocorapy)
[](https://pepy.tech/project/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
# ahocorapy - Fast Many-Keyword Search in Pure Python
ahocorapy is a pure python implementation of the Aho-Corasick Algorithm.
Given a list of keywords one can check if at least one of the keywords exist in a given text in linear time.
## Comparison:
### Why another Aho-Corasick implementation?
We started working on this in the beginning of 2016. Our requirements included unicode support combined with python2.7. That
was impossible with C-extension based libraries (like [pyahocorasick](https://github.com/WojciechMula/pyahocorasick/)). Pure
python libraries were very slow or unusable due to memory explosion. Since then another pure python library was released
[py-aho-corasick](https://github.com/JanFan/py-aho-corasick). The repository also contains some discussion about different
implementations.
There is also [acora](https://github.com/scoder/acora), but it includes the note ('current construction algorithm is not
suitable for really large sets of keywords') which really was the case the last time I tested, because RAM ran out quickly.
### Differences
- Compared to [pyahocorasick](https://github.com/WojciechMula/pyahocorasick/) our library supports unicode in python 2.7 just like [py-aho-corasick](https://github.com/JanFan/py-aho-corasick).
We don't use any C-Extension so the library is not platform dependant.
- On top of the standard Aho-Corasick longest suffix search, we also perform a shortcutting routine in the end, so
that our lookup is fast while, the setup takes longer. During set up we go through the states and directly add transitions that are
"offered" by the longest suffix or their longest suffixes. This leads to faster lookup times, because in the end we only have to
follow simple transitions and don't have to perform any additional suffix lookup. It also leads to a bigger memory footprint,
because the number of transitions is higher, because they are all included explicitely and not implicitely hidden by suffix pointers.
- We added a small tool that helps you visualize the resulting graph. This may help understanding the algorithm, if you'd like. See below.
- Fully pickleable (pythons built-in de-/serialization). ahocorapy uses a non-recursive custom implementation for de-/serialization so that even huge keyword trees can be pickled.
### Performance
I compared the two libraries mentioned above with ahocorapy. We used 50,000 keywords long list and an input text of 34,199 characters.
In the text only one keyword of the list is contained.
The setup process was run once per library and the search process was run 100 times. The following results are in seconds (not averaged for the lookup).
You can perform this test yourself using `python tests/ahocorapy_performance_test.py`. (Except for the pyahocorasick_py results. These were taken by importing the
pure python version of the code of [pyahocorasick](https://github.com/WojciechMula/pyahocorasick/). It's not available through pypi
as stated in the code.)
I also added measurements for the pure python libraries with run with pypy.
These are the results:
| Library (Variant) | Setup (1x) | Search (100x) |
| ------------------------------------------------------ | ---------- | ------------- |
| ahocorapy\* | 0.30s | 0.29s |
| ahocorapy (run with pypy)\* | 0.37s | 0.10s |
| pyahocorasick\* | 0.04s | 0.04s |
| pyahocorasick (run with pypy)\* | 0.10s | 0.05s |
| pyahocorasick (pure python variant in github repo)\*\* | 0.50s | 1.68s |
| py_aho_corasick\* | 0.72s | 4,60s |
| py_aho_corasick (run with pypy)\* | 0.83s | 2.02s |
As expected the C-Extension shatters the pure python implementations. Even though there is probably still room for optimization in
ahocorapy we are not going to get to the mark that pyahocorasick sets. ahocorapy's lookups are faster than py_aho_corasick.
When run with pypy ahocorapy is almost as fast as pyahocorasick, at least when it comes to
searching. The setup overhead is higher due to the suffix shortcutting mechanism used.
\* Specs
CPU: AMD Ryzen 2700X
Linux Kernel: 6.0.6
CPython: 3.11.0
pypy: PyPy 7.3.9 (Python 3.9.12) with GCC 10.2.1 20210130
Date tested: 2022-11-22
\*\* Old measurement with different specs
## Basic Usage:
### Installation
```
pip install ahocorapy
```
### Creation of the Search Tree
```python
from ahocorapy.keywordtree import KeywordTree
kwtree = KeywordTree(case_insensitive=True)
kwtree.add('malaga')
kwtree.add('lacrosse')
kwtree.add('mallorca')
kwtree.add('mallorca bella')
kwtree.add('orca')
kwtree.finalize()
```
### Searching
```python
result = kwtree.search('My favorite islands are malaga and sylt.')
print(result)
```
Prints :
```python
('malaga', 24)
```
The search_all method returns a generator for all keywords found, or None if there is none.
```python
results = kwtree.search_all('malheur on mallorca bellacrosse')
for result in results:
print(result)
```
Prints :
```python
('mallorca', 11)
('orca', 15)
('mallorca bella', 11)
('lacrosse', 23)
```
### Thread Safety
The construction of the tree is currently NOT thread safe. That means `add`ing shouldn't be called multiple times concurrently. Behavior is undefined.
After `finalize` is called you can use the `search` functionality on the same tree from multiple threads at the same time. So that part is thread safe.
## Drawing Graph
You can print the underlying graph with the Visualizer class.
This feature requires a working pygraphviz library installed.
```python
from ahocorapy_visualizer.visualizer import Visualizer
visualizer = Visualizer()
visualizer.draw('readme_example.png', kwtree)
```
The resulting .png of the graph looks like this:
%package -n python3-ahocorapy
Summary: ahocorapy - Pure python ahocorasick implementation
Provides: python-ahocorapy
BuildRequires: python3-devel
BuildRequires: python3-setuptools
BuildRequires: python3-pip
%description -n python3-ahocorapy
[](https://github.com/abusix/ahocorapy/actions)
[](https://codecov.io/gh/abusix/ahocorapy)
[](https://pepy.tech/project/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
# ahocorapy - Fast Many-Keyword Search in Pure Python
ahocorapy is a pure python implementation of the Aho-Corasick Algorithm.
Given a list of keywords one can check if at least one of the keywords exist in a given text in linear time.
## Comparison:
### Why another Aho-Corasick implementation?
We started working on this in the beginning of 2016. Our requirements included unicode support combined with python2.7. That
was impossible with C-extension based libraries (like [pyahocorasick](https://github.com/WojciechMula/pyahocorasick/)). Pure
python libraries were very slow or unusable due to memory explosion. Since then another pure python library was released
[py-aho-corasick](https://github.com/JanFan/py-aho-corasick). The repository also contains some discussion about different
implementations.
There is also [acora](https://github.com/scoder/acora), but it includes the note ('current construction algorithm is not
suitable for really large sets of keywords') which really was the case the last time I tested, because RAM ran out quickly.
### Differences
- Compared to [pyahocorasick](https://github.com/WojciechMula/pyahocorasick/) our library supports unicode in python 2.7 just like [py-aho-corasick](https://github.com/JanFan/py-aho-corasick).
We don't use any C-Extension so the library is not platform dependant.
- On top of the standard Aho-Corasick longest suffix search, we also perform a shortcutting routine in the end, so
that our lookup is fast while, the setup takes longer. During set up we go through the states and directly add transitions that are
"offered" by the longest suffix or their longest suffixes. This leads to faster lookup times, because in the end we only have to
follow simple transitions and don't have to perform any additional suffix lookup. It also leads to a bigger memory footprint,
because the number of transitions is higher, because they are all included explicitely and not implicitely hidden by suffix pointers.
- We added a small tool that helps you visualize the resulting graph. This may help understanding the algorithm, if you'd like. See below.
- Fully pickleable (pythons built-in de-/serialization). ahocorapy uses a non-recursive custom implementation for de-/serialization so that even huge keyword trees can be pickled.
### Performance
I compared the two libraries mentioned above with ahocorapy. We used 50,000 keywords long list and an input text of 34,199 characters.
In the text only one keyword of the list is contained.
The setup process was run once per library and the search process was run 100 times. The following results are in seconds (not averaged for the lookup).
You can perform this test yourself using `python tests/ahocorapy_performance_test.py`. (Except for the pyahocorasick_py results. These were taken by importing the
pure python version of the code of [pyahocorasick](https://github.com/WojciechMula/pyahocorasick/). It's not available through pypi
as stated in the code.)
I also added measurements for the pure python libraries with run with pypy.
These are the results:
| Library (Variant) | Setup (1x) | Search (100x) |
| ------------------------------------------------------ | ---------- | ------------- |
| ahocorapy\* | 0.30s | 0.29s |
| ahocorapy (run with pypy)\* | 0.37s | 0.10s |
| pyahocorasick\* | 0.04s | 0.04s |
| pyahocorasick (run with pypy)\* | 0.10s | 0.05s |
| pyahocorasick (pure python variant in github repo)\*\* | 0.50s | 1.68s |
| py_aho_corasick\* | 0.72s | 4,60s |
| py_aho_corasick (run with pypy)\* | 0.83s | 2.02s |
As expected the C-Extension shatters the pure python implementations. Even though there is probably still room for optimization in
ahocorapy we are not going to get to the mark that pyahocorasick sets. ahocorapy's lookups are faster than py_aho_corasick.
When run with pypy ahocorapy is almost as fast as pyahocorasick, at least when it comes to
searching. The setup overhead is higher due to the suffix shortcutting mechanism used.
\* Specs
CPU: AMD Ryzen 2700X
Linux Kernel: 6.0.6
CPython: 3.11.0
pypy: PyPy 7.3.9 (Python 3.9.12) with GCC 10.2.1 20210130
Date tested: 2022-11-22
\*\* Old measurement with different specs
## Basic Usage:
### Installation
```
pip install ahocorapy
```
### Creation of the Search Tree
```python
from ahocorapy.keywordtree import KeywordTree
kwtree = KeywordTree(case_insensitive=True)
kwtree.add('malaga')
kwtree.add('lacrosse')
kwtree.add('mallorca')
kwtree.add('mallorca bella')
kwtree.add('orca')
kwtree.finalize()
```
### Searching
```python
result = kwtree.search('My favorite islands are malaga and sylt.')
print(result)
```
Prints :
```python
('malaga', 24)
```
The search_all method returns a generator for all keywords found, or None if there is none.
```python
results = kwtree.search_all('malheur on mallorca bellacrosse')
for result in results:
print(result)
```
Prints :
```python
('mallorca', 11)
('orca', 15)
('mallorca bella', 11)
('lacrosse', 23)
```
### Thread Safety
The construction of the tree is currently NOT thread safe. That means `add`ing shouldn't be called multiple times concurrently. Behavior is undefined.
After `finalize` is called you can use the `search` functionality on the same tree from multiple threads at the same time. So that part is thread safe.
## Drawing Graph
You can print the underlying graph with the Visualizer class.
This feature requires a working pygraphviz library installed.
```python
from ahocorapy_visualizer.visualizer import Visualizer
visualizer = Visualizer()
visualizer.draw('readme_example.png', kwtree)
```
The resulting .png of the graph looks like this:
%package help
Summary: Development documents and examples for ahocorapy
Provides: python3-ahocorapy-doc
%description help
[](https://github.com/abusix/ahocorapy/actions)
[](https://codecov.io/gh/abusix/ahocorapy)
[](https://pepy.tech/project/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
[](https://pypi.python.org/pypi/ahocorapy)
# ahocorapy - Fast Many-Keyword Search in Pure Python
ahocorapy is a pure python implementation of the Aho-Corasick Algorithm.
Given a list of keywords one can check if at least one of the keywords exist in a given text in linear time.
## Comparison:
### Why another Aho-Corasick implementation?
We started working on this in the beginning of 2016. Our requirements included unicode support combined with python2.7. That
was impossible with C-extension based libraries (like [pyahocorasick](https://github.com/WojciechMula/pyahocorasick/)). Pure
python libraries were very slow or unusable due to memory explosion. Since then another pure python library was released
[py-aho-corasick](https://github.com/JanFan/py-aho-corasick). The repository also contains some discussion about different
implementations.
There is also [acora](https://github.com/scoder/acora), but it includes the note ('current construction algorithm is not
suitable for really large sets of keywords') which really was the case the last time I tested, because RAM ran out quickly.
### Differences
- Compared to [pyahocorasick](https://github.com/WojciechMula/pyahocorasick/) our library supports unicode in python 2.7 just like [py-aho-corasick](https://github.com/JanFan/py-aho-corasick).
We don't use any C-Extension so the library is not platform dependant.
- On top of the standard Aho-Corasick longest suffix search, we also perform a shortcutting routine in the end, so
that our lookup is fast while, the setup takes longer. During set up we go through the states and directly add transitions that are
"offered" by the longest suffix or their longest suffixes. This leads to faster lookup times, because in the end we only have to
follow simple transitions and don't have to perform any additional suffix lookup. It also leads to a bigger memory footprint,
because the number of transitions is higher, because they are all included explicitely and not implicitely hidden by suffix pointers.
- We added a small tool that helps you visualize the resulting graph. This may help understanding the algorithm, if you'd like. See below.
- Fully pickleable (pythons built-in de-/serialization). ahocorapy uses a non-recursive custom implementation for de-/serialization so that even huge keyword trees can be pickled.
### Performance
I compared the two libraries mentioned above with ahocorapy. We used 50,000 keywords long list and an input text of 34,199 characters.
In the text only one keyword of the list is contained.
The setup process was run once per library and the search process was run 100 times. The following results are in seconds (not averaged for the lookup).
You can perform this test yourself using `python tests/ahocorapy_performance_test.py`. (Except for the pyahocorasick_py results. These were taken by importing the
pure python version of the code of [pyahocorasick](https://github.com/WojciechMula/pyahocorasick/). It's not available through pypi
as stated in the code.)
I also added measurements for the pure python libraries with run with pypy.
These are the results:
| Library (Variant) | Setup (1x) | Search (100x) |
| ------------------------------------------------------ | ---------- | ------------- |
| ahocorapy\* | 0.30s | 0.29s |
| ahocorapy (run with pypy)\* | 0.37s | 0.10s |
| pyahocorasick\* | 0.04s | 0.04s |
| pyahocorasick (run with pypy)\* | 0.10s | 0.05s |
| pyahocorasick (pure python variant in github repo)\*\* | 0.50s | 1.68s |
| py_aho_corasick\* | 0.72s | 4,60s |
| py_aho_corasick (run with pypy)\* | 0.83s | 2.02s |
As expected the C-Extension shatters the pure python implementations. Even though there is probably still room for optimization in
ahocorapy we are not going to get to the mark that pyahocorasick sets. ahocorapy's lookups are faster than py_aho_corasick.
When run with pypy ahocorapy is almost as fast as pyahocorasick, at least when it comes to
searching. The setup overhead is higher due to the suffix shortcutting mechanism used.
\* Specs
CPU: AMD Ryzen 2700X
Linux Kernel: 6.0.6
CPython: 3.11.0
pypy: PyPy 7.3.9 (Python 3.9.12) with GCC 10.2.1 20210130
Date tested: 2022-11-22
\*\* Old measurement with different specs
## Basic Usage:
### Installation
```
pip install ahocorapy
```
### Creation of the Search Tree
```python
from ahocorapy.keywordtree import KeywordTree
kwtree = KeywordTree(case_insensitive=True)
kwtree.add('malaga')
kwtree.add('lacrosse')
kwtree.add('mallorca')
kwtree.add('mallorca bella')
kwtree.add('orca')
kwtree.finalize()
```
### Searching
```python
result = kwtree.search('My favorite islands are malaga and sylt.')
print(result)
```
Prints :
```python
('malaga', 24)
```
The search_all method returns a generator for all keywords found, or None if there is none.
```python
results = kwtree.search_all('malheur on mallorca bellacrosse')
for result in results:
print(result)
```
Prints :
```python
('mallorca', 11)
('orca', 15)
('mallorca bella', 11)
('lacrosse', 23)
```
### Thread Safety
The construction of the tree is currently NOT thread safe. That means `add`ing shouldn't be called multiple times concurrently. Behavior is undefined.
After `finalize` is called you can use the `search` functionality on the same tree from multiple threads at the same time. So that part is thread safe.
## Drawing Graph
You can print the underlying graph with the Visualizer class.
This feature requires a working pygraphviz library installed.
```python
from ahocorapy_visualizer.visualizer import Visualizer
visualizer = Visualizer()
visualizer.draw('readme_example.png', kwtree)
```
The resulting .png of the graph looks like this:
%prep
%autosetup -n ahocorapy-1.6.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-ahocorapy -f filelist.lst
%dir %{python3_sitelib}/*
%files help -f doclist.lst
%{_docdir}/*
%changelog
* Fri Apr 21 2023 Python_Bot <Python_Bot@openeuler.org> - 1.6.2-1
- Package Spec generated
|
