From 9a0c56b1a9a73808f8c5bf512435610e61580d28 Mon Sep 17 00:00:00 2001 From: Herman Leung Date: Wed, 24 Jun 2020 13:44:33 +0800 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index f6d2450..d7f5f6d 100644 --- a/README.md +++ b/README.md @@ -5,7 +5,7 @@ [**trieregex**](https://github.com/ermanh/trieregex/) creates efficient regular expressions (regexes) by storing a list of words in a [trie](https://en.wikipedia.org/wiki/Trie) structure, and translating the trie into a more compact pattern. -The speed performance of a trie-based regex (e.g., `r'(?:under(?:sta(?:nd|te)|take|go))'`) -- compared to a flat regex union (i.e., `r'(?:understand|understate|undertake|undergo)'`) -- becomes apparent when using extremely large word lists, and especially when more specific or complicated contexts are specified at the boundaries. The processing time of this package itself is also minimized with [memoization](https://en.wikipedia.org/wiki/Memoization). +The speed performance of a trie-based regex (e.g., `r'under(?:sta(?:nd|te)|take|go)'`) -- compared to a flat regex union (i.e., `r'(?:understand|understate|undertake|undergo)'`) -- becomes apparent when using extremely large word lists, and especially when more specific or complicated contexts are specified at the boundaries. The processing time of this package itself is also minimized with [memoization](https://en.wikipedia.org/wiki/Memoization). ## Installation