From 52d9bc351a59a85c208d71b6a305ec9c8ceccc4c Mon Sep 17 00:00:00 2001 From: Caleb Hattingh Date: Sun, 19 Mar 2017 07:57:58 +1000 Subject: [PATCH] Fix typos --- i18n/README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/i18n/README.md b/i18n/README.md index 3a8dfe6..9707ef4 100644 --- a/i18n/README.md +++ b/i18n/README.md @@ -35,7 +35,7 @@ I went to town on this problem because I wasn't sure what the best approach was: * "naive": Converts the pattern to a regular expression and sequentially scans a word list. The implementation is pretty straight-forward. -* "sets": Coverts the word dictionary into a mapping of +* "sets": Converts the word dictionary into a mapping of (*\*, *\*, *\*) => *\* so matching becomes a series of set intersections. @@ -47,7 +47,7 @@ I went to town on this problem because I wasn't sure what the best approach was: least one intermediate set is small e.g. "i18n" leads to a single intersection operation between a length 23 set and a length 11 set. -* "prefix": Coverts the word dictionary into a mapping of +* "prefix": Converts the word dictionary into a mapping of *\* => *\* so matching involves maintaining a work queue of prefix trees to traverse in parallel.