On 11/06/2014 14:23, BrJohan wrote:
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
BrJohan wrote:
On 11/06/2014 14:23, BrJohan wrote:
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
On Fri, 13 Jun 2014 17:17:06 +0200, BrJohan wrote:
Or to put the namevariants in some sequence of sets having elements
like: (Kristina, Christina, Cristine, Kristine)
Matching is then just applying the 'in' operator.
That's definitely a better approach, for the reasons you mentioned.
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.
On 2014-06-11 13:23, BrJohan wrote:
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
Am 11.06.2014 14:23 schrieb BrJohan:
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?
Just a
On 6/11/14 8:26 AM, Robert Kern wrote:
Anyways, to your new problem, yes it's possible. Search for regular
expression intersection for possible approaches.
I agree, I would not use a decision (decision tree) but would consider
a set of filters from most specific to least specific.
marcus
On 06/11/2014 06:23 AM, BrJohan wrote:
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
On 06/11/2014 10:35 AM, Michael Torrie wrote:
On 06/11/2014 06:23 AM, BrJohan wrote:
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
On 11 June 2014 13:23:14 BST, BrJohan brjo...@gmail.com wrote:
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,
2014-06-11 14:23 GMT+02:00 BrJohan brjo...@gmail.com:
For some genealogical purposes I consider using Python's re module.
...
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
11 matches
Mail list logo
