From cbd0a7c0bf27f55373c0326f0aff4a1e0e4c81aa Mon Sep 17 00:00:00 2001 From: "Anders S. Mortensen" Date: Mon, 3 Jul 2006 12:30:24 +0000 Subject: [PATCH] A few typos. --- doc/examples.xml | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/doc/examples.xml b/doc/examples.xml index 9ceab4d..c8b89a3 100644 --- a/doc/examples.xml +++ b/doc/examples.xml @@ -1,5 +1,5 @@ - + Example Configurations @@ -175,7 +175,7 @@ significantly because it ties searching semantics to the physical structure of the searched records. You can't use the same search specification to search two databases if their internal - representations are different. Consider an different taxonomy + representations are different. Consider a different taxonomy database in which the records have taxon names specified inside a <name> element nested within a <identification> element @@ -192,8 +192,8 @@ said about implementation: in a given database, an access point might be implemented as an index, a path into physical records, an algorithm for interrogating relational tables or whatever works. - The only important thing point is that the semantics of an access - point are fixed and well defined. + The only important thing is that the semantics of an access + point is fixed and well defined. For convenience, access points are gathered into attribute -- 1.7.10.4