Metadata-Version: 2.1
Name: matchtext
Version: 0.2.1
Summary: Fast text/token matching and replacement
Home-page: https://github.com/johann-petrak/matchtext
Author: Johann Petrak
Author-email: johann.petrak@gmail.com
License: apache
Project-URL: Documentation, https://github.com/johann-petrak/matchtext
Platform: any
Classifier: License :: OSI Approved :: Apache Software License
Classifier: Development Status :: 3 - Alpha
Classifier: Programming Language :: Python :: 3
Classifier: Intended Audience :: Developers
Classifier: Topic :: Text Processing
Description-Content-Type: text/markdown; charset=UTF-8; variant=GFM
Provides-Extra: testing
Requires-Dist: pytest ; extra == 'testing'
Requires-Dist: pytest-cov ; extra == 'testing'

# Python matchtext


[![PyPi version](https://img.shields.io/pypi/v/matchtext.svg)](https://pypi.python.org/pypi/matchtext/)
[![Python compatibility](https://img.shields.io/pypi/pyversions/matchtext.svg)](https://pypi.python.org/pypi/matchtext/)


**NOTE: at the moment this is still very much in development and large parts are not implemented yet!**

Python 3 package for fast text matching and replacing.

This library implements two fast approaches for matching keywords/gazetteer entries:
* TokenMatcher: keywords/gazetteer entries are sequences of tokens, optionally associated with some data and 
  the matcher tries to match any of those in a given sequence of tokens. 
* StringMatcher: keywords/gazetter entries are strings, optionally associated with some data and 
  the matcher tries to match any of those in a given string, optionally only at non-word boundaries.

The matchers are implemented to be fast and memory-efficient: TokenMatcher is a hash tree, StringMatcher uses an efficient 
character trie implementation underneath. Both matchers implement additional features often required in NLP:
* mapfunc: tokens/characters can be mapped to some canonical form that is used for matching
* ignorefunc: some tokens/characters can be entirely ignored for matching
* match all/longest: only match the longest entry versus all entries
* skip/noskip: if any match is found, continue matching after the longest match versus at the next position


## Tests

To run the tests manually and get any print output on the console:
```
PYTHONPATH=`pwd` pytest -s 
```


