Match words using unicode property matching #89
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Feel free to close this if it's not in line with your vision of things, but this seems to be an effective solve for #55.
This uses unicode property matching to simplify word matching (see https://javascript.info/regexp-unicode)
/P{Z}*-> Matches 0 or more of anything that is not a separator (eg, space, tab, newline)[\p{L}\p{N}]-> Matches anything that is a letter or a numberThis is based on @jon-heard 's algorithm, and defines a word as anything that contains at least one letter or a number (as defined by the host language) and no spaces/tabs/etc...