The Caml Hump: /UbiEst/

/UbiEst/ is intended to be a indexer, allowing *structural* and *compound* searches into a "bunch" of documents (files). What is an indexer ? An indexer is a program recording the occurrences of words among documents and enable to point on them (quickly if possible). A detailled explanation is available in the distribution, but in two or three words... By *structural* indexing, we mean that /UbiEst/ not only maps words onto their locations, but also structures of the indexed documents. By *compound* indexing, we mean that /UbiEst/ does not allow to request to find occurrences of simple words among the indexed document. requests can be combined by the mean of operators. By combining requests, you not only get simple occurrences of words, but rather /extends/ (i.e. piece of text) containing information fitting you global request. /UbiEst/ is developped in Objective Caml and a graphical user interface based on Gtk (Lablgtk) is available.