d[      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZjThe , type is the return type which gives you an @ overview of a word, for all sense and for all parts of speech. [\]^_A 5 is a way of controlling search. Either you specify  a certain sense (using  SenseNumber n , or, since  is an  instance of `, you can juse use n) or by searching using all  senses, through . The ` instance performs standard  arithmetic on s, and a yields a  (always),  but any arithmetic involving  returns . IThe different types of relations which can hold between WordNet Synsets.   !"#$bcdefghi%0The basic type which holds search results. Its j instance simply B shows the string corresponding to the associated WordNet synset. kl&BThis provides (maybe) the associated overview for a SearchResult.  The  is only available if this % was ) derived from a real search, rather than  lookupKey. m'FThis provides (maybe) the associated sense number for a SearchResult.  The  is only available if this % was ) derived from a real search, rather than  lookupKey. nopqrstuvwxyz{|}(A (5 is a simple pointer into the database, which can be  followed using  lookupKey. ~)*(The basic part of speech type, either a ., -, , ective or +erb. +,-.p[\]^_  !"#$bcdefghi%kl&m'nopqrstuvwxyz{|}(~)*+,-.j[\]^_[\]^_ $#"!    !"#$bcdefghicdefghi%kl&m'nkl&m'nopqrstuvwxyz{|}pqrstuvwxyz{|}(~~) *.-,++,-.   ;initializeWordNet looks for the word net data files in the F default directories, starting with environment variables WNSEARCHDIR & and WNHOME, and then falling back to  as defined in  NLP.WordNet.Consts. FinitializeWordNetWithOptions looks for the word net data files in the J specified directory. Use this if wordnet is installed in a non-standard " place on your machine and you don'(t have the appropriate env vars set up. 4closeWordNet is not strictly necessary. However, a ) tends to 8 hog a few Handles, so if you run out of Handles and won' t be using G your WordNetEnv for a while, you can close it and always create a new  one later. EgetIndexString takes a string and a part of speech and tries to find H that string (or something like it) in the database. It is essentially D a cannonicalization routine and should be used before querying the < database, to ensure that your string is in the right form. TgetSynsetForSense takes a sensekey and finds the appropriate Synset. SenseKeys can ! be built using indexToSenseKey. JreadSynset takes a part of speech, and an offset (the offset can be found + in another Synset) and (perhaps) a word we'"re looking for (this is optional)  and will return its Synset. NindexToSenseKey takes an Index (as returned by, ex., indexLookup) and a sense / number and returns a SenseKey for that sense. #      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~(non-portable (H98 + implicit parameters) experimentalhdaume@isi.edu/A Word is just a String. 0In actuality this type is:  ' type WN a = (?wne :: WordNetEnv) => a ,but Haddock cannot parse this at this time.  type WN a = a 1@This will give you the current release of the WordNet databases  we are using (if we know). 2JThis will give you the directory from which the databases are being read. 3 Given an E, this will tell you how many noun senses the searched-for word has. 4 Given an E, this will tell you how many verb senses the searched-for word has. 5 Given an J, this will tell you how many adjective senses the searched-for word has. 6 Given an G, this will tell you how many adverb senses the searched-for word has. 7 Given an D, this will tell you how many times this word was tagged as a noun. 8 Given an D, this will tell you how many times this word was tagged as a verb. 9 Given an J, this will tell you how many times this word was tagged as an adjective. : Given an G, this will tell you how many times this word was tagged as an adverb. ;#This gives the part of speech of a % <6This gives the definition of the sense of a word in a %. =*This gives a list of senses the word has. >LThis gives the actual words used to describe the Synset of a search result. ?This gives all the 8s a word has (i.e., what sort of relations hold between  it and other words. @This provides a (" (which can be searched for using  lookupKey) for  a %6 under a given form. For instance, it can be used to  get all #s of a given word. AThis converts a % into a (. B  !"#$%&'()*+,-./0123456789:;<=>?@A/0123456789:;<=>?@A(non-portable (H98 + implicit parameters) experimentalhdaume@isi.edu"A very slow queue based on lists. BA simple bag class for our X implementation. CDEFGH5Takes a WordNet command, initializes the environment  and returns the results in the  monad. WordNet ! warnings are printed to stderr. I5Takes a WordNet command, initializes the environment  and returns the results in the  monad. WordNet  warnings are ignored. J6Takes a FilePath to the directory holding WordNet and D a function to do with warnings and a WordNet command, initializes 0 the environment and returns the results in the  monad. K Gives you a ) which can be passed to N or used ; as the implicit parameter to the other WordNet functions. L6Takes a FilePath to the directory holding WordNet and . a function to do with warnings, initializes  the environment and returns a ) as in K. M+Closes all the handles associated with the ) . Since  the functions provided in the NLP.WordNet.WordNet module  are lazy , you shouldn't do this until you're really done. 5 Or perhaps not at all (GC will eventually kick in). NThis simply takes a ) and provides it as the , implicit parameter to the WordNet command. O!This takes a word and returns an  of all its senses  for all parts of speech. PThis takes an  (see O), a * and a  and returns  a list of search results. If  is , there will be one  %* in the results for each valid sense. If  is N a single sense number, there will be at most one element in the result list. Q This takes a /, a * and a  and returns ! the equivalent of first running O and then P. R This takes a ( (see A and @) and looks it  up in the databse. S This takes a  and a % and returns all  %' related to the given one by the given .  For example: 1 relatedBy Antonym (head (search "happy" Adj 1))  [<unhappy>]  1 relatedBy Hypernym (head (search "dog" Noun 1))  [<canine canid>] TKThis is a utility function to build lazy trees from a function and a root. U This enables -based trees to be built.  For example:  M take 5 $ flatten $ closureOn Antonym (head (search "happy" Adj AllSenses))) / [<happy>,<unhappy>,<happy>,<unhappy>,<happy>] 2 closureOn Hypernym (head (search "dog" Noun 1))) o - <dog domestic_dog Canis_familiaris> --- <canine canid> --- <carnivore>\-- > --- <placental placental_mammal eutherian eutherian_mammal> --- <mammal>\-- > --- <vertebrate craniate> --- <chordate> --- <animal animate_being beast\-- > brute creature fauna> --- <organism being> --- <living_thing animate_thing>\-- > --- <object physical_object> --- <entity> VAn empty stack. WAn empty queue. XDThis function takes an empty bag (in particular, this is to specify A what type of search to perform), and the results of two search. < It returns (maybe) the lowest point at which the two terms  meet in the WordNet hierarchy.  For example:  K meet emptyQueue (head $ search "cat" Noun 1) (head $ search "dog" Noun 1)  Just <carnivore> L meet emptyQueue (head $ search "run" Verb 1) (head $ search "walk" Verb 1)  Just <travel go move locomote> Y&This function takes an empty bag (see X$), and the results of two searches. < It returns (maybe) the lowest point at which the two terms G meet in the WordNet hierarchy, as well as the paths leading from each  term to this common term.  For example:  P meetPaths emptyQueue (head $ search "cat" Noun 1) (head $ search "dog" Noun 1) i Just ([<cat true_cat>,<feline felid>],<carnivore>,[<canine canid>,<dog domestic_dog Canis_familiaris>])  Q meetPaths emptyQueue (head $ search "run" Verb 1) (head $ search "walk" Verb 1) T Just ([<run>,<travel_rapidly speed hurry zip>],<travel go move locomote>,[<walk>]) 2This is marginally less efficient than just using X, since it uses 2 linear-time lookup for the visited sets, whereas X uses log-time  lookup. [  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ]0/*.-,+3456789:)12%&'&';<=>?@A$#"!  (HIJKLMNOPQRSTUXYZBCDEFGWVBCDEFGCDEFGHIJKLMNOPQRSTUVWXY      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghighjkklmnopqgrs-tuvwwxyz{|}~012STUgggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggg  g  g  g  g g g g g g g g g g g g g g g g g g g  g !g "g #g $g %g &g 'g (g )g *g +g ,g -g .g /g 0g 1g 2g 3g 4g 5g 6g 7g 8g 9g :g ;g <g =g >g ?g @g Ag Bg Cg Dg Eg Fg Gg Hg Ig Jg Kg LgMNgMOgMPgMQgMRgMSgMTgMUgMVgMWgMXgMYgMZgM[gM\gM]gM^gM_gM`gMagMbgMcgMdgMegMfgMggMhgMigMjgMkgMlgMmgMngMogMpgMqgMrgMsgMtguvguwguxguyguzg{|g{}g~g~g~g~ggggggggggggggggggggggggggggggggggggggggrgrggggggggggggggggggggggggggggggggggggggggggggggggggggggugugugugugugugugugugugu WordNet-0.1.2 NLP.WordNetNLP.WordNet.PrimTypesNLP.WordNet.UtilNLP.WordNet.ConstsNLP.WordNet.PrimsNLP.WordNet.CommonNLP.WordNet.TypesOverview SenseType SenseNumber AllSensesFormUnknown OverviewFormWNGrepHHolonymHMeronym RelativesCoordsFramesFreqSynsNominalizationClassClassification Derivation VerbGroup AttributeSeeAlsoPPLCauseToHolonymMeronymHasPartHasStuff HasMemberIsPartIsStuffIsMemberSimilar EntailmentHyponymHypernymAntonym SearchResult srOverview srSenseNumKey WordNetEnvPOSAdvAdjVerbNounWordWNgetReleaseVersiongetDataDirectory numNounSenses numVerbSenses numAdjSenses numAdvSensestaggedCountNounSensestaggedCountVerbSensestaggedCountAdjSensestaggedCountAdvSensessrPOS srDefinitionsrSensessrWordssrForms srFormKeyssrToKeyBagemptyBagaddToBag addListToBag isEmptyBagsplitBag runWordNetrunWordNetQuietrunWordNetWithOptionsinitializeWordNetinitializeWordNetWithOptions closeWordNetruns getOverviewsearchByOverviewsearch lookupKey relatedByclosure closureOn emptyStack emptyQueuemeet meetPathsmeetSearchPaths nounIndex verbIndexadjIndexadvIndexbaseGHC.NumNum fromIntegerIndex indexWordindexPOSindexSenseCount indexFormsindexTaggedCount indexOffsetsGHC.ShowShow srSenseKeysrIndexsrSynsetSynsethereIAmssTypefnumposssWords whichWordformsframesdefnkey searchTypeheadWord headSenseSenseKey senseKeyPOSsenseKeyString senseKeyWord dataHandles excHandles senseHandlecountListHandlekeyIndexHandlerevKeyIndexHandle vSentHandlewnReleaseVersion dataDirectory warnAboutEPOS Pertainym UnknownEPos DirectAnt IndirectAnt AdjSatellite SatelliteOffsetreadEPOSallPOSfromEPOSallEPOS wordNetEnv0synset0index0IOModeEx AsciiMode BinaryMode maybeReadmatchNsensesOftryMaybe tryMaybeWarnpartNamecannonWNString openFileExfst3snd3thr3lexIdpadTo charForPOS replaceChargetPointerTypemakePathdictDir defaultPath defaultBingetIndexStringgetSynsetForSense readSynsetindexToSenseKey indexLookup binarySearchGHC.Base++foldrGHC.Listconcatfilterzipassertmapfail>>=>>returnMonadFunctor Control.Monad MonadPlusghc-prim GHC.TypesCharStringControl.OldExceptiongetUncaughtExceptionHandlersetUncaughtExceptionHandlerbracketOnErrorbracket_finallybracket userErrorsasyncExceptions dynExceptions assertions errorCallsarithExceptionsioErrorscatchDyn throwDynTothrowDyntryJusttry mapException handleJusthandle catchJustcatchArithExceptionArrayExceptionAssertionFailedAsyncExceptionBlockedOnDeadMVarBlockedIndefinitelyNestedAtomicallyDeadlock DynException ErrorCall ExitException IOException NoMethodErrorNonTerminationPatternMatchFail RecConError RecSelError RecUpdError ExceptionGHC.ConcthrowToGHC.IO.ExceptionioError StackOverflow HeapOverflow ThreadKilled UserInterruptIndexOutOfBoundsUndefinedElement Data.Listunwordswordsunlineslinesproductsumfoldl1'foldl1foldl'unfoldrsortsortBy permutations subsequencestailsinitsgroupBygroupdeleteFirstsByunzip7unzip6unzip5unzip4zipWith7zipWith6zipWith5zipWith4zip7zip6zip5zip4genericReplicate genericIndexgenericSplitAt genericDrop genericTake genericLength minimumBy maximumByminimummaximuminsertByinsert mapAccumR mapAccumL partition transpose intercalate intersperse intersectBy intersectunionByunion\\deleteBydeletenubBynub isInfixOf isSuffixOf isPrefixOf findIndices findIndexfind elemIndices elemIndex stripPrefix Data.Char isSeparatorisSymbol isPunctuationisNumberisMarkisLettergeneralCategory digitToIntUppercaseLetterLowercaseLetterTitlecaseLetterModifierLetter OtherLetterNonSpacingMarkSpacingCombiningMark EnclosingMark DecimalNumber LetterNumber OtherNumberConnectorPunctuationDashPunctuationOpenPunctuationClosePunctuation InitialQuote FinalQuoteOtherPunctuation MathSymbolCurrencySymbolModifierSymbol OtherSymbolSpace LineSeparatorParagraphSeparatorControlFormat Surrogate PrivateUse NotAssignedGeneralCategory GHC.UnicodetoTitletoUppertoLower isAsciiUpper isAsciiLowerGHC.Read readLitChar lexLitCharGHC.IOevaluateunblockblockthrowIO GHC.ExceptionthrowOverflow UnderflowLossOfPrecision DivideByZeroDenormalapliftM5liftM4liftM3liftM2liftMunlesswhen replicateM_ replicateMfoldM_foldM zipWithM_zipWithM mapAndUnzipMjoinforever<=<>=>msumforM_forMfilterMguardmapM_mapM sequence_sequence=<<mplusmzero intToDigit showLitCharunzip3unzipzipWith3zipWithzip3!! concatMaplookupnotElemelemallanyorandreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrfoldr1scanl1scanlfoldllengthnullinitlasttailhead Data.MaybemapMaybe catMaybes listToMaybe maybeToList fromMaybefromJust isNothingisJustmaybeNothingJustMaybeordchrfmapisAsciiisLatin1 isControlisPrintisSpaceisUpperisLowerisAlphaisDigit isOctDigit isHexDigit isAlphaNumQueueIO