Find parts of long text or data, allowing for some changes/typos.
Go to file
Tal Einat adfc13f79d updated license copyright notice to 2015 and added a link to the license in the README 2015-01-31 21:20:05 +02:00
benchmarks updated benchmarks 2014-05-16 12:18:05 +03:00
docs finished fixing docs/conf.py for readthedocs.org 2014-05-05 19:22:32 +03:00
fuzzysearch bugfix: free memory upon early exit from C subs-only functions 2014-06-04 04:25:12 +03:00
tests skip tests of kmp_memmem, since it is broken (memory leak) 2015-01-31 20:43:44 +02:00
.coveragerc TracisCI and Coveralls integration WIP 2014-04-19 17:35:47 +03:00
.gitignore added docs/_build to .gitignore 2014-05-07 00:24:49 +03:00
.travis.yml simplified tox and TravisCI infrastructure, now that they properly support Python 3.4 2015-01-31 16:05:51 +02:00
AUTHORS.rst initial commit (project framework) 2013-11-02 00:34:18 +02:00
CONTRIBUTING.rst initial commit (project framework) 2013-11-02 00:34:18 +02:00
HISTORY.rst version 0.2.2 2014-03-27 15:36:43 +02:00
LICENSE updated license copyright notice to 2015 and added a link to the license in the README 2015-01-31 21:20:05 +02:00
MANIFEST.in added wordlen_memmem files to setup.py and MANIFEST.in 2015-01-31 18:26:31 +02:00
Makefile Makefile fixes 2014-04-23 00:32:21 +03:00
README.rst updated license copyright notice to 2015 and added a link to the license in the README 2015-01-31 21:20:05 +02:00
nose2.cfg added C extensions and changed to single-source code 2014-04-19 01:31:32 +03:00
requirements.txt removed the no longer needed version limit on the 'six' library 2015-01-31 20:43:25 +02:00
setup.py added wordlen_memmem files to setup.py and MANIFEST.in 2015-01-31 18:26:31 +02:00
test_requirements.txt fixed requirements and working on TracisCI and Coveralls integration 2014-04-19 02:13:16 +03:00
tox.ini removed no longer necessary workaround for nose2 + argparse issue on Python 2.6 2015-01-31 20:57:18 +02:00

README.rst

===============================
fuzzysearch
===============================

.. image:: https://badge.fury.io/py/fuzzysearch.png
    :target: http://badge.fury.io/py/fuzzysearch

.. image:: https://travis-ci.org/taleinat/fuzzysearch.png?branch=master
        :target: https://travis-ci.org/taleinat/fuzzysearch

.. image:: https://coveralls.io/repos/taleinat/fuzzysearch/badge.png
        :target: https://coveralls.io/r/taleinat/fuzzysearch

.. image:: https://pypip.in/d/fuzzysearch/badge.png
        :target: https://crate.io/packages/fuzzysearch?version=latest

fuzzysearch is useful for finding approximate subsequence matches

* Free software: `MIT license <LICENSE>`_
* Documentation: http://fuzzysearch.rtfd.org.

Features
--------

* Fuzzy sub-sequence search: Find parts of a sequence which match a given
  sub-sequence up to a given maximum Levenshtein distance.
* Set individual limits for the number of substitutions, insertions and/or
  deletions allowed for a near-match.
* Includes optimized implementations for specific use-cases, e.g. only allowing
  substitutions in near-matches.

Simple Example
--------------
You can usually just use the `find_near_matches()` utility function, which
chooses a suitable fuzzy search implementation according to the given
parameters:

.. code:: python

    >>> from fuzzysearch import find_near_matches
    >>> find_near_matches('PATTERN', 'aaaPATERNaaa', max_l_dist=1)
    [Match(start=3, end=9, dist=1)]

Advanced Example
----------------
If needed you can choose a specific search implementation, such as
`find_near_matches_with_ngrams()`:

.. code:: python

    >>> sequence = '''\
    GACTAGCACTGTAGGGATAACAATTTCACACAGGTGGACAATTACATTGAAAATCACAGATTGGTCACACACACA
    TTGGACATACATAGAAACACACACACATACATTAGATACGAACATAGAAACACACATTAGACGCGTACATAGACA
    CAAACACATTGACAGGCAGTTCAGATGATGACGCCCGACTGATACTCGCGTAGTCGTGGGAGGCAAGGCACACAG
    GGGATAGG'''
    >>> subsequence = 'TGCACTGTAGGGATAACAAT' #distance 1
    >>> max_distance = 2

    >>> from fuzzysearch import find_near_matches_with_ngrams
    >>> find_near_matches_with_ngrams(subsequence, sequence, max_distance)
    [Match(start=3, end=24, dist=1)]