lmkirvan/textTries: Tries for Fast Replacement of Big Dictionaries
This package uses the data.tree package to create tries that use a modified form of the aho-corasick algorithm to allow finding and replacing large numbers of dictionary keys in a text. Really only makes sense when your dictionary is quite large (> 500 terms). Useful for things like entity resolution in texts. Should probably be reimplimented in c++ to make it super fast...¯\_(ツ)_/¯.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | person("Lewis", "Kirvan", email = "kirvan.lewis@gmail.com", role = c("aut", "cre")) |
| Maintainer | The package maintainer <yourself@somewhere.net> |
| License | What license is it under? |
| Version | 0.1.0 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
