From 5ceb96687dc82a78d6beba7f066c37abb0cd2bd5 Mon Sep 17 00:00:00 2001 From: Adam Dickmeiss Date: Wed, 28 Jun 2006 22:50:50 +0000 Subject: [PATCH] Minor spell fixes --- doc/querymodel.xml | 83 ++++++++++++++++++++++++++-------------------------- 1 file changed, 41 insertions(+), 42 deletions(-) diff --git a/doc/querymodel.xml b/doc/querymodel.xml index ee17061..709af6e 100644 --- a/doc/querymodel.xml +++ b/doc/querymodel.xml @@ -1,10 +1,10 @@ - + Query Model Query Model Overview - + Query Languages @@ -26,41 +26,40 @@ query structure has no direct, useful string representation, every origin application needs to provide some form of mapping from a local query notation or representation to it. - - - - - Prefix Query Format (PQF) - - - Index Data has defined a textual representation in the - Prefix Query Format, short - PQF, which maps - one-to-one to binary encoded - type-1 RPN query packages. - It has been adopted by other - parties developing Z39.50 software, and is often referred to as - Prefix Query Notation, or in short - PQN. See - for further explanations and - descriptions of Zebra's capabilities. - - - - Common Query Language (CQL) + + + + Prefix Query Format (PQF) + + Index Data has defined a textual representation in the + Prefix Query Format, short + PQF, which maps + one-to-one to binary encoded + type-1 RPN queries. + PQF has been adopted by other + parties developing Z39.50 software, and is often referred to as + Prefix Query Notation, or in short + PQN. See + for further explanations and + descriptions of Zebra's capabilities. + + + + + Common Query Language (CQL) - The query model of the type-1 RPN, - expressed in PQF/PQN is natively supported. - On the other hand, the default SRU - webservices Common Query Language - CQL is not natively supported. + The query model of the type-1 RPN, + expressed in PQF/PQN is natively supported. + On the other hand, the default SRU + web services Common Query Language + CQL is not natively supported. - Zebra can be configured to understand and map CQL to PQF. See - . - - + Zebra can be configured to understand and map CQL to PQF. See + . + + @@ -150,7 +149,7 @@ Prefix Query Format syntax and semantics - The PQF grammer + The PQF grammar is documented in the YAZ manual, and shall not be repeated here. This textual PQF representation is always during search mapped to the equivalent Zebra internal @@ -251,7 +250,7 @@ Boolean operators - A pair of subquery trees, or of atomic queries, is combined + A pair of sub query trees, or of atomic queries, is combined using the standard boolean operators into new query trees. Thus, boolean operators are always internal nodes in the query tree. @@ -281,7 +280,7 @@ Set complement of two atomic queries hit sets @prox - binary PROXIMY operator + binary PROXIMITY operator Set intersection of two atomic queries hit sets. In addition, the intersection set is purged for all documents which do not satisfy the requested query @@ -331,7 +330,7 @@ retrieval, in the same order and near each other as described in the term list. The hit set is a subset of the corresponding - PROXIMY query. + PROXIMITY query. Z> find "information retrieval" @@ -350,7 +349,7 @@ Atomic (APT) queries are always leaf nodes in the PQF query tree. - Unsupplied non-use attributes type 2-9 are either inherited from + UN-supplied non-use attributes type 2-9 are either inherited from higher nodes in the query tree, or are set to Zebra's default values. See for details. @@ -415,7 +414,7 @@ - For example, we migh want to scan the title index, starting with + For example, we might want to scan the title index, starting with the term debussy, and displaying this and the following terms in lexicographic order: @@ -589,7 +588,7 @@ Filter the addressing XPath by a predicate working on exact string values in attributes (in the XML sense) can be done: return all those docs which - have the term "english" contained in one of all text subnodes of + have the term "english" contained in one of all text sub nodes of the subtree defined by the XPath /record/title[@lang='en']. And similar predicate filtering. @@ -2036,7 +2035,7 @@ different types of registers or indexes, whose tokenization and character normalization rules differ. This reflects the fact that searching fundamental different tokens like dates, numbers, - bitfields and string based text needs different rulesets. + bitfields and string based text needs different rule sets. urx (@attr 4=104) - + -- 1.7.10.4
ignored URX/URL ('u')Special index for URL web adressesSpecial index for URL web addresses
numeric (@attr 4=109)