Umlaut character order when sortingHow to type umlaut over a dash as in many German dictionaries?How should an Umlaut be written?Warum hat »nächtlich« einen Umlaut und »weihnachtlich« keinen?What's the difference between Umlaut and Ablaut?Do all verbs form the conjunctive II with an umlaut?What is the historical origin of the German umlaut?Can an umlaut be written as a line in handwriting?Umlaut over consonant preceding a vowelHow do I know when a word is spelt with ä rather than an e when I hear the wordUmlaut or not on “ihr” form of verb

Why are there no file insertion syscalls

Explicit song lyrics checker

reverse a call to mmap()

Examples of protocols that are insecure when run concurrently

Synaptic Static - when to roll the d6?

Why was New Asgard established at this place?

I found a password with hashcat but it doesn't work

How can the US president give an order to a civilian?

How can I prevent a user from copying files on another hard drive?

What is the highest power supply a Raspberry pi 3 B can handle without getting damaged?

What is this plant I saw for sale at a Romanian farmer's market?

Counterfeit checks were created for my account. How does this type of fraud work?

Math symbols in math operators

How to modify a string without altering its text properties

Print the new site header

What is that ceiling compartment of a Boeing 737?

Is there any way to revive my Sim?

How do you transpose samples in cents?

Why can't I craft scaffolding in Minecraft 1.14?

King or Queen-Which piece is which?

In a list with unique pairs A, B, how can I sort them so that the last B is the first A in the next pair?

Umlaut character order when sorting

"Correct me if I'm wrong"

Why is Havana covered in 5-digit numbers in Our Man in Havana?



Umlaut character order when sorting


How to type umlaut over a dash as in many German dictionaries?How should an Umlaut be written?Warum hat »nächtlich« einen Umlaut und »weihnachtlich« keinen?What's the difference between Umlaut and Ablaut?Do all verbs form the conjunctive II with an umlaut?What is the historical origin of the German umlaut?Can an umlaut be written as a line in handwriting?Umlaut over consonant preceding a vowelHow do I know when a word is spelt with ä rather than an e when I hear the wordUmlaut or not on “ihr” form of verb













1















I want to sort strings (text) in a software project of mine. I'm planning to do this in the lexically best way.



My set of possible characters consist of the full alphabet (a-z and A-Z) and of the typical Latin 1 Umlauts, like "ÄÖÜäöüß" and also characters from other Latin 1 languages like: "àáâã"...



How would one sort those characters so that also humans could look them up fast?



For instance one would seek for Ä after A (I guess). And for é after e.



In which order would "àáâãä" be sorted in between a and b? Is there some kind of ISO standard defining such things? How would those characters be arranged?



Sadly it's technically impossible to order the data by expanding characters like Ä to Ae.










share|improve this question









New contributor



Matthias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.



















  • In most programming languages a collation function is available which compares strings according to a locale. In C, this function is strcoll(). Java has a Collator class.

    – RHa
    5 hours ago
















1















I want to sort strings (text) in a software project of mine. I'm planning to do this in the lexically best way.



My set of possible characters consist of the full alphabet (a-z and A-Z) and of the typical Latin 1 Umlauts, like "ÄÖÜäöüß" and also characters from other Latin 1 languages like: "àáâã"...



How would one sort those characters so that also humans could look them up fast?



For instance one would seek for Ä after A (I guess). And for é after e.



In which order would "àáâãä" be sorted in between a and b? Is there some kind of ISO standard defining such things? How would those characters be arranged?



Sadly it's technically impossible to order the data by expanding characters like Ä to Ae.










share|improve this question









New contributor



Matthias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.



















  • In most programming languages a collation function is available which compares strings according to a locale. In C, this function is strcoll(). Java has a Collator class.

    – RHa
    5 hours ago














1












1








1








I want to sort strings (text) in a software project of mine. I'm planning to do this in the lexically best way.



My set of possible characters consist of the full alphabet (a-z and A-Z) and of the typical Latin 1 Umlauts, like "ÄÖÜäöüß" and also characters from other Latin 1 languages like: "àáâã"...



How would one sort those characters so that also humans could look them up fast?



For instance one would seek for Ä after A (I guess). And for é after e.



In which order would "àáâãä" be sorted in between a and b? Is there some kind of ISO standard defining such things? How would those characters be arranged?



Sadly it's technically impossible to order the data by expanding characters like Ä to Ae.










share|improve this question









New contributor



Matthias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











I want to sort strings (text) in a software project of mine. I'm planning to do this in the lexically best way.



My set of possible characters consist of the full alphabet (a-z and A-Z) and of the typical Latin 1 Umlauts, like "ÄÖÜäöüß" and also characters from other Latin 1 languages like: "àáâã"...



