Markus Mottl avatar Markus Mottl committed 5e850c3

Fixed typos

Comments (0)

Files changed (1)

 order if it is implied by transitivity.  E.g. there is no separate line for
 the elements (89,73) and (25,42).  If elements cannot be reached on lines
 without reversing direction, then they cannot be compared.  E.g. the pair
-(93,21) is uncomparable to all others whereas (44,26) cannot be compared to
+(93,21) is incomparable to all others whereas (44,26) cannot be compared to
 this latter pair and to (25,42) only.
 
 This library internally represents relations between known elements similar
 product baskets that people frequently buy.  This is equivalent to asking
 where in a Hasse-diagram such baskets might be placed.
 
-Or imagine you develope a medical system that automatically associates
-different mixes of medication with illnesses they effectively treat to
-support doctors in deciding on a therapy.  This can all be addressed with
-concept lattices.
+Or imagine you develop a medical system that automatically associates different
+mixes of medication with illnesses they effectively treat to support doctors
+in deciding on a therapy.  This can all be addressed with concept lattices.
 
 #### Software engineering
 
 #### Databases
 
 Partial order structures represented by Hasse-diagrams can be used to
-optimize database queries on multi-value attributes by providing better ways
-of indexing.
+optimize database queries on multi-valued attributes by providing better
+ways of indexing.
 
 #### General problem-solving
 
 For general problem-solving we often need at least to know whether some
-solution is better, equal to, worse or uncomparable to another.  Given a
+solution is better, equal to, worse or incomparable to another.  Given a
 large number of known solutions, the partial order structure containing the
 elements can be used to draw conclusions about e.g. whether their particular
 form (syntax) implies anything about their position in the partial order
 
 #### Referential transparency
 
-The currently implemented functions all handle the datastructure in a purely
-functional way.  This allows you to hold several versions of a datastructure
+The currently implemented functions all handle the data structure in a purely
+functional way.  This allows you to hold several versions of a data structure
 in memory while benefiting from structure sharing.  This makes backing out
-changes to the datastructure efficient and straightforward and also allows
+changes to the data structure efficient and straightforward and also allows
 you to use the library safely in a multi-threaded environment.
 
 #### Incremental updates
Tip: Filter by directory path e.g. /media app.js to search for public/media/app.js.
Tip: Use camelCasing e.g. ProjME to search for ProjectModifiedEvent.java.
Tip: Filter by extension type e.g. /repo .js to search for all .js files in the /repo directory.
Tip: Separate your search with spaces e.g. /ssh pom.xml to search for src/ssh/pom.xml.
Tip: Use ↑ and ↓ arrow keys to navigate and return to view the file.
Tip: You can also navigate files with Ctrl+j (next) and Ctrl+k (previous) and view the file with Ctrl+o.
Tip: You can also navigate files with Alt+j (next) and Alt+k (previous) and view the file with Alt+o.