Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail
From: BrJohan <brjohan@gmail.com>
Newsgroups: comp.lang.python
Subject: Python's re module and genealogy problem
Date: Wed, 11 Jun 2014 14:23:14 +0200
Lines: 20
Message-ID: <bvr01iFu926U1@mid.individual.net>
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: individual.net egpU3XRgbrW9+0geYXvmLQD9vdOe7d8NpEsPCliWce2xoYkiw=
Cancel-Lock: sha1:nIWEAaEXQdf9pVc7yv+NuuqGli8=
User-Agent: Mozilla/5.0 (Windows NT 6.3; WOW64; rv:24.0) Gecko/20100101 Thunderbird/24.5.0
Xref: csiph.com comp.lang.python:73165

For some genealogical purposes I consider using Python's re module.

Rather many names can be spelled in a number of similar ways, and in 
order to match names even if they are spelled differently, I will build 
regular expressions, each of which is supposed to match  a number of 
similar names.

I guess that there will be a few hundred such regular expressions 
covering most popular names.

Now, my problem: Is there a way to decide whether any two - or more - of 
those regular expressions will match the same string?

Or, stated a little differently:

Can it, for a pair of regular expressions be decided whether at least 
one string matching both of those regular expressions, can be constructed?

If it is possible to make such a decision, then how? Anyone aware of an 
algorithm for this?