1998 Skoda Czech Open – Doubles
Ruxandra Dragomir and Karina Habšudová were the defending champions but they competed with different partners that year, Dragomir with Åsa Carlsson and Habšudová with Silvia Farina.
Doubles | |
---|---|
1998 Skoda Czech Open | |
Champions | |
Runners-up | |
Final score | 2–6, 6–1, 6–2 |
Draw | 16 |
Seeds | 4 |
Carlsson and Dragomir lost in the first round to Cătălina Cristea and Eva Melicharová.
Farina and Habšudová won in the final 2–6, 6–1, 6–2 against Květa Hrdličková and Michaela Paštiková.
Seeds
Champion seeds are indicated in bold text while text in italics indicates the round in which those seeds were eliminated.
Cătălina Cristea / Eva Melicharová (Quarterfinals) Silvia Farina / Karina Habšudová (Champions) Olga Lugina / Helena Vildová (First Round) Janette Husárová / Virginia Ruano Pascual (Quarterfinals)
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
First Round | Quarterfinals | Semifinals | Final | ||||||||||||||||||||||||
1 | 3 | 7 | 7 | ||||||||||||||||||||||||
6 | 5 | 5 | 1 | 3 | 1 | ||||||||||||||||||||||
5 | 6 | 4 | 6 | 6 | |||||||||||||||||||||||
7 | 3 | 6 | 0 | 4 | |||||||||||||||||||||||
3 | 2 | 0 | WC | 6 | 6 | ||||||||||||||||||||||
Q | 6 | 6 | Q | 1 | 4 | ||||||||||||||||||||||
WC | 6 | 6 | WC | 6 | 6 | ||||||||||||||||||||||
4 | 2 | WC | 6 | 1 | 1 | ||||||||||||||||||||||
4 | 1 | 2 | 2 | 6 | 6 | ||||||||||||||||||||||
6 | 6 | w/o | |||||||||||||||||||||||||
2 | 5 | 4 | |||||||||||||||||||||||||
4 | 6 | 7 | 2 | 6 | 2 | ||||||||||||||||||||||
4 | 3 | 2 | 6 | 4 | 6 | ||||||||||||||||||||||
6 | 6 | 3 | 4 | ||||||||||||||||||||||||
4 | 6 | 6 | 2 | 6 | 6 | ||||||||||||||||||||||
2 | 6 | 3 | 7 |
gollark: Rust, then, if you MUST apioforms.
gollark: Personal preference really. Why not support parsing ALL OF THEM?!?!?!?!
gollark: ?tag create bm25 BM25 is a bag-of-words retrieval function that ranks a set of documents based on the query terms appearing in each document, regardless of their proximity within the document. It is a family of scoring functions with slightly different components and parameters. One of the most prominent instantiations of the function is as follows.
gollark: Well, I prefer the LISP one.
gollark: Obviously the Haskell one.
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.