Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Knob Re: dictionary sorting

by knobunc (Pilgrim)
on Mar 13, 2002 at 17:35 UTC ( #151456=note: print w/ replies, xml ) Need Help??

in reply to dictionary sorting

Damn... I thought you were going to start a discussion on real dictionary sorting where all sorts of odd rules pertain (and I am not convinced that a computer can do most of them).

In the most simple form you have to decide how spaces will sort. So, does a complete word sort before a partial word. Then you have to make similar decisions about punctuation (keeping a distinction between leading punctuation and punctuation that occurs in a word). Next add the complication of ignored prefixes (does d'Annunzio, Gabrielle sort under d or A?), these rules also may vary depending on whether the thing is a place or person (e.g. Saint Paul, does it sort as p (for Paul, Saint) or s (for the city)?).

I read a few books on this from the library and discovered that the rules are pretty convoluted. Fortunately there appears to be an attempt to make the rules more computer friendly so that the program does not need knowledge of what something is in order to sort it.


Comment on Knob Re: dictionary sorting

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://151456]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (5)
As of 2015-11-26 00:43 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (695 votes), past polls