Stanford NLP: Regular Expressions, Tokenisation, Normalisation, Stemming and Sentence Segmentation

Regular Expressions A formal language for specifying text strings. Note to use regexpal.com to practically learn about regular expression. Disjunctions Letters inside square brackets [] : e.g. [wW]oodchuck means it would match Woodchuck or woodchuck Ranges : e.g [0-9], [A-Z], [a-z] Negation in Disjunctions (^ means negation only when first in …