Using fuzzy searches with tre-agrep
Choosing tre-agrep
Note that tre-agrep is not a complete replacement for grep. Grep has several options that tre-agrep lacks, including options for defining how directories and binary files are handled, as well as the ability to stop after a set number of results. Such options would be equally useful in tre-agrep.
Still, in typical searches, tre-agrep can be a drop-in replacement for grep, and because its ability to handle regular expressions is roughly equal to grep's, that should not be surprising.
However, what truly sets tre-agrep apart is not only its ability to handle approximations, but the simplicity with which approximations are implemented. Aside from a few basic examples, to get the most from regular expressions requires neither extensive memorization nor frequent consultations with man or web pages. Neither alternative holds much appeal for average users.
By contrast, approximations in tre-agrep usually get results without the need to be familiar with regular expressions. For that reason alone, you might consider tre-agrep as grep's replacement.
Infos
- grep: https://en.wikipedia.org/wiki/Grep
- egrep: http://linux.about.com/library/cmd/blcmdl1_egrep.htm
- fgrep: http://linux.about.com/library/cmd/blcmdl1_fgrep.htm
- TRE: https://github.com/laurikari/tre/
- agrep: https://github.com/Wikinaut/agrep
- agrep copyright: https://raw.githubusercontent.com/Wikinaut/agrep/master/COPYRIGHT
- Levenshtein distance: https://en.wikipedia.org/wiki/Levenshtein_distance
- Regular expressions: http://www.cyberciti.biz/faq/grep-regular-expressions/
« Previous 1 2
Buy this article as PDF
(incl. VAT)