Re: regex, shortest match

> <grin/> I'd expect that to break most regexen :-)

No you can always modify the regex to include any finite list of cases.
for example changing
([^.]|\.[^ \n\r\t])
to
([^.]|\.[^ \n\r\t]|Dr\. Michael Kay|D\.P\. Carlisle)
would work. or perhaps more generally (with a greater possibility of
false endings)
([^.]|\.[^ \n\r\t]|[MD]rs?\. |[A-Z]\. )



David

________________________________________________________________________
The Numerical Algorithms Group Ltd is a company registered in England
and Wales with company number 1249803. The registered office is:
Wilkinson House, Jordan Hill Road, Oxford OX2 8DR, United Kingdom.

This e-mail has been scanned for all viruses by Star. The service is
powered by MessageLabs. 
________________________________________________________________________