Skip to content

Fix typos #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fix typos #5

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions i18n/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
(*\<char\>*, *\<index of char\>*, *\<length\>*) => *\<set of words\>*
so matching becomes a series of set intersections.

Expand All @@ -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
*\<length\>* => *\<prefix tree\>* so matching involves maintaining
a work queue of prefix trees to traverse in parallel.

Expand Down