How would one sort those characters so that also humans could look them up fast?



For instance one would seek for Ä after A (I guess). And for é after e.



In which order would "àáâãä" be sorted in between a and b? Is there some kind of ISO standard defining such things? How would those characters be arranged?



Sadly it's technically impossible to order the data by expanding characters like Ä to Ae.







umlaut






share|improve this question









New contributor



Matthias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.










share|improve this question









New contributor



Matthias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








share|improve this question




share|improve this question








edited 8 hours ago







Matthias













New contributor



Matthias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








asked 8 hours ago









MatthiasMatthias

1084




1084




New contributor



Matthias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




New contributor




Matthias is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.














  • In most programming languages a collation function is available which compares strings according to a locale. In C, this function is strcoll(). Java has a Collator class.

    – RHa
    5 hours ago


















  • In most programming languages a collation function is available which compares strings according to a locale. In C, this function is strcoll(). Java has a Collator class.

    – RHa
    5 hours ago

















In most programming languages a collation function is available which compares strings according to a locale. In C, this function is strcoll(). Java has a Collator class.

– RHa
5 hours ago






In most programming languages a collation function is available which compares strings according to a locale. In C, this function is strcoll(). Java has a Collator class.

– RHa
5 hours ago











3 Answers
3






active

oldest

votes


















2














If it's not names you are dealing with, it would be best to ignore all diacritics when sorting (and count ß as ss).



The only reason to deviate from this simple system lies in the unfortunate fact that German names show unpredictable variation between ä, ö, ü and ae, oe, ue. This has lead to phone books and library catalogues sorting e.g. Räder as Raeder, Örtel as Oertel, Hüber as Hueber.



Wikipedia has a good write-up.






