Slides - University of Washington

More documents

Recommendations

Info

University of Washington Ling472 Introduction to Computational Linguistics Lecture 1: Introduction More RegEx * accepts zero or more of the preceding element this is the canonical ‘greedy’ operator ? accepts zero or one of the preceding element(s) + accepts one or more of the preceding element(s) {n} accepts n of the preceding element(s) {n,} accepts n or more of the preceding element(s) {n,m} accepts n to m of the preceding element(s) (pattern) defines a capture group which can be referred to later via \1 Monday, April 1, 2013 54
University of Washington Ling472 Introduction to Computational Linguistics Lecture 1: Introduction RegEx examples • abc • a|bc • (a|bb)c • a[bc] • a*b • a?b • [â]*th[aeiou]+[a‐z]* • â • â.*z$ • \bthe\b Monday, April 1, 2013 55
Page 1 and 2:
University of Washington Ling472 In
Page 3 and 4: University of Washington Ling472 In
Page 53: University of Washington Ling472 In
show all

Slides - University of Washington

Create successful ePaper yourself

Delete template?

Save as template?