Revision: 14888
http://gate.svn.sourceforge.net/gate/?rev=14888&view=rev
Author: adamfunk
Date: 2012-01-05 15:56:15 +0000 (Thu, 05 Jan 2012)
Log Message:
-----------
clarified issues with Hash Gazetteer
Modified Paths:
--------------
userguide/trunk/gazetteers.tex
Modified: userguide/trunk/gazetteers.tex
===================================================================
--- userguide/trunk/gazetteers.tex 2012-01-05 14:56:55 UTC (rev 14887)
+++ userguide/trunk/gazetteers.tex 2012-01-05 15:56:15 UTC (rev 14888)
@@ -426,38 +426,38 @@
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\sect[sec:gazetteers:hash]{Hash Gazetteer}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-
%% TODO: is this actually the HashGazetteer (this was OntotextGazetteer,
%% something nowhere to be found in current GATE)
%% The HashGazetteer source code is not in GATE and only a jar
%% ontotext.jar is included
+%%
+The Hash Gazetteer is a gazetteer implemented by the OntoText Lab
+(\url{http://www.ontotext.com/}). Its implementation is based on simple lookup
+in several java.util.HashMap objects, and is inspired by the strange idea of
+Atanas Kiryakov, that searching in HashMaps may be faster than in a Finite
State
+Machine (FSM). The Hash Gazetteer processing resource is part of the ANNIE
+plugin.
-The Hash Gazetteer is a gazetteer implemented by the
-OntoText Lab (http://www.ontotext.com/). Its implementation is based on
-simple lookup in several java.util.HashMap objects, and is inspired by the
-strange idea of Atanas Kiryakov, that searching in HashMaps will be
-faster than a search in a Finite State Machine (FSM).
-The Hash Gazetteer processing resource is part of the ANNIE plugin.
+This gazetteer processing resource is implemented in the following way: Every
+phrase {i.e. every list entry} is separated into several parts. The parts are
+determined by the whitespaces lying among them; e.g., the phrase ``form is
+emptiness'' has three parts: ``form'', ``is'', and ``emptiness''. There is
also
+a list of HashMaps: mapsList which has as many elements as the longest (in
terms
+of `count of parts') phrase in the lists. So the first part of a phrase is
+placed in the first map. The first part + space + second part is placed in the
+second map, etc. The full phrase is placed in the appropriate map, and a
+reference to a Lookup object is attached to it.
-This gazetteer processing resource is implemented in the following way:
-Every phrase {i.e. every list entry} is separated into several parts. The
-parts are determined by the whitespaces lying among them. e.g. the phrase :
-"form is emptiness" has three parts : ``form'', ``is'', and ``emptiness''.
- There is also a
-list of HashMaps: mapsList which has as many elements as the longest (in
-terms of `count of parts') phrase in the lists. So the first part of a
-phrase is placed in the first map. The first part + space + second part is
-placed in the second map, etc. The full phrase is placed in the appropriate
-map, and a reference to a Lookup object is attached to it.
-
On first sight it seems that this algorithm is certainly much more
-memory-consuming than a finite state machine (FSM) with the parts of
-the phrases as transitions, but this is actually not so important
-since the average length of the phrases (in parts) in the lists is 1.1.
-On the other hand, one
-advantage of the algorithm is that, although unconventional, on
-average it takes four times less memory and works three times faster
-than an optimized FSM implementation.
+memory-consuming than a finite state machine (FSM) with the parts of the
phrases
+as transitions, but this is actually not so important since the average length
+of the phrases (in parts) in the lists is 1.1. On the other hand, one
advantage
+of the algorithm is that, although unconventional, it takes less memory and may
+be slightly faster, especially if you have a very large gazetteer (e.g.,
+100,000s of entries).
+% on average it takes four
+% times less memory and works three times faster than an optimized FSM
+% implementation.
\subsect{Prerequisites}
@@ -509,6 +509,10 @@
will be used.
+Note that the Hash Gazetteer does not have the \textbf{longestMatchOnly} and
+\textbf{wholeWordsOnly} parameters; if you need to configure these options, you
+should use the another gazetteer that supports them, such as the standard ANNIE
+Gazetteer (see section~\ref{sec:gazetteers:anniegaz}).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\sect[sec:gazetteers:flexgazetteer]{Flexible Gazetteer}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
This was sent by the SourceForge.net collaborative development platform, the
world's largest Open Source development site.
------------------------------------------------------------------------------
Ridiculously easy VDI. With Citrix VDI-in-a-Box, you don't need a complex
infrastructure or vast IT resources to deliver seamless, secure access to
virtual desktops. With this all-in-one solution, easily deploy virtual
desktops for less than the cost of PCs and save 60% on VDI infrastructure
costs. Try it free! http://p.sf.net/sfu/Citrix-VDIinabox
_______________________________________________
GATE-cvs mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/gate-cvs
