HTML Escaping - Reg expressions?

Question

I'd like to HTML escape a specific phrase automatically and logically that is currently a statement with words highlighted with quotation marks. Within the statement, quotation or inch marks could also be used to describe a distance.

The phrase could be:

Paul said "It missed us by about a foot". In fact it was only about 9".

To escape this phrase It should really be

<pre>Paul said &ldquo;It missed us by about a foot&rdquo;.  
In fact it was only about 9&prime;.</pre>

Which gives

<pre>Paul said “It missed us by about a foot”. 
     In fact it was only about 9″.</pre>

I can't think of a sample phrase to add in a " escape as well but that could be there!

I'm looking for some help on how to identify which of the escape values to replace " characters with at runtime. The phrase was just an example and it could be anything but should be correctly formed i.e. an opening and closing quote would be present if we are to correctly escape the text.

Would I use a regular expression to find a quoted phrase in the text i.e. two " " characters before a full stop and then replace the first then the second. with

“

then

”    

If I found one " replace it with a "
unless it was after a number where I replace it with

″

How would I deal with multiple quotes within a sentence?

"It just missed" Paul said "by a foot".  

This would really stump me.....

<pre>"It just missed" Paul said "by 9" almost".</pre>

The above should read when escaped correctly. (I'm showing the actual characters this time)

“It just missed” Paul said “by 9″ almost”.

Obviously an edge case but I wondered if it's possible to escape this at runtime without an understanding of the content? If not help on the more obvious phrases would be appreciated.

Answer 1

I would do this in two passes:

The first pass searches for any "s which are immediately preceded by numbers and does that replacement:

s/([0-9])"/\1″/g

Depending on the text you're dealing with, you may want/need to extend this regex to also recognize numbers that are spelled out as words; I've only checked for digits for the sake of simplicity.

With all of those taken care of, a second pass can then easily convert pairs of "s as you've described:

s/"([^"]*)"/“\1”/g

Note the use of [^"]* rather than .* - we want to find two sets of double-quotes with any number of non-double-quote characters between them. By adding that restriction, there won't be any problems handling strings with multiple quoted sections. (This could also be accomplished using the non-greedy .*?, but a negated character class more clearly states your intent and, in most regex implementations, is more efficient.)

A stray, mismatched " somewhere in the string, or an inch marker which is missed by the first pass, can still cause problems, of course, but there's no way to avoid that possibility without implementing understanding of the content.

Answer 2

what you've described is basically a hidden markov model,

http://en.wikipedia.org/wiki/Hidden_Markov_model

you have a set of input symbols (your original text and ambiguous punctuation), and a set of output symbols (original text and more fine-grained punctuation) but no good way of really observing the connection between the two in a programmatic way. you could write some rules to cover some of the edge cases, but that will basically never work for the multiple quotes situation. in this case you can't really use a regex for the same reason, but with an hmm, and a bunch of training text you could probably mmake some pretty good guesses.

sorry that's probably not very helpful if you're trying to get something ready for deployment, but the input has greater ambiguity than the output, so your only option is to consider the context, and that basically means either a very lengthy set of rules, or some kind of machine learning approach.

interesting question though - it would be neat to see what kind of performance you could get. maybe someone's already written a paper on it?