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
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
New contributor
add a comment |
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
New contributor
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
add a comment |
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
New contributor
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
umlaut
New contributor
New contributor
edited 8 hours ago
Matthias
New contributor
asked 8 hours ago
MatthiasMatthias
1084
1084
New contributor
New contributor
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
add a comment |
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
add a comment |
3 Answers
3
active
oldest
votes
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.
add a comment |
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äàáâãéè ...
add a comment |
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.
New contributor
Thank you for your answer. Sadly I cannot implement this behaviour. I'm sorry. I removed the phone book reference.
– Matthias
8 hours ago
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
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.
add a comment |
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.
add a comment |
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.
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.
answered 8 hours ago
David VogtDavid Vogt
6,7301636
6,7301636
add a comment |
add a comment |
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äàáâãéè ...
add a comment |
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äàáâãéè ...
add a comment |
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äàáâãéè ...
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äàáâãéè ...
edited 7 hours ago
answered 7 hours ago
mtwdemtwde
4,1381319
4,1381319
add a comment |
add a comment |
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.
New contributor
Thank you for your answer. Sadly I cannot implement this behaviour. I'm sorry. I removed the phone book reference.
– Matthias
8 hours ago
add a comment |
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.
New contributor
Thank you for your answer. Sadly I cannot implement this behaviour. I'm sorry. I removed the phone book reference.
– Matthias
8 hours ago
add a comment |
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.
New contributor
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.
New contributor
New contributor
answered 8 hours ago
ziganotschkaziganotschka
291
291
New contributor
New contributor
Thank you for your answer. Sadly I cannot implement this behaviour. I'm sorry. I removed the phone book reference.
– Matthias
8 hours ago
add a comment |
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
add a comment |
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.
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
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