1.1 --- a/doc/groups.dox	Thu Oct 05 10:18:58 2006 +0000
     1.2 +++ b/doc/groups.dox	Tue Oct 10 13:50:47 2006 +0000
     1.3 @@ -292,7 +292,7 @@
     1.4    to avoid document multiplications, an implementation of a concept
     1.5    simply refers to the corresponding concept class.
     1.6  
     1.7 -- These classes declare every functions, <tt>typedef<tt>s etc. an
     1.8 +- These classes declare every functions, <tt>typedef</tt>s etc. an
     1.9    implementation of the concepts should provide, however completely
    1.10    without implementations and real data structures behind the
    1.11    interface. On the other hand they should provide nothing else. All
    1.12 @@ -301,7 +301,7 @@
    1.13    of course.) In this way it is easily to check if an algorithm
    1.14    doesn't use any extra feature of a certain implementation.
    1.15  
    1.16 -- The concept descriptor classes also provide a <em>checker class<em>
    1.17 +- The concept descriptor classes also provide a <em>checker class</em>
    1.18    that makes it possible check whether a certain implementation of a
    1.19    concept indeed provides all the required features.
    1.20