Linguistic Searching BookManager provides one of the most capable and easy to use search mechanisms in the industry. All BookManager content is inherently "full-text" indexed as part of the BUILD process, and the resulting index is carried within the compressed book. The search mechanism that is built on this indexing can very rapidly find individual words or phrases in context, and will scale well as the size of the text base increases. As with many text search engines, BookManager search supports Boolean combinations of word searches, and can take word proximity into consideration when qualifying matches.
But BookManager search goes well beyond string matching. BookManager search operates in concert with the linguistic analysis of a document that is done during BUILD to incorporate "fuzzy" matching on word variations that include stemming, case variation, noun-adjective forms, and tense variation etc. To make such a dynamic search result useful and understandable, BookManager presents search hits as a "ranked list". The ranking algorithm takes many factors into consideration including the context of the match (whether the match is in plain text or a section heading), the proximity and completeness of words matched in phrases, and exactness of the word match (whether or not the word that matched was the one originally specified or a variation).
All of this means that your readers will be able to find the information they need quickly, and with a minimum of search requests. And that makes them more productive, and more efficient!
How it works
Did you ever know that you read something earlier, but you can't remember where you saw it? You also remember the concept of the text, but not the exact words used. Now try to find it again. It can be very difficult.
With BookManager's powerful search capability, things are much easier to find -- and quickly. The patented search engine finds various forms of a word, reducing your search time dramatically. For example, when searching for the words "children run", most searches will find exact matches of these words, in that order. But BookManager can find matches like:
- the running child
- the child was running
- the children ran
- the child ran
- the child that ran
- the dog ran with the child
Of course, if what you are interested in is an exact match search, we can do that too.
And BookManager's sophistocated ranking algorithm can lists the search hits in order of importance. Usually, the text you're looking for will be at or near the top of the list.
This searching can be done within a book, or across a group of books. And BookManager's book structure makes the time it takes to do this search very fast. So you can search for a word or phrase in the text of hundreds of books, in just seconds.
How powerful would searching like this be to your employees? If it can save them time, it can save you money.