share|improve this answer






























    2














    Short answer: Take a look at MySQL and different character-collations. Choose one and follow its rules.



    Long answer:



    There are 3 different solutions for your problem (actually there are 4, but believe me, you don't want to realize the 4th ;) )



    1) Rewrite every Umlaut to its base (dictionary rules - DIN 5007-1 var. 1)



    Every Umlaut and Diacritic results in the same char.
    e.g.




    àáâãä = a



    ß = ss




    and so on.



    Sort them.



    2) Rewrite every Umlaut by adding an e, diacritics are removed (phone book rules - DIN 5007-1 var. 2)




    ä = ae



    àáâã = a



    ü = ue



    ß = ss




    Sort them.



    3) Umlaute are new chars added to the alphabet (Swedish/Finnish collation rules)



    Every Umlaut and chars with diacritics are treated like chars, which are added after the z of the alphabet. Look up different charsets for the sequence of chars with diacretics.



    So sort like




    abc [...] xyzäàáâãéè ...







    share|improve this answer
































      1














      I can answer you only regarding the German characters. "Ä" is considered equivalent to "Ae", "Ö" to "Oe", "Ü" to "Ue" and "ß" to "ss". This is how those characters are sorted in a phonebook.






      share|improve this answer








      New contributor



      ziganotschka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.



















      • Thank you for your answer. Sadly I cannot implement this behaviour. I'm sorry. I removed the phone book reference.

        – Matthias
        8 hours ago











      Your Answer








      StackExchange.ready(function()
      var channelOptions =
      tags: "".split(" "),
      id: "253"
      ;
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function()
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled)
      StackExchange.using("snippets", function()
      createEditor();
      );

      else
      createEditor();

      );

      function createEditor()
      StackExchange.prepareEditor(
      heartbeatType: 'answer',
      autoActivateHeartbeat: false,
      convertImagesToLinks: false,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: null,
      bindNavPrevention: true,
      postfix: "",
      imageUploader:
      brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
      contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
      allowUrls: true
      ,
      noCode: true, onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      );



      );






      Matthias is a new contributor. Be nice, and check out our Code of Conduct.









      draft saved

      draft discarded


















      StackExchange.ready(
      function ()
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fgerman.stackexchange.com%2fquestions%2f52765%2fumlaut-character-order-when-sorting%23new-answer', 'question_page');

      );

      Post as a guest















      Required, but never shown

























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      2














      If it's not names you are dealing with, it would be best to ignore all diacritics when sorting (and count ß as ss).



      The only reason to deviate from this simple system lies in the unfortunate fact that German names show unpredictable variation between ä, ö, ü and ae, oe, ue. This has lead to phone books and library catalogues sorting e.g. Räder as Raeder, Örtel as Oertel, Hüber as Hueber.



      Wikipedia has a good write-up.






      share|improve this answer



























        2














        If it's not names you are dealing with, it would be best to ignore all diacritics when sorting (and count ß as ss).



        The only reason to deviate from this simple system lies in the unfortunate fact that German names show unpredictable variation between ä, ö, ü and ae, oe, ue. This has lead to phone books and library catalogues sorting e.g. Räder as Raeder, Örtel as Oertel, Hüber as Hueber.



        Wikipedia has a good write-up.






        share|improve this answer

























          2












          2








          2







          If it's not names you are dealing with, it would be best to ignore all diacritics when sorting (and count ß as ss).



          The only reason to deviate from this simple system lies in the unfortunate fact that German names show unpredictable variation between ä, ö, ü and ae, oe, ue. This has lead to phone books and library catalogues sorting e.g. Räder as Raeder, Örtel as Oertel, Hüber as Hueber.



          Wikipedia has a good write-up.






          share|improve this answer













          If it's not names you are dealing with, it would be best to ignore all diacritics when sorting (and count ß as ss).



          The only reason to deviate from this simple system lies in the unfortunate fact that German names show unpredictable variation between ä, ö, ü and ae, oe, ue. This has lead to phone books and library catalogues sorting e.g. Räder as Raeder, Örtel as Oertel, Hüber as Hueber.



          Wikipedia has a good write-up.







          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered 8 hours ago









          David VogtDavid Vogt

          6,7301636




          6,7301636





















              2














              Short answer: Take a look at MySQL and different character-collations. Choose one and follow its rules.



              Long answer:



              There are 3 different solutions for your problem (actually there are 4, but believe me, you don't want to realize the 4th ;) )



              1) Rewrite every Umlaut to its base (dictionary rules - DIN 5007-1 var. 1)



              Every Umlaut and Diacritic results in the same char.
              e.g.




              àáâãä = a



              ß = ss




              and so on.



              Sort them.



              2) Rewrite every Umlaut by adding an e, diacritics are removed (phone book rules - DIN 5007-1 var. 2)




              ä = ae



              àáâã = a



              ü = ue



              ß = ss




              Sort them.



              3) Umlaute are new chars added to the alphabet (Swedish/Finnish collation rules)



              Every Umlaut and chars with diacritics are treated like chars, which are added after the z of the alphabet. Look up different charsets for the sequence of chars with diacretics.



              So sort like




              abc [...] xyzäàáâãéè ...







              share|improve this answer





























                2














                Short answer: Take a look at MySQL and different character-collations. Choose one and follow its rules.



                Long answer:



                There are 3 different solutions for your problem (actually there are 4, but believe me, you don't want to realize the 4th ;) )



                1) Rewrite every Umlaut to its base (dictionary rules - DIN 5007-1 var. 1)



                Every Umlaut and Diacritic results in the same char.
                e.g.




                àáâãä = a



                ß = ss




                and so on.



                Sort them.



                2) Rewrite every Umlaut by adding an e, diacritics are removed (phone book rules - DIN 5007-1 var. 2)




                ä = ae



                àáâã = a



                ü = ue



                ß = ss




                Sort them.



                3) Umlaute are new chars added to the alphabet (Swedish/Finnish collation rules)



                Every Umlaut and chars with diacritics are treated like chars, which are added after the z of the alphabet. Look up different charsets for the sequence of chars with diacretics.



                So sort like




                abc [...] xyzäàáâãéè ...







                share|improve this answer



























                  2












                  2








                  2







                  Short answer: Take a look at MySQL and different character-collations. Choose one and follow its rules.



                  Long answer:



                  There are 3 different solutions for your problem (actually there are 4, but believe me, you don't want to realize the 4th ;) )



                  1) Rewrite every Umlaut to its base (dictionary rules - DIN 5007-1 var. 1)



                  Every Umlaut and Diacritic results in the same char.
                  e.g.




                  àáâãä = a



                  ß = ss




                  and so on.



                  Sort them.



                  2) Rewrite every Umlaut by adding an e, diacritics are removed (phone book rules - DIN 5007-1 var. 2)




                  ä = ae



                  àáâã = a



                  ü = ue



                  ß = ss




                  Sort them.



                  3) Umlaute are new chars added to the alphabet (Swedish/Finnish collation rules)



                  Every Umlaut and chars with diacritics are treated like chars, which are added after the z of the alphabet. Look up different charsets for the sequence of chars with diacretics.



                  So sort like




                  abc [...] xyzäàáâãéè ...







                  share|improve this answer















                  Short answer: Take a look at MySQL and different character-collations. Choose one and follow its rules.



                  Long answer:



                  There are 3 different solutions for your problem (actually there are 4, but believe me, you don't want to realize the 4th ;) )



                  1) Rewrite every Umlaut to its base (dictionary rules - DIN 5007-1 var. 1)



                  Every Umlaut and Diacritic results in the same char.
                  e.g.




                  àáâãä = a



                  ß = ss




                  and so on.



                  Sort them.



                  2) Rewrite every Umlaut by adding an e, diacritics are removed (phone book rules - DIN 5007-1 var. 2)




                  ä = ae



                  àáâã = a



                  ü = ue



                  ß = ss




                  Sort them.



                  3) Umlaute are new chars added to the alphabet (Swedish/Finnish collation rules)



                  Every Umlaut and chars with diacritics are treated like chars, which are added after the z of the alphabet. Look up different charsets for the sequence of chars with diacretics.



                  So sort like




                  abc [...] xyzäàáâãéè ...








                  share|improve this answer














                  share|improve this answer



                  share|improve this answer








                  edited 7 hours ago

























                  answered 7 hours ago









                  mtwdemtwde

                  4,1381319




                  4,1381319





















                      1














                      I can answer you only regarding the German characters. "Ä" is considered equivalent to "Ae", "Ö" to "Oe", "Ü" to "Ue" and "ß" to "ss". This is how those characters are sorted in a phonebook.






                      share|improve this answer








                      New contributor



                      ziganotschka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                      Check out our Code of Conduct.



















                      • Thank you for your answer. Sadly I cannot implement this behaviour. I'm sorry. I removed the phone book reference.

                        – Matthias
                        8 hours ago















                      1














                      I can answer you only regarding the German characters. "Ä" is considered equivalent to "Ae", "Ö" to "Oe", "Ü" to "Ue" and "ß" to "ss". This is how those characters are sorted in a phonebook.






                      share|improve this answer








                      New contributor



                      ziganotschka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                      Check out our Code of Conduct.



















                      • Thank you for your answer. Sadly I cannot implement this behaviour. I'm sorry. I removed the phone book reference.

                        – Matthias
                        8 hours ago













                      1












                      1








                      1







                      I can answer you only regarding the German characters. "Ä" is considered equivalent to "Ae", "Ö" to "Oe", "Ü" to "Ue" and "ß" to "ss". This is how those characters are sorted in a phonebook.






                      share|improve this answer








                      New contributor



                      ziganotschka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                      Check out our Code of Conduct.









                      I can answer you only regarding the German characters. "Ä" is considered equivalent to "Ae", "Ö" to "Oe", "Ü" to "Ue" and "ß" to "ss". This is how those characters are sorted in a phonebook.







                      share|improve this answer








                      New contributor



                      ziganotschka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                      Check out our Code of Conduct.








                      share|improve this answer



                      share|improve this answer






                      New contributor



                      ziganotschka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                      Check out our Code of Conduct.








                      answered 8 hours ago









                      ziganotschkaziganotschka

                      291




                      291




                      New contributor



                      ziganotschka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                      Check out our Code of Conduct.




                      New contributor




                      ziganotschka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                      Check out our Code of Conduct.














                      • Thank you for your answer. Sadly I cannot implement this behaviour. I'm sorry. I removed the phone book reference.

                        – Matthias
                        8 hours ago

















                      • Thank you for your answer. Sadly I cannot implement this behaviour. I'm sorry. I removed the phone book reference.

                        – Matthias
                        8 hours ago
















                      Thank you for your answer. Sadly I cannot implement this behaviour. I'm sorry. I removed the phone book reference.

                      – Matthias
                      8 hours ago





                      Thank you for your answer. Sadly I cannot implement this behaviour. I'm sorry. I removed the phone book reference.

                      – Matthias
                      8 hours ago










                      Matthias is a new contributor. Be nice, and check out our Code of Conduct.









                      draft saved

                      draft discarded


















                      Matthias is a new contributor. Be nice, and check out our Code of Conduct.












                      Matthias is a new contributor. Be nice, and check out our Code of Conduct.











                      Matthias is a new contributor. Be nice, and check out our Code of Conduct.














                      Thanks for contributing an answer to German Language Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid


                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.

                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fgerman.stackexchange.com%2fquestions%2f52765%2fumlaut-character-order-when-sorting%23new-answer', 'question_page');

                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      Popular posts from this blog

                      Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

                      Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

                      Ласкавець круглолистий Зміст Опис | Поширення | Галерея | Примітки | Посилання | Навігаційне меню58171138361-22960890446Bupleurum rotundifoliumEuro+Med PlantbasePlants of the World Online — Kew ScienceGermplasm Resources Information Network (GRIN)Ласкавецькн. VI : Літери Ком — Левиправивши або дописавши її