2014-07-06 23:15:59 +00:00
|
|
|
#!/bin/sed -f
|
|
|
|
|
|
|
|
|
|
# Sed script to produce Penn Treebank tokenization on arbitrary raw text.
|
|
|
|
|
# Yeah, sure.
|
|
|
|
|
|
|
|
|
|
# expected input: raw text with ONE SENTENCE TOKEN PER LINE
|
|
|
|
|
|
|
|
|
|
# by Robert MacIntyre, University of Pennsylvania, late 1995.
|
|
|
|
|
|
|
|
|
|
# If this wasn't such a trivial program, I'd include all that stuff about
|
|
|
|
|
# no warrantee, free use, etc. from the GNU General Public License. If you
|
|
|
|
|
# want to be picky, assume that all of its terms apply. Okay?
|
|
|
|
|
|
|
|
|
|
# attempt to get correct directional quotes
|
|
|
|
|
s=^"=`` =g
|
|
|
|
|
s=\([ ([{<]\)"=\1 `` =g
|
|
|
|
|
# close quotes handled at end
|
|
|
|
|
|
|
|
|
|
s=\.\.\.= ... =g
|
|
|
|
|
s=[,;:@#$%&]= & =g
|
|
|
|
|
|
|
|
|
|
# Assume sentence tokenization has been done first, so split FINAL periods
|
2015-04-19 08:31:31 +00:00
|
|
|
# only.
|
2014-07-06 23:15:59 +00:00
|
|
|
s=\([^.]\)\([.]\)\([])}>"']*\)[ ]*$=\1 \2\3 =g
|
|
|
|
|
# however, we may as well split ALL question marks and exclamation points,
|
|
|
|
|
# since they shouldn't have the abbrev.-marker ambiguity problem
|
|
|
|
|
s=[?!]= & =g
|
|
|
|
|
|
|
|
|
|
# parentheses, brackets, etc.
|
|
|
|
|
s=[][(){}<>]= & =g
|
|
|
|
|
# Some taggers, such as Adwait Ratnaparkhi's MXPOST, use the parsed-file
|
|
|
|
|
# version of these symbols.
|
|
|
|
|
# UNCOMMENT THE FOLLOWING 6 LINES if you're using MXPOST.
|
|
|
|
|
# s/(/-LRB-/g
|
|
|
|
|
# s/)/-RRB-/g
|
|
|
|
|
# s/\[/-LSB-/g
|
|
|
|
|
# s/\]/-RSB-/g
|
|
|
|
|
# s/{/-LCB-/g
|
|
|
|
|
# s/}/-RCB-/g
|
|
|
|
|
|
|
|
|
|
s=--= -- =g
|
|
|
|
|
|
|
|
|
|
# NOTE THAT SPLIT WORDS ARE NOT MARKED. Obviously this isn't great, since
|
|
|
|
|
# you might someday want to know how the words originally fit together --
|
|
|
|
|
# but it's too late to make a better system now, given the millions of
|
|
|
|
|
# words we've already done "wrong".
|
|
|
|
|
|
|
|
|
|
# First off, add a space to the beginning and end of each line, to reduce
|
|
|
|
|
# necessary number of regexps.
|
|
|
|
|
s=$= =
|
|
|
|
|
s=^= =
|
|
|
|
|
|
|
|
|
|
s="= '' =g
|
|
|
|
|
# possessive or close-single-quote
|
|
|
|
|
s=\([^']\)' =\1 ' =g
|
|
|
|
|
# as in it's, I'm, we'd
|
|
|
|
|
s='\([sSmMdD]\) = '\1 =g
|
|
|
|
|
s='ll = 'll =g
|
|
|
|
|
s='re = 're =g
|
|
|
|
|
s='ve = 've =g
|
|
|
|
|
s=n't = n't =g
|
|
|
|
|
s='LL = 'LL =g
|
|
|
|
|
s='RE = 'RE =g
|
|
|
|
|
s='VE = 'VE =g
|
|
|
|
|
s=N'T = N'T =g
|
|
|
|
|
|
|
|
|
|
s= \([Cc]\)annot = \1an not =g
|
|
|
|
|
s= \([Dd]\)'ye = \1' ye =g
|
|
|
|
|
s= \([Gg]\)imme = \1im me =g
|
|
|
|
|
s= \([Gg]\)onna = \1on na =g
|
|
|
|
|
s= \([Gg]\)otta = \1ot ta =g
|
|
|
|
|
s= \([Ll]\)emme = \1em me =g
|
|
|
|
|
s= \([Mm]\)ore'n = \1ore 'n =g
|
|
|
|
|
s= '\([Tt]\)is = '\1 is =g
|
|
|
|
|
s= '\([Tt]\)was = '\1 was =g
|
|
|
|
|
s= \([Ww]\)anna = \1an na =g
|
|
|
|
|
# s= \([Ww]\)haddya = \1ha dd ya =g
|
|
|
|
|
# s= \([Ww]\)hatcha = \1ha t cha =g
|
|
|
|
|
|
|
|
|
|
# clean out extra spaces
|
|
|
|
|
s= *= =g
|
|
|
|
|
s=^ *==g
|
