From: Don A. <dal...@us...> - 2002-12-01 03:31:13
|
I've been experimenting with handling surname prefixes for sorting. What this means is that "Fred de Marco" would be sorted as if the name was "Fred Marco". The algorithm I'm using is pretty simple right now. It goes something like: 1) split the surname into strings using spaces as delimiters 2) if the split name has more than one part, check the first part against a list of know prefixes 3) If the prefix matches, use the second part of the string as the sort string, otherwise use the whole surname as the sort string Does this seem like a reasonable algorithm? If so, I need a list of prefixes that should be used. The list I currently have is: de, van, von, la, di, le, du Don |