2011 Aegon Trophy – Men's Singles
Ričardas Berankis was the defending champion, but chose not to participate.
Gilles Müller won this tournament, defeating Matthias Bachinger 7–6(4), 6–2 in the final.
Men's Singles | |
---|---|
2011 Aegon Trophy | |
Champion | ![]() |
Runner-up | ![]() |
Final score | 7–6(4), 6–2 |
Seeds
Adrian Mannarino (First Round) Somdev Devvarman (First Round) Ryan Sweeting (Second Round) Dmitry Tursunov (Quarterfinals) Alex Bogomolov, Jr. (Second Round) Donald Young (First Round) Matthias Bachinger (Final) Bobby Reynolds (Second Round)
Main draw
Key
- Q = Qualifier
- WC = Wild Card
- LL = Lucky Loser
- Alt = Alternate
- SE = Special Exempt
- PR = Protected Ranking
- ITF = ITF entry
- JE = Junior Exempt
- w/o = Walkover
- r = Retired
- d = Defaulted
Finals
Semifinals | Final | ||||||||||||
![]() | 64 | 1 | |||||||||||
7 | ![]() | 7 | 6 | ||||||||||
7 | ![]() | 64 | 2 | ||||||||||
![]() | 7 | 6 | |||||||||||
![]() | 6 | 6 | |||||||||||
WC | ![]() | 3 | 4 | ||||||||||
Top half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() | 4 | 1 | ||||||||||||||||||||||||
![]() | 6 | 6 | ![]() | 6 | 6 | ||||||||||||||||||||||
WC | ![]() | 4 | 64 | ![]() | 4 | 2 | |||||||||||||||||||||
![]() | 6 | 7 | ![]() | 6 | 66 | 3 | |||||||||||||||||||||
![]() | 4 | 4 | ![]() | 1 | 7 | 6 | |||||||||||||||||||||
![]() | 6 | 6 | ![]() | 6 | 5 | 6 | |||||||||||||||||||||
Q | ![]() | 6 | 6 | Q | ![]() | 4 | 7 | 4 | |||||||||||||||||||
6 | ![]() | 3 | 1 | ![]() | 64 | 1 | |||||||||||||||||||||
4 | ![]() | 7 | 6 | 7 | ![]() | 7 | 6 | ||||||||||||||||||||
![]() | 64 | 4 | 4 | ![]() | 6 | 7 | |||||||||||||||||||||
![]() | 7 | 4 | 66 | Q | ![]() | 1 | 5 | ||||||||||||||||||||
Q | ![]() | 5 | 6 | 7 | 4 | ![]() | 6 | 4 | 1 | ||||||||||||||||||
![]() | 6 | 5 | 0r | 7 | ![]() | 3 | 6 | 6 | |||||||||||||||||||
Q | ![]() | 3 | 7 | 1 | Q | ![]() | 4 | 4 | |||||||||||||||||||
Q | ![]() | 1 | 3 | 7 | ![]() | 6 | 6 | ||||||||||||||||||||
7 | ![]() | 6 | 6 |
Bottom half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
5 | ![]() | 66 | 7 | 6 | |||||||||||||||||||||||
![]() | 7 | 5 | 2 | 5 | ![]() | 6 | 3 | 2 | |||||||||||||||||||
![]() | 7 | 3 | 7 | ![]() | 4 | 6 | 6 | ||||||||||||||||||||
![]() | 63 | 6 | 5 | ![]() | 7 | 4 | 3 | ||||||||||||||||||||
![]() | 7 | 4 | 4 | ![]() | 5 | 6 | 6 | ||||||||||||||||||||
![]() | 64 | 6 | 6 | ![]() | 7 | 6 | |||||||||||||||||||||
WC | ![]() | 6 | 0 | 1 | 3 | ![]() | 64 | 4 | |||||||||||||||||||
3 | ![]() | 1 | 6 | 6 | ![]() | 6 | 6 | ||||||||||||||||||||
8 | ![]() | 7 | 1 | 7 | WC | ![]() | 3 | 4 | |||||||||||||||||||
![]() | 5 | 6 | 5 | 8 | ![]() | 4 | 1 | ||||||||||||||||||||
WC | ![]() | 6 | 6 | WC | ![]() | 6 | 6 | ||||||||||||||||||||
![]() | 3 | 4 | WC | ![]() | 6 | 6 | |||||||||||||||||||||
![]() | 6 | 6 | ![]() | 1 | 2 | ||||||||||||||||||||||
WC | ![]() | 4 | 1 | ![]() | 4 | 4 | |||||||||||||||||||||
![]() | 4 | 6 | 6 | ![]() | 6 | 6 | |||||||||||||||||||||
2 | ![]() | 6 | 3 | 2 |
gollark: Just because your language theoretically has words composed of subwords doesn't mean you can ignore the various problems I mentioned (except possibly the grammar one). And "convert the words to semantic expressions" hides a lot of the complexity this would involve.
gollark: I'm pretty sure I've seen diagrams of pronounceable things of some kind, but they're more complex than just permutations of "high tone, low tone" and do not conveniently map to concepts.
gollark: What do you mean "all of the possible forms of a square diagram with two or more sides"? There are infinitely many of those. And how do I just pronounce a diagram without a predetermined mapping?
gollark: Also, I have no idea what an "objective → semantic buffer" is and I think you're underestimating the difficulty of implementing whatever it is.
gollark: I can't actually source this, having checked *at least* two internet things.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.