GenI 0.20.2 → 0.22

raw patch · 86 files changed

+10501/−13047 lines, 86 filesdep +GenIdep +MaybeTdep +bytestringdep −paralleldep −test-framework-quickcheckdep −uniplatedep ~QuickCheckdep ~basedep ~binarysetup-changedPVP ok

version bump matches the API change (PVP)

Dependencies added: GenI, MaybeT, bytestring, cabal-macosx, deepseq, hslogger, old-locale, ordered, smallcheck, syb, test-framework-quickcheck2, test-framework-smallcheck, text, time, yaml-light

Dependencies removed: parallel, test-framework-quickcheck, uniplate, wx

Dependency ranges changed: QuickCheck, base, binary, filepath, json, mtl, parsec, split, test-framework, utf8-string

API changes (from Hackage documentation)

Files

• GenI.cabal +98/−68
• INSTALL +4/−5
• NEWS +108/−0
• README +17/−14
• Setup.hs +1/−116
• etc/macstuff/Info.plist +0/−36
• etc/macstuff/wxmac.icns binary
• etc/stupidmorph.pl +0/−85
• examples/artificial/lexicon +8/−0
• examples/artificial/macros +0/−126
• examples/artificial/suite +5/−0
• examples/artificial/suite-bad +2/−0
• examples/artificial/trees +150/−0
• examples/chatnoir/macros +0/−132
• examples/chatnoir/trees +132/−0
• examples/demo/macros +0/−439
• examples/demo/trees +439/−0
• examples/ej/lexicon +4/−0
• examples/ej/macros +0/−92
• examples/ej/suite +6/−0
• examples/ej/trees +92/−0
• examples/nosemantics/macros +0/−363
• examples/nosemantics/trees +363/−0
• examples/promettre/macros +0/−450
• examples/promettre/trees +450/−0
• examples/xmg-example/Makefile +4/−8
• geni-test/MainTest.hs +5/−0
• geni-test/NLP/GenI/Test.hs +53/−0
• geni/geni.hs +20/−0
• src/BoolExp.hs +12/−0
• src/Data/FullList.hs +14/−0
• src/Data/FullList/Internal.hs +80/−0
• src/MainGeni.lhs +0/−126
• src/NLP/GenI.hs +872/−0
• src/NLP/GenI/Btypes.lhs +0/−757
• src/NLP/GenI/BtypesBinary.hs +0/−59
• src/NLP/GenI/Builder.hs +404/−0
• src/NLP/GenI/Builder.lhs +0/−562
• src/NLP/GenI/BuilderGui.lhs +0/−34
• src/NLP/GenI/Configuration.hs +735/−0
• src/NLP/GenI/Configuration.lhs +0/−891
• src/NLP/GenI/Console.hs +208/−119
• src/NLP/GenI/FeatureStructure.hs +186/−0
• src/NLP/GenI/Flag.hs +146/−0
• src/NLP/GenI/General.hs +104/−120
• src/NLP/GenI/Geni.lhs +0/−1149
• src/NLP/GenI/GeniParsers.lhs +0/−919
• src/NLP/GenI/GeniShow.hs +36/−138
• src/NLP/GenI/GeniVal.hs +26/−289
• src/NLP/GenI/GeniVal/Internal.hs +428/−0
• src/NLP/GenI/Graphviz.hs +0/−214
• src/NLP/GenI/GraphvizShow.hs +0/−199
• src/NLP/GenI/GraphvizShowPolarity.lhs +0/−130
• src/NLP/GenI/Gui.lhs +0/−778
• src/NLP/GenI/GuiHelper.hs +0/−750
• src/NLP/GenI/LexicalSelection.hs +425/−0
• src/NLP/GenI/LexicalSelection/Types.hs +149/−0
• src/NLP/GenI/Lexicon.hs +27/−0
• src/NLP/GenI/Lexicon/Internal.hs +203/−0
• src/NLP/GenI/Main.hs +58/−0
• src/NLP/GenI/Morphology.hs +218/−0
• src/NLP/GenI/Morphology.lhs +0/−233
• src/NLP/GenI/Morphology/Types.hs +104/−0
• src/NLP/GenI/OptimalityTheory.hs +343/−0
• src/NLP/GenI/OptimalityTheory.lhs +0/−390
• src/NLP/GenI/Parser.hs +633/−0
• src/NLP/GenI/Polarity.hs +572/−0
• src/NLP/GenI/Polarity.lhs +0/−1206
• src/NLP/GenI/Polarity/Internal.hs +190/−0
• src/NLP/GenI/Polarity/Types.hs +84/−0
• src/NLP/GenI/PolarityTypes.hs +0/−44
• src/NLP/GenI/Pretty.hs +88/−0
• src/NLP/GenI/Regression.hs +0/−83
• src/NLP/GenI/Semantics.hs +267/−0
• src/NLP/GenI/Simple/SimpleBuilder.hs +937/−0
• src/NLP/GenI/Simple/SimpleBuilder.lhs +0/−1225
• src/NLP/GenI/Simple/SimpleGui.lhs +0/−208
• src/NLP/GenI/Statistics.hs +20/−2
• src/NLP/GenI/SysGeni.hs +0/−77
• src/NLP/GenI/Tag.hs +396/−0
• src/NLP/GenI/Tags.lhs +0/−380
• src/NLP/GenI/Test.hs +0/−31
• src/NLP/GenI/TestSuite.hs +46/−0
• src/NLP/GenI/TreeSchema.hs +351/−0
• src/NLP/GenI/Warning.hs +32/−0
• src/NLP/GenI/Warning/Internal.hs +146/−0

@@ -1,5 +1,5 @@ Name:           GenI-Version:        0.20.2+Version:        0.22 License:        GPL License-file:   LICENSE Author:         Carlos Areces and Eric Kow@@ -8,28 +8,28 @@ Description:    A natural language generator (specifically, an FB-LTAG surface realiser) Homepage:       http://projects.haskell.org/GenI Maintainer:     geni-users@loria.fr-Build-Type:     Custom-Cabal-Version: >=1.2.3+Build-Type:     Simple+Cabal-Version: >=1.8 data-files: AUTHORS, INSTALL, README, NEWS, GenI.cabal,             examples/artificial/lexicon,-            examples/artificial/macros,+            examples/artificial/trees,             examples/artificial/suite,             examples/artificial/suite-bad,             examples/chatnoir/lexicon,-            examples/chatnoir/macros,+            examples/chatnoir/trees,             examples/chatnoir/suite,             examples/demo/lexicon,-            examples/demo/macros,+            examples/demo/trees,             examples/demo/README,             examples/demo/suite,             examples/ej/lexicon,-            examples/ej/macros,+            examples/ej/trees,             examples/ej/suite,             examples/nosemantics/lexicon,-            examples/nosemantics/macros,+            examples/nosemantics/trees,             examples/nosemantics/README.txt,             examples/promettre/lexicon,-            examples/promettre/macros,+            examples/promettre/trees,             examples/promettre/morphinfo,             examples/promettre/suite,             examples/xmg-example/grammar/Arguments.mg,@@ -44,93 +44,123 @@             examples/xmg-example/lexicon/demo-morph-utf8.mph,             examples/xmg-example/Makefile,             examples/xmg-example/README,-            examples/xmg-example/suite,-            etc/stupidmorph.pl,-            etc/macstuff/Info.plist,-            etc/macstuff/wxmac.icns--extra-source-files: src/NLP/GenI/SysGeni.hs-                    src/NLP/GenI/Test.hs-                    src/NLP/GenI/Simple/SimpleGui.lhs,-                    src/NLP/GenI/Gui.lhs-                    src/NLP/GenI/GraphvizShow.hs,-                    src/NLP/GenI/GuiHelper.hs-                    src/NLP/GenI/Console.hs,-                    src/NLP/GenI/Graphviz.hs-                    src/NLP/GenI/BuilderGui.lhs,-                    src/NLP/GenI/GraphvizShowPolarity.lhs,-                    src/NLP/GenI/Regression.hs+            examples/xmg-example/suite +extra-source-files: geni-test/NLP/GenI/Test.hs -Flag gui-  description: Build with a graphical user interface-  default: False+source-repository head+  type:     darcs+  location: http://code.haskell.org/GenI  Flag static   Description: Build a static binary   Default:     False  Library-  Build-depends: parsec >= 2 && < 3,-                 base >= 3 && < 4,-                 containers >= 0.1,-                 process > 1,-                 QuickCheck >= 1.2 && < 2,-                 json >= 0.4.3 && < 0.5,-                 HUnit > 1 && < 1.3,-                 mtl > 1.0 && < 1.2,-                 parallel >= 1.1 && < 1.2,-                 binary >= 0.5.0.2 && < 0.6,-                 split >= 0.1.1 && < 0.2,-                 test-framework-hunit >= 0.2.4 && < 0.3,-                 test-framework-quickcheck >= 0.2.4 && < 0.3,-                 test-framework >= 0.2.4 && < 0.3,-                 utf8-string >= 0.3.5 && < 0.4,-                 uniplate >= 1.2.0 && < 1.3--  if !flag(gui)-    cpp-options:      -DDISABLE_GUI+  Build-depends: base >= 4 && < 5+               , binary >= 0.5.0.2+               , bytestring  == 0.9.*+               , cabal-macosx  >= 0.1.2 && < 0.3+               , containers >= 0.1+               , deepseq+               , directory   > 1+               , filepath    == 1.*+               , hslogger == 1.1.*+               , json >= 0.4.3 && < 0.6+               , MaybeT == 0.1.*+               , mtl > 1.0 && < 2.1+               , old-locale+               , ordered == 0.1.*+               , parsec >= 2 && < 3.2+               , process > 1+               , split >= 0.1.1 && < 0.2+               , syb+               , text+               , time >= 1.1 && < 1.3+               , utf8-string >= 0.3.5 && < 0.4+               , yaml-light  == 0.1.*    if flag(static)     ghc-options: -static -optl-static    Exposed-Modules:-                NLP.GenI.Btypes,-                NLP.GenI.BtypesBinary,+                BoolExp,+                Data.FullList.Internal,+                Data.FullList,+                NLP.GenI.Console,+                NLP.GenI.FeatureStructure,+                NLP.GenI.Flag,                 NLP.GenI.General,-                NLP.GenI.GeniParsers,                 NLP.GenI.GeniShow,                 NLP.GenI.GeniVal,-                NLP.GenI.Tags,+                NLP.GenI.GeniVal.Internal,+                NLP.GenI.Lexicon,+                NLP.GenI.Lexicon.Internal,+                NLP.GenI.LexicalSelection,+                NLP.GenI.LexicalSelection.Types,+                NLP.GenI.Main,+                NLP.GenI.Parser,+                NLP.GenI.Pretty,+                NLP.GenI.Semantics,+                NLP.GenI.Tag,+                NLP.GenI.TestSuite,+                NLP.GenI.TreeSchema,+                NLP.GenI.Warning,+                NLP.GenI.Warning.Internal,                 NLP.GenI.Morphology,+                NLP.GenI.Morphology.Types,                 NLP.GenI.OptimalityTheory,                 NLP.GenI.Polarity,-                NLP.GenI.PolarityTypes,+                NLP.GenI.Polarity.Internal,+                NLP.GenI.Polarity.Types,                 NLP.GenI.Automaton,                 NLP.GenI.Statistics,                 NLP.GenI.Builder,                 NLP.GenI.Simple.SimpleBuilder,-                -- NLP.GenI.CkyEarley.CkyBuilder,-                NLP.GenI.Geni, NLP.GenI.Configuration+                NLP.GenI.Configuration,+                NLP.GenI+  Other-Modules:+                Paths_GenI    Hs-Source-Dirs: src-  Extensions:     CPP, Rank2Types, OverlappingInstances, MultiParamTypeClasses, FlexibleContexts, TypeSynonymInstances,  FlexibleInstances, DeriveDataTypeable, ExistentialQuantification, LiberalTypeSynonyms-  Ghc-options:    -Wall -O2+  Ghc-options:    -Wall   Ghc-prof-options: -auto-all  Executable     geni- Main-Is:        MainGeni.lhs- Hs-Source-Dirs: src- Extensions:     CPP, Rank2Types, OverlappingInstances, MultiParamTypeClasses, FlexibleContexts, TypeSynonymInstances,  FlexibleInstances, DeriveDataTypeable, ExistentialQuantification, LiberalTypeSynonyms+ Main-Is:        geni.hs+ Hs-Source-Dirs: geni - Ghc-options:    -Wall -O2+ Ghc-options:    -Wall -rtsopts  Ghc-prof-options: -auto-all- Build-Depends: directory > 1,-                filepath >= 1.1.0 && < 1.2- if flag(gui)-    Build-Depends: wx >= 0.10.3 && < 0.13- else-    cpp-options:      -DDISABLE_GUI+ Build-Depends: base >= 4 && < 5+              , GenI+              , containers  >= 0.1+              , directory   > 1+              , filepath    == 1.*+              , yaml-light  == 0.1.*+              , hslogger    == 1.1.*+              , json        >= 0.4 && < 0.6+              , mtl         > 1.0 && < 2.1+              , process     > 1+              , split       == 0.1.*+              , utf8-string == 0.3.* - if flag(static)-    ghc-options: -static -optl-static+Test-Suite geni-test+ Type:          exitcode-stdio-1.0+ Main-Is:       MainTest.hs+ Hs-Source-Dirs: geni-test+ Build-Depends:    GenI+                 , base >= 4 && < 5+                 , containers  >= 0.1+                 , filepath   == 1.*+                 , json+                 , mtl+                 , parsec >= 2 && < 3.2+                 , QuickCheck == 2.4.*+                 , smallcheck+                 , HUnit > 1 && < 1.3+                 , test-framework-hunit >= 0.2.4 && < 0.3+                 , test-framework-quickcheck2 >= 0.2.4 && < 0.3+                 , test-framework-smallcheck+                 , test-framework > 0.3+                 , text

@@ -1,13 +1,12 @@ Requirements ------------- * GHC 6.8 or 6.10- * libgmp (for ghc)+ * Haskell Platform 2011.3.0.0  GUI requirements ---------------- Only needed if you want the graphical interface:  * wxWidgets 2.8- * wxHaskell 0.11+ * wxHaskell  * Graphviz  Building GenI@@ -15,7 +14,7 @@ 1. obtain cabal-install 2. run: cabal install 3. if you want the graphical interface, try-    cabal install -fgui+    cabal install ./geni-gui    but ONLY AFTER you succeed in installing the text version :-) -For more details, see http://trac.haskell.org/GenI+For more details, see http://projects.haskell.org/GenI

@@ -1,3 +1,111 @@+GenI 0.22, 14 Apr 2012+----------------------+Note that the changes between this release and 0.20 are considered to be under+the BSD3 license.  GenI overall remains dual-licensed under the GPL and any+commercial-use terms you may wish to negotiate with INRIA. Having secured the+rights to use GenI 0.20, you may freely use GenI 0.22 in a similar fashion.++CHANGES TO WATCH OUT FOR++* Separation of geni and geni-gui into two packages;+  simpler installation+* Now using the top feature for lemanchors instead of bot+* Empty disjunctions forbidden in unification variables+* JSON input/output to morph processors have changed+* Lexical selection unifies semantics of tree schema + lemma with+  input semantics.++GUI++* New results tab with reminder of inputs+* Add gui element to display unanchored lexical selection.+* Jump to new tab in debugger panel when created.+* Update gui to use Pretty instead of Show+* Rename $algo-session tab to "tree assembly"+* Make warnings resizable.+* Fix display of path equations with 'interface' in them.+* Fix #50 - load button has no effect.+* Fix #49 - correct order that leaf nodes are returned.+* Show GenI version in About box.+* Add detect polarities and root feature editor to main gui.++DOCUMENTATION++* Literate GenI and genimanual replaced with+  http://projects.haskell.org/GenI/manual++GENERAL++* Builds with GHC 7+* Core behaviour+     * Early null-adjunction and semfilter obligatory+     * Handling of zero-literal semantic items restored+     * Unconstrained polarities in automaton construction.+       This makes it possible to do polarity detection with only a+       weakly specified root feature like [cat:_], and without needing+       the relevant feature to be implemented everywhere.++* Flags:+     * --trees (used to be --macros; latter is deprecated)+     * --batchdir now optional (defaults to a new temp dir)+     * --maxsteps (stop after N steps)+     * --extrapol REMOVED (use root feature instead)+* Logging facility (not used much in GenI yet)+  Can be configured in ~/.geni/config.yaml, for example+  logging:+   -+     name     : NLP.GenI.Console+     level    : WARN+     format   : simple "$msg"+   -+     name     : NLP.Geni.LexicalSelection+     level    : DEBUG+     format   : simple "$utcTime $loggername $msg"+     handler  : stderr+* Less repetition in warnings (hopefully easier to read)+* More hiding of constructors for safety+* New enrichment option for setting co-anchors (foo.lex=hello)+* Lexical selection performance enhancements+* Variables that only occur once are converted to anonymous,+  should make unification a bit more efficient+* Fix #39: reject malformed root feature input.+* New feature:+  * Variables with constraints on their possible values (?X/foo|bar)+  * Fancy disjunctions: tree schemata now allow disjunctions of+    unification variables (but not recursive). These must flatten down+    to plain old atomic disjunction once converted to elementary trees++* Time metric in statistics (Laura Perez)+* Do top/bottom unification on na-constrained nodes during initialisation.+* Polarity detection relaxed to work with constrained variables too.+  (?X/foo|bar gives the result as foo|bar)+* Bugfix in interpretation of root feature (it should be sorted).+* Flags:+  * --rootfeat always assumed, but defaults to '[cat:_]'+  * '-r' a short command line option for '--rootfeat'.++LIBRARY++* Somewhat safer and easier to understand API+  (still no stability yet)+* Replace String with Text in GeniVal+* Replace Show abuse with custom Pretty class+* Slightly less stateful (no target semantics in state)+* Much rearranging and renaming (sorry!)+* New: ability to provide custom lexical selection action+* New: ability to provide custom morph postprocessing action+* de-haskell98 (Gwern Branwen)+* No more null builder.++TOOLS (darcs get --lazy http://code.haskell.org/GenI)++* new tool, genireport: summarise batch generation results+* geniserver now talks over HTTP using a JSON format+* Use Sylvain Salvati's xmg2geni.xsl instead of geniconvert.+    * xmg2geni: fix treatment of missing lexemes.+    * xmg2geni: treat type=coanchor as other nodes in GenI.+* geniwrapper: illustrates C wrapper of GenI API+ GenI 0.20, 29 Sep 2009 ---------------------- - NON BACKWARD-COMPATIBLE CHANGES

@@ -1,24 +1,27 @@-documentation+Documentation --------------make doc # (pdflatex and haddock are needed)- 1. users manual: -     http://wiki.loria.fr/wiki/GenI-2. semi-literate source code: -     doc/genidoc.pdf -3. API: -     doc/api/index.html+     http://projects.haskell.org/GenI/manual+2. API:+     http://projects.haskell.org/GenI/api-doc -installing GenI+Installing GenI ----------------(tested on Linux and MacOs X)+(tested on Linux, Windows, and MacOS X) -see INSTALL for details+see INSTALL for details (should just be cabal install) -assuming everything above is installed correctly,-it should possible to just make+Development+-----------+The code style has evolved a lot.  Sorry for the inconsistency.+As of 2012-05-06, I'm trying to move to a published style guide+so I can stop thinking about it -contact us!+  https://github.com/tibbe/haskell-style-guide++But the code will take a long time to catch up++Contact us! ----------- Please let us know if you are using GenI; we'd like to hear about your experiences, both positive and negative.

@@ -1,117 +1,2 @@-{-# LANGUAGE CPP #-}--import Control.Monad (foldM_, forM_)-import Data.Maybe ( fromMaybe )-import System.Cmd-import System.Exit-import System.Info (os)-import System.FilePath-import System.Directory ( doesFileExist, copyFile, removeFile, createDirectoryIfMissing )--import Distribution.PackageDescription-import Distribution.Simple.Setup import Distribution.Simple-import Distribution.Simple.LocalBuildInfo--#ifndef WIN32-import System.Posix.Files (fileMode, getFileStatus, setFileMode,-                           ownerExecuteMode, groupExecuteMode, otherExecuteMode)-import Data.Bits ( (.|.) )-#endif--main :: IO ()-main = defaultMainWithHooks $ addMacHook simpleUserHooks- where-  addMacHook h =-   case os of-    "darwin" -> h { postInst = appBundleHook } -- is it OK to treat darwin as synonymous with MacOS X?-    _        -> h--appBundleHook :: Args -> InstallFlags -> PackageDescription -> LocalBuildInfo -> IO ()-appBundleHook _ _ pkg localb =- forM_ exes $ \app ->-   do createAppBundle theBindir (buildDir localb </> app </> app)-      customiseAppBundle (appBundlePath theBindir app) app-        `catch` \err -> putStrLn $ "Warning: could not customise bundle for " ++ app ++ ": " ++ show err-      removeFile (theBindir </> app)-      createAppBundleWrapper theBindir app- where-  theBindir = bindir $ absoluteInstallDirs pkg localb NoCopyDest-  exes = fromMaybe (map exeName $ executables pkg) mRestrictTo---- ------------------------------------------------------------------------- helper code for application bundles--- -------------------------------------------------------------------------- | 'createAppBundle' @d p@ - creates an application bundle in @d@---   for program @p@, assuming that @d@ already exists and is a directory.---   Note that only the filename part of @p@ is used.-createAppBundle :: FilePath -> FilePath -> IO ()-createAppBundle dir p =- do createDirectoryIfMissing False $ bundle-    createDirectoryIfMissing True  $ bundleBin-    createDirectoryIfMissing True  $ bundleRsrc-    copyFile p (bundleBin </> takeFileName p)- where-  bundle     = appBundlePath dir p-  bundleBin  = bundle </> "Contents/MacOS"-  bundleRsrc = bundle </> "Contents/Resources"---- | 'createAppBundleWrapper' @d p@ - creates a script in @d@ that calls---   @p@ from the application bundle @d </> takeFileName p <.> "app"@-createAppBundleWrapper :: FilePath -> FilePath -> IO ()-createAppBundleWrapper bindir p =-  do writeFile scriptFile scriptTxt-     makeExecutable scriptFile- where-  scriptFile = bindir </> takeFileName p-  scriptTxt = "`dirname $0`" </> appBundlePath "." p </> "Contents/MacOS" </> takeFileName p ++ " \"$@\""--appBundlePath :: FilePath -> FilePath -> FilePath-appBundlePath dir p = dir </> takeFileName p <.> "app"---- ------------------------------------------------------------------------- utilities--- ------------------------------------------------------------------------makeExecutable :: FilePath -> IO ()-#ifdef WIN32-makeExecutable = const (return ())-#else-makeExecutable f =-  do st <- getFileStatus f-     let m  = fileMode st-         m2 = m .|. ownerExecuteMode .|. groupExecuteMode .|. otherExecuteMode-     setFileMode f m2-#endif---- ------------------------------------------------------------------------- customisations--- -------------------------------------------------------------------------- | Put here IO actions needed to add any fancy things (eg icons)---   you want to your application bundle.-customiseAppBundle :: FilePath -- ^ app bundle path-                   -> FilePath -- ^ full path to original binary-                   -> IO ()-customiseAppBundle bundleDir p =- case takeFileName p of-  "geni" ->-    do hasRez <- doesFileExist "/Developer/Tools/Rez"-       if hasRez-          then do -- set the icon-                  copyFile "etc/macstuff/Info.plist" (bundleDir </> "Contents/Info.plist")-                  copyFile "etc/macstuff/wxmac.icns" (bundleDir </> "Contents/Resources/wxmac.icns")-                  -- no idea what this does-                  system ("/Developer/Tools/Rez -t APPL Carbon.r -o " ++ bundleDir </> "Contents/MacOS/geni")-                  writeFile (bundleDir </> "PkgInfo") "APPL????"-                  -- tell Finder about the icon-                  system ("/Developer/Tools/SetFile -a C " ++ bundleDir </> "Contents")-                  return ()-          else putStrLn "Developer Tools not found.  Too bad; no fancy icons for you."-  ""     -> return ()---- | Put here the list of executables which contain a GUI.  If they all---   contain a GUI (or you don't really care that much), just put Nothing-mRestrictTo :: Maybe [String]-mRestrictTo = Just ["geni"]+main = defaultMain

@@ -1,36 +0,0 @@-<?xml version="1.0" encoding="UTF-8"?>-<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">-<plist version="1.0">-<dict>-	<key>CFBundleDevelopmentRegion</key>-	<string>English</string>-	<key>CFBundleExecutable</key>-	<string>geni</string>-	<key>CFBundleGetInfoString</key>-	<string>GenI</string>-	<key>CFBundleIconFile</key>-	<string>wxmac.icns</string>-	<key>CFBundleIdentifier</key>-	<string>fr.loria.geni</string>-	<key>CFBundleInfoDictionaryVersion</key>-	<string>6.0</string>-	<key>CFBundleLongVersionString</key>-	<string>(c) 2005-2009 LORIA</string>-	<key>CFBundleName</key>-	<string>GenI</string>-	<key>CFBundlePackageType</key>-	<string>APPL</string>-	<key>CFBundleShortVersionString</key>-	<string>0</string>-	<key>CFBundleSignature</key>-	<string>????</string>-	<key>CFBundleVersion</key>-	<string>0</string>-	<key>CSResourcesFileMapped</key>-	<true/>-	<key>LSRequiresCarbon</key>-	<true/>-	<key>NSHumanReadableCopyright</key>-	<string>Copyright 2005-2009 LORIA</string>-</dict>-</plist>

binary file changed (46234 → absent bytes)

@@ -1,85 +0,0 @@-:-eval 'exec perl -w -S $0 ${1+"$@"}'- if 0; --use strict;-use JSON;--# ---------------------------------------------------------------------# idiotic morphological generator-#-# this outputs for each lemma the name of the lemma and its category-# ----------------------------------------------------------------------# ---------------------------------------------------------------------# from GenI-# ----------------------------------------------------------------------# we return a list of lists of hashes-# - each item in the outer list corresponds to a sentence-# - each item in the inner list corresponds to a word-# - each hash represents the features read from GenI plus a special "__lemma__" feature-#   which holds the lemma-sub read_morph_request {-  my $json_str = shift;-  my $allR = from_json $json_str;-  my @r_sentences = (); # one request per sentence--  foreach my $sentenceR (@$allR) {-    my @r_words = ();-    foreach my $wordR (@$sentenceR) {-      my $lemma = $wordR->{lemma};-      my $featstr = $wordR->{"lemma-features"};-      $featstr =~ s/^\[//;-      $featstr =~ s/\]$//;--      my %feat = ();-      my $av = "";-      for (split(/ /, $featstr)) {-        $av = $_;-        my ($attr, $val) = split(/:/,$av);-        $feat{$attr} = $val;-      }-      $feat{"__lemma__"} = $lemma;-      push @r_words, \%feat;-    }-    push @r_sentences, \@r_words;-  }-  return \@r_sentences-}--# ---------------------------------------------------------------------# morph-# ----------------------------------------------------------------------sub morph {-  my $lemma = shift;-  my $featsR = shift;-  my $cat = $featsR->{"cat"};-  return "$lemma:$cat";-}--# ---------------------------------------------------------------------# main-# ----------------------------------------------------------------------# slurp STDIN to $buf (copied from web)-my $holdTerminator = $/;-undef $/;-my $buf = <STDIN>;-$/ = $holdTerminator;--my @output = ();-my $reqsR = read_morph_request $buf;-foreach my $sentenceR (@$reqsR) {-  my @output_words = ();-  foreach my $wordR (@$sentenceR) {-    my $inflected = morph($wordR->{"__lemma__"}, $wordR);-    push @output_words, $inflected;-  }-  my $output_sentence = join(" ",@output_words);-  my @singleton = ( $output_sentence );-  push @output, \@singleton;-}--print to_json(\@output);

@@ -46,7 +46,10 @@ tb-unification-noadj tb-unification-noadj () semantics:[tb-unification-noadj()] tb-unification-bot   tb-unification-bot () semantics:[tb-unification-bot()] tb-unification-adj   tb-unification-adj () semantics:[tb-unification-adj()]+tb-unification-na       tb-unification-na(?X)     semantics:[tb-unification-na(?X)]+tb-unification-anchor   tb-unification-anchor(?X) semantics:[tb-unification-anchor(?X)] + no-thing   no-thing   () semantics:[no-thing()] thing-good thing-good () semantics:[thing-good()] thing-bad  thing-bad  () semantics:[thing-bad()]@@ -54,3 +57,8 @@ "string-literal-in-lemma" term () semantics:["string-lit'+!|"(foo)]  lemanchor lemanchor() semantics:[lemanchor()]++preterminal preterminal() semantics:[preterminal()]++disjunction disjunction(x y z) semantics:[disjunction()]+variablecat variablecat(x y z) semantics:[variablecat()]

@@ -1,126 +0,0 @@-% trivial example of the kid to parent rule-k2p-trivial() initial -Mother [cat:a]![] { Anchor anchor [ cat:x ]![] }--% note: the alphabetical names below are meaningless - they are just-% chinese numbers (which is why i follow them by the equivalent -% arabic numerals)-%-% why do i name them this way? dunno... figured they'd be easier-% to see or something---yi1() initial-YiMo [cat:a tb:?T]![tb:?B] {- YiLe anchor [ cat:x ]![]- YiRi type:subst  [ cat:b ]![]-}--er2() initial-Mother [cat:b]![] {-  Left anchor [ cat:x ]![]-  Right type:subst [ cat:t1 ]![]-}--term(?C ?X) initial-T anchor [cat:?C foo:?X]![]--aux-bad() auxiliary-Mother [cat:t1 tb:foo]![] {-  Left anchor [ cat:x ]![]-  Foot type:foot [cat:t1]![tb:bar]-}--aux-good() auxiliary-MothA [cat:t1 tb:ping]![] {-  LeftA anchor [cat:x]![]-  FootA type:foot [cat:t1]![tb:ping]-}--aux-nepas () auxiliary-Mother [cat:t1 tb:ping]![] {-  Left anchor [cat:x]![]-  Foot type:foot [cat:t1]![tb:ping]-  Right type:lex "pas"-}----% meant to receive substitution from san3 -% if it works - ?A should be set to bar-wu5 () initial-WuM [cat:a foo:?A]![] {-  WuL anchor [cat:x]![]-  WuR type:subst [cat:t1 foo:?A]![]-}--% a simple tb unification which ought to work-liu6-good () initial -Mother [cat:a]![cat:a] { Anchor anchor [cat:x]![] }--% unification + subst should work, but this should NOT propagate up! -% this should NOT propagate up-wu5-bad () initial-Mother [cat:a foo:?A]![] {-  Anch anchor [cat:x]![]-  Left  type:subst [cat:t1 foo:?A]![]-  Right type:subst [cat:t2 foo:?A]![]-}----% top-bot unification failure (simple)-liu6-bad1 () initial -Mother [cat:a]![cat:b] { Anch anchor [cat:x]![] }--% top-bot unification (complex)-liu6-bad2 () initial -Mother [cat:a tb:?X]![tb:?Y] {-  Anch anchor [cat:x]![]-  Left  type:subst [cat:t1 foo:?X]![]-  Right type:subst [cat:t2 foo:?Y]![]-}--% this should still be passed-iaf-killer-good (?X) initial-Mother [cat:a]![cat:a] {-  Anch anchor [cat:x]![]-  Left  type:subst [cat:t1 idx:?X]![]-  Right type:subst [cat:t2 idx:?X]![]-}--aconstr-with-anchor () initial-Anch anchor aconstr:noadj [cat:a]![]--% this succeeds iff thing is good or left unset-tb-unification-noadj () initial-M [cat:a]![] {-  X type:subst [cat:x thing:?X]![thing:good]-  Y anchor [cat:b]![]-}--tb-unification-bot() initial-M anchor [cat:a]![]--tb-unification-adj() auxiliary-M [cat:a]![idx:b] {- X anchor [cat:b]![]- Y type:foot [cat:a]![]-}--no-thing () initial-X anchor [cat:x]![]--thing-good () initial-X anchor [cat:x thing:good]![]--thing-bad () initial-X anchor [cat:x thing:bad]![]--lemanchor () initial-M [cat:x]![] {-  X anchor [cat:x]![]-  Y type:subst [cat:y]![lemanchor:hello]-  Z type:subst [cat:y]![lemanchor:world]-}-

@@ -25,5 +25,10 @@ tb-noadj-good-2 semantics:[tb-unification-noadj() thing-good()] tb-unification-1 semantics:[tb-unification-bot()] tb-unification-2 semantics:[tb-unification-bot() tb-unification-adj()]+tb-unification-na-good semantics:[tb-unification-na(good)]+tb-unification-anchor-good semantics:[tb-unification-anchor(good)]  lemanchor semantics:[lemanchor()]+preterminal semantics:[preterminal()]+disjunction semantics:[disjunction()]+variablecat semantics:[variablecat()]

@@ -9,3 +9,5 @@ % aconstr:noadj nodes tb-noadj-bad semantics:[tb-unification-noadj() thing-bad()] +tb-unification-na-bad semantics:[tb-unification-na(bad)]+tb-unification-anchor-bad semantics:[tb-unification-anchor(bad)]

@@ -0,0 +1,150 @@+% trivial example of the kid to parent rule+k2p-trivial() initial +Mother [cat:a]![] { Anchor anchor [ cat:x ]![] }++% note: the alphabetical names below are meaningless - they are just+% chinese numbers (which is why i follow them by the equivalent +% arabic numerals)+%+% why do i name them this way? dunno... figured they'd be easier+% to see or something+++yi1() initial+YiMo [cat:a tb:?T]![tb:?B] {+ YiLe anchor [ cat:x ]![]+ YiRi type:subst  [ cat:b ]![]+}++er2() initial+Mother [cat:b]![] {+  Left anchor [ cat:x ]![]+  Right type:subst [ cat:t1 ]![]+}++term(?C ?X) initial+T anchor [cat:?C foo:?X]![]++aux-bad() auxiliary+Mother [cat:t1 tb:foo]![] {+  Left anchor [ cat:x ]![]+  Foot type:foot [cat:t1]![tb:bar]+}++aux-good() auxiliary+MothA [cat:t1 tb:ping]![] {+  LeftA anchor [cat:x]![]+  FootA type:foot [cat:t1]![tb:ping]+}++aux-nepas () auxiliary+Mother [cat:t1 tb:ping]![] {+  Left anchor [cat:x]![]+  Foot type:foot [cat:t1]![tb:ping]+  Right type:lex "pas"+}++++% meant to receive substitution from san3 +% if it works - ?A should be set to bar+wu5 () initial+WuM [cat:a foo:?A]![] {+  WuL anchor [cat:x]![]+  WuR type:subst [cat:t1 foo:?A]![]+}++% a simple tb unification which ought to work+liu6-good () initial +Mother [cat:a]![cat:a] { Anchor anchor [cat:x]![] }++% unification + subst should work, but this should NOT propagate up! +% this should NOT propagate up+wu5-bad () initial+Mother [cat:a foo:?A]![] {+  Anch anchor [cat:x]![]+  Left  type:subst [cat:t1 foo:?A]![]+  Right type:subst [cat:t2 foo:?A]![]+}++++% top-bot unification failure (simple)+liu6-bad1 () initial +Mother [cat:a]![cat:b] { Anch anchor [cat:x]![] }++% top-bot unification (complex)+liu6-bad2 () initial +Mother [cat:a tb:?X]![tb:?Y] {+  Anch anchor [cat:x]![]+  Left  type:subst [cat:t1 foo:?X]![]+  Right type:subst [cat:t2 foo:?Y]![]+}++% this should still be passed+iaf-killer-good (?X) initial+Mother [cat:a]![cat:a] {+  Anch anchor [cat:x]![]+  Left  type:subst [cat:t1 idx:?X]![]+  Right type:subst [cat:t2 idx:?X]![]+}++aconstr-with-anchor () initial+Anch anchor aconstr:noadj [cat:a]![]++% this succeeds iff thing is good or left unset+tb-unification-noadj () initial+M [cat:a]![] {+  X type:subst [cat:x thing:?X]![thing:good]+  Y anchor [cat:b]![]+}++tb-unification-bot() initial+M anchor [cat:a]![]++tb-unification-adj() auxiliary+M [cat:a]![idx:b] {+ X anchor [cat:b]![]+ Y type:foot [cat:a]![]+}++tb-unification-na(?T) initial+X aconstr:noadj [cat:X thing:good]![thing:?T] {+ Y anchor [cat:X]![]+}++tb-unification-anchor(?T) initial+X [cat:X thing:good]![thing:?T] {+ Y anchor [cat:X thing:good]![thing:?T]+}+++no-thing () initial+X anchor [cat:x]![]++thing-good () initial+X anchor [cat:x thing:good]![]++thing-bad () initial+X anchor [cat:x thing:bad]![]++lemanchor () initial+M [cat:x]![] {+  X anchor [cat:x]![]+  Y type:subst [cat:y lemanchor:hello]![]+  Z type:subst [cat:y lemanchor:world]![]+}++preterminal () initial+M [cat:x]![] {+ X anchor [cat:x]![]+ Y [cat:y]![lemanchor:hello]+}+++disjunction(?X ?Y ?Z) initial+X anchor [cat:?X;?Y;?Z x:?X y:?Y z:?Z foo:?X/x|y|z;?Z;a]![]++variablecat(?X ?Y ?Z) initial+X anchor [cat:_ x:?X y:?Y z:?Z foo:?X/x|y|z;?Z;a]![]+

@@ -1,132 +0,0 @@-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%-%	DETERMINERS-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%--Det(?I) auxiliary-n1[cat:n idx:?I det:plus qu:minus]![cat:n idx:?I det:plus qu:minus]-{-  n2 anchor [cat:det]![]-  n4 type:foot [cat:n idx:?I det:?_ qu:?_]![cat:n idx:?I det:minus qu:?_]-}--%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%-%	NOUNS-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%--% Common Nouns: voyage-nC(?I) initial-n1 anchor [cat:n idx:?I det:?_ qu:?_]![cat:n idx:?I det:minus qu:minus ]--% Proper Nouns: Jean-nP(?I) initial-n1 anchor [cat:n idx:?I det:plus qu:minus]![cat:n idx:?I det:plus qu:minus ]--%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%-%	ADJECTIVES-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%--adj_post(?I)  auxiliary-n0[cat:n idx:?I det:?_ qu:?_]![cat:n idx:?I det:minus qu:minus ]-{-  n1 type:foot [cat:n idx:?I det:minus qu:minus]!-    [cat:n idx:?I det:minus qu:?_ ]-    n2 anchor [cat:a]![]-}--adj_pre(?I)  auxiliary-n0[cat:n idx:?I det:?_ qu:?_]![cat:n idx:?I det:minus qu:minus ]-{-  n1 anchor [cat:a]![]-  n3 type:foot [cat:n idx:?I det:minus qu:minus]!-    [cat:n idx:?I det:minus qu:?_ ]-}--%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%-%	TRANSITIVE VERBS-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%--%infinitive- % chasser une souris vinfn1-vArity2:vinfn1(?E ?X ?Y)  initial-n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p idx:?E mode:?_ sujidx:?_]-{- n2 anchor [cat:v idx:?E]![]- n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:?_ qu:?_ ]-}--% declarative-  % le chat chasse la souris-vArity2:n0vn1(?E ?X ?Y) initial-n1[cat:p]![]-{-  n2 type:subst [cat:n idx:?X det:plus qu:minus]!-    [cat:n idx:?X det:?_ qu:?_ ]-    n3 anchor [cat:v idx:?E]![]-  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y-    det:?_ qu:?_ ]-}--% question sujet	-  % qui chasse une souris ?-vArity2:qu0vn1(?E ?X ?Y) initial-n1[cat:p]![]-{-  n2 type:subst [cat:c idx:?X det:plus qu:minus]!-    [cat:c idx:?X det:?_ qu:?_ ]-    n3 anchor [cat:v idx:?E]![]-  n5 type:subst [cat:n idx:?Y det:plus qu:minus]!-    [cat:n idx:?Y det:?_ qu:?_ ]-}--% question objet-  % que chasse le chat ?-vArity2:qu1vn0(?E ?X ?Y) initial-n1[cat:p]![]-{-  n2 type:subst [cat:n idx:?Y det:plus qu:plus]!-    [cat:n idx:?Y det:?_ qu:plus ]-    n3[cat:p idx:?E]![]-    {-      % FIXME: EYK - the bottom node was cat:p, i set it to cat:v-      % to validate-      n4 anchor [cat:v idx:?E]![cat:v idx:?E]-      n6 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X-        det:?_ qu:?_ ]-    }-}--% relative sujet-% le chat qui chasse la souris--vArity2:rel0vn1(?E ?X ?Y) auxiliary-n0[cat:n idx:?X det:plus qu:?_]![cat:n idx:?X det:?_ qu:?_ ]-{-  n1 type:foot [cat:n idx:?X det:?_ qu:?_]![cat:n idx:?X det:?_ qu:?_ ]-    n2[cat:p]![]-    {-      n3 type:subst [cat:c idx:?X det:plus qu:minus]!-        [cat:c idx:?X det:?_ qu:?_ ]-        n4 anchor [cat:v idx:?E]![]-      n6 type:subst [cat:n idx:?Y det:plus qu:minus]!-        [cat:n idx:?Y det:?_ qu:?_ ]-    }}--% relative objet-% la souris que chasse le chat--vArity2:rel1vn0(?E ?X ?Y)  auxiliary-n0[cat:n idx:?Y det:plus qu:?_]![cat:n idx:?Y det:?_ qu:?_ ]-{-  n1 type:foot [cat:n idx:?Y det:?_ qu:?_]!-    [cat:n idx:?Y det:?_ qu:?_ ]-    n2[cat:p]![]-    {-      n3 type:subst [cat:c idx:?X det:plus qu:minus]!-        [cat:c idx:?X det:?_ qu:?_ ]-        n4 anchor [cat:v idx:?E]![]-      n6 type:subst [cat:n idx:?X det:plus qu:minus]!-        [cat:n idx:?X det:?_ qu:?_ ]         -    }-}--% vi: set cinoptions=0,p0:

@@ -0,0 +1,132 @@+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%+%	DETERMINERS+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%++Det(?I) auxiliary+n1[cat:n idx:?I det:plus qu:minus]![cat:n idx:?I det:plus qu:minus]+{+  n2 anchor [cat:det]![]+  n4 type:foot [cat:n idx:?I det:?_ qu:?_]![cat:n idx:?I det:minus qu:?_]+}++%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%+%	NOUNS+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%++% Common Nouns: voyage+nC(?I) initial+n1 anchor [cat:n idx:?I det:?_ qu:?_]![cat:n idx:?I det:minus qu:minus ]++% Proper Nouns: Jean+nP(?I) initial+n1 anchor [cat:n idx:?I det:plus qu:minus]![cat:n idx:?I det:plus qu:minus ]++%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%+%	ADJECTIVES+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%++adj_post(?I)  auxiliary+n0[cat:n idx:?I det:?_ qu:?_]![cat:n idx:?I det:minus qu:minus ]+{+  n1 type:foot [cat:n idx:?I det:minus qu:minus]!+    [cat:n idx:?I det:minus qu:?_ ]+    n2 anchor [cat:a]![]+}++adj_pre(?I)  auxiliary+n0[cat:n idx:?I det:?_ qu:?_]![cat:n idx:?I det:minus qu:minus ]+{+  n1 anchor [cat:a]![]+  n3 type:foot [cat:n idx:?I det:minus qu:minus]!+    [cat:n idx:?I det:minus qu:?_ ]+}++%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%+%	TRANSITIVE VERBS+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%++%infinitive+ % chasser une souris vinfn1+vArity2:vinfn1(?E ?X ?Y)  initial+n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p idx:?E mode:?_ sujidx:?_]+{+ n2 anchor [cat:v idx:?E]![]+ n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:?_ qu:?_ ]+}++% declarative+  % le chat chasse la souris+vArity2:n0vn1(?E ?X ?Y) initial+n1[cat:p]![]+{+  n2 type:subst [cat:n idx:?X det:plus qu:minus]!+    [cat:n idx:?X det:?_ qu:?_ ]+    n3 anchor [cat:v idx:?E]![]+  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y+    det:?_ qu:?_ ]+}++% question sujet	+  % qui chasse une souris ?+vArity2:qu0vn1(?E ?X ?Y) initial+n1[cat:p]![]+{+  n2 type:subst [cat:c idx:?X det:plus qu:minus]!+    [cat:c idx:?X det:?_ qu:?_ ]+    n3 anchor [cat:v idx:?E]![]+  n5 type:subst [cat:n idx:?Y det:plus qu:minus]!+    [cat:n idx:?Y det:?_ qu:?_ ]+}++% question objet+  % que chasse le chat ?+vArity2:qu1vn0(?E ?X ?Y) initial+n1[cat:p]![]+{+  n2 type:subst [cat:n idx:?Y det:plus qu:plus]!+    [cat:n idx:?Y det:?_ qu:plus ]+    n3[cat:p idx:?E]![]+    {+      % FIXME: EYK - the bottom node was cat:p, i set it to cat:v+      % to validate+      n4 anchor [cat:v idx:?E]![cat:v idx:?E]+      n6 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X+        det:?_ qu:?_ ]+    }+}++% relative sujet+% le chat qui chasse la souris++vArity2:rel0vn1(?E ?X ?Y) auxiliary+n0[cat:n idx:?X det:plus qu:?_]![cat:n idx:?X det:?_ qu:?_ ]+{+  n1 type:foot [cat:n idx:?X det:?_ qu:?_]![cat:n idx:?X det:?_ qu:?_ ]+    n2[cat:p]![]+    {+      n3 type:subst [cat:c idx:?X det:plus qu:minus]!+        [cat:c idx:?X det:?_ qu:?_ ]+        n4 anchor [cat:v idx:?E]![]+      n6 type:subst [cat:n idx:?Y det:plus qu:minus]!+        [cat:n idx:?Y det:?_ qu:?_ ]+    }}++% relative objet+% la souris que chasse le chat++vArity2:rel1vn0(?E ?X ?Y)  auxiliary+n0[cat:n idx:?Y det:plus qu:?_]![cat:n idx:?Y det:?_ qu:?_ ]+{+  n1 type:foot [cat:n idx:?Y det:?_ qu:?_]!+    [cat:n idx:?Y det:?_ qu:?_ ]+    n2[cat:p]![]+    {+      n3 type:subst [cat:c idx:?X det:plus qu:minus]!+        [cat:c idx:?X det:?_ qu:?_ ]+        n4 anchor [cat:v idx:?E]![]+      n6 type:subst [cat:n idx:?X det:plus qu:minus]!+        [cat:n idx:?X det:?_ qu:?_ ]         +    }+}++% vi: set cinoptions=0,p0:

@@ -1,439 +0,0 @@-%% 02 april 2004-%% 1. Jean promet un cadeau a Marie-%% 2. Jean promet a Marie de partir-%% 3. Qui promet un cadeau a Marie?-%% 4. Que promet Jean a Marie?-%% 5. A qui Jean promet-il un cadeau?-%% 6. la personne qui promet un cadeau a Marie-%% 7. le cadeau que Jean promet a Marie-%% 8. la personne a qui Jean promet un cadeau-%% 9. promettre un cadeau a Marie-%% 10. promettant un cadeau a Marie-%% 11. donner un livre a marie--Det(?I) auxiliary-n1[cat:n idx:?I det:_ qu:minus]![cat:n idx:?I det:_ qu:minus]-{-  n2 anchor [cat:det]![]-  n4 type:foot [cat:n idx:?I det:_ qu:_ ]![cat:n idx:?I det:minus qu:_ ]-}--  % Common Nouns: voyage-nC(?I) initial-  n1 anchor [cat:n idx:?I det:_ qu:?W ]![cat:n idx:?I det:minus qu:minus ]-% Proper Nouns: Jean--nP(?I) initial-  n1 anchor [cat:n idx:?I det:plus qu:minus]![cat:n idx:?I det:plus qu:minus ]--  %1 declarative	gn promet gn sp_a-n0vn1sp2(?E ?X ?Y ?Z) initial-  n1[cat:p]![]-{-  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]-    n3 anchor [cat:v idx:?E]![]-  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]-    n6[cat:sp idx:?Z det:plus]![det:_ ]-    { n8[cat:prep]![]-      {-        n9 type:lex "a"-      }-      n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z-        det:_ qu:_] -    }-}--  %2 infinitive	V GN SP_a-vinfn1sp2(?E ?X ?Y ?Z)  initial-  n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p idx:?E mode:_ sujidx:_]-{-  n2 anchor [cat:v idx:?E]![]-  n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]-    n5[cat:sp idx:?Z det:plus]![det:_ ]-    { n6[cat:prep]![]-      {-        n7 type:lex "a"-      }-      n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z-        det:_ qu:_] -    }-}--  %3 question sujet	qui V GN GP_a ?-qu0vn1sp2(?E ?X ?Y ?Z) initial-  n1[cat:p]![]-{-  n2 type:subst [cat:c idx:?X det:plus qu:minus]![idx:?X det:_ qu:_ ]-    n3 anchor [cat:v idx:?E]![]-  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]-    n6[cat:sp idx:?Z det:plus]![det:_ ]-    { n8[cat:prep]![]-      {-        n9 type:lex "a"-      }-      n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z det:_ qu:_ ] -    }-}--  %4 question objet-qu1vn0sp2(?E ?X ?Y ?Z) initial-  n1[cat:p]![]-{-  n2 type:subst [cat:n idx:?Y det:plus qu:plus]![cat:n idx:?Y det:_ qu:plus ]-    n3[cat:p idx:?E]![]-    {-      n4 anchor [cat:v idx:?E]![idx:?E]-      n6 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X-        det:_ qu:_ ]-        n7[cat:sp idx:?Z det:plus]![det:_ ]-        { n8[cat:prep]![]-          {-            n9 type:lex "a"-          }-          n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z	det:_ qu:_] -        }-    }-}--  %5 question objet indirect-qu2n0vn1(?E ?X ?Y ?Z) initial-  n1[cat:p]![]-{-  n2[cat:sp idx:?Z det:plus]![det:_ ]-  { n3[cat:prep]![]-    {-      n4 type:lex "a"-    }-    n5 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z det:_ qu:plus] -  }-  n6[cat:p idx:?E]![]-  {-    n7 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]-      n8 anchor [cat:v idx:?E]![idx:?E]-    n10 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]-  }-}--%6 relative sujet	qui V gn sp_a -rel0vn1sp2(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?X det:plus qu:_]![cat:n idx:?X det:_ qu:_ ]-{-  n1 type:foot [cat:n idx:?X det:_ qu:_]![cat:n idx:?X det:_ qu:_ ]-    n2[cat:p]![]-    {-      n3 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]-        n4 anchor [cat:v idx:?E]![]-      n6 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]-        n7[cat:sp idx:?Z ]![]-        { n8[cat:prep]![]-          {-            n9 type:lex "a"-          }-          n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:_-            det:_ qu:_] -        }-      n9[cat:p]![]-      {n10[cat:prep]![]-        {-          n11 type:lex "de"-        } -        n12 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z -          mode:_ sujidx:_]-      }}}--%7 relative objet-rel1vn0sp2(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?Y det:plus qu:_]![cat:n idx:?Y det:_ qu:_ ]-{-  n1 type:foot [cat:n idx:?Y det:_ qu:_]![cat:n idx:?Y det:_ qu:_ ]-    n2[cat:p]![]-    {-      n3 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]-        n4 anchor [cat:v idx:?E]![]-      n6 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]-        n7[cat:sp idx:?Z ]![]-        { n8[cat:prep]![]-          {-            n9 type:lex "a"-          }-          n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:_-            det:_ qu:_] -        }-    }-}--%8 relative objet indirect-rel2n0vn1(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?Z det:plus qu:_]![cat:n idx:?Z det:_ qu:_ ]-{-  n1 type:foot [cat:n idx:?Z det:_ qu:_]![cat:n idx:?Z det:_ qu:_]-    n2[cat:p]![]-    {-      n3[cat:sp idx:?Z det:plus]![det:_ ]-      { n4[cat:prep]![]-        {-          n5 type:lex "a"-        }-        n6 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z det:_ qu:plus] -      }-      n7[cat:p idx:?E]![]-      {-        n8 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]-          n9 anchor [cat:v idx:?E]![cat:p idx:?E]-        n11 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]-      }-    }-}--  %9 declarative	GN V GN_a Pinf_de-n0vsp2pinf1(?E ?X ?Y ?Z) initial-  n1[cat:p]![]-{-  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]-    n3 anchor [cat:v idx:?E]![]-  n5[cat:sp idx:?Y det:plus]![det:_ ]-  { n6[cat:prep]![]-    {-      n7 type:lex "a"-    }-    n8 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_] -  }-  n9[cat:p]![]-  {n10[cat:prep]![]-    {-      n11 type:lex "de"-    } -    n12 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![idx:?Z mode:_ sujidx:_]-  }-}--  %10 infinitive	V SP_a Inf_de-vinfsp2pinf1(?E ?X ?Y ?Z) initial-  n1[cat:p idx:?E mode:inf sujidx:?X]![idx:?Y mode:_ sujidx:_]-{-  n2 anchor [cat:v idx:?E]![]-  n4[cat:sp idx:?Z det:plus]![det:_ ]-  { n5[cat:prep]![]-    {-      n6 type:lex "a"-    }-    n7 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z-      det:_ qu:_] -  }-  n8[cat:p]![]-  {n9[cat:prep]![]-    {-      n10 type:lex "de"-    } -    n11 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z -      mode:_ sujidx:_]-  }-}--  %11 question sujet	qui V GP_a Pinf_de ?-qu0vsp2pinf1(?E ?X ?Y ?Z) initial -  n1[cat:p]![]-{-  n2 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]-    n3 anchor [cat:v idx:?E]![]-  n5[cat:sp idx:?Z det:plus]![det:_ ]-  { n6[cat:prep]![]-    {-      n7 type:lex "a"-    }-    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z det:_ qu:_ ] -  }-  n9[cat:p]![]-  {n10[cat:prep]![]-    {-      n11 type:lex "de"-    } -    n12 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z -      mode:_ sujidx:_]-  }}--  %12 question objet indirect-qu2n0vpinf1(?E ?X ?Y ?Z) initial-  n1[cat:p]![]-{-  n2[cat:sp idx:?Z det:plus]![det:_ ]-  { n3[cat:prep]![]-    {-      n4 type:lex "a"-    }-    n5 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z det:_ qu:plus] -  }-  n6[cat:p idx:?E]![]-  {-    n7 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]-      n8 anchor [cat:v idx:?E]![cat:p idx:?E]-  }-  n10[cat:prep]![]-  {-    n11 type:lex "de"-  } -  n12 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z -    mode:_ sujidx:_]-}--%13 relative sujet	qui V sp_a pinf_de-rel0vsp2pinf1(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?X det:plus qu:_]![cat:n idx:?X det:_ qu:_ ]-{-  n1 type:foot [cat:n idx:?X det:_ qu:_]![cat:n idx:?X det:_ qu:_ ]-    n2[cat:p]![]-    {-      n3 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]-        n4 anchor [cat:v idx:?E]![]-      n6[cat:sp idx:?Z ]![]-      { n7[cat:prep]![]-        {-          n8 type:lex "a"-        }-        n9 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:_-          det:_ qu:_] -      }-      n10[cat:p]![]-      {n11[cat:prep]![]-        {-          n12 type:lex "de"-        } -        n13 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z -          mode:_ sujidx:_]-      }}}--%14 relative objet indirect	a qui GN v Pinf_de-rel2n0vpinf1(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?Z det:plus qu:_]![cat:n idx:?Z det:_ qu:_ ]-{-  n1 type:foot [cat:n idx:?Z det:_ qu:_]![cat:n idx:?Z det:_ qu:_]-    n2[cat:p]![]-    {-      n3[cat:sp idx:?Z det:plus]![det:_ ]-      { n4[cat:prep]![]-        {-          n5 type:lex "a"-        }-        n6 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z det:_ qu:plus] -      }-      n7[cat:p idx:?E]![]-      {-        n8 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]-          n9 anchor [cat:v idx:?E]![cat:p idx:?E]-      }-      n9[cat:p]![]-      {n10[cat:prep]![]-        {-          n11 type:lex "de"-        } -        n12 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y-          mode:_ sujidx:_]-      }-    }}---  %15 declarative gn0 persuade gn2 pinf_de1	n0vn2pinf1 -n0vn2pinf1(?E ?X ?Y ?Z) initial-  n1[cat:p]![]-{-  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]-    n3 anchor [cat:v idx:?E]![]-  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_]-    n6[cat:p]![]-    {n7[cat:prep]![]-      {-        n8 type:lex "de"-      } -      n9 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![idx:?Z mode:_ sujidx:_]-    }-}--  %15 infinitive persuader gn  pinf_de	vinfn2pinf1-vinfn2pinf1(?E ?X ?Y ?Z) initial-  n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p idx:?Y mode:_ sujidx:_]-{-  n2 anchor [cat:v idx:?E]![]-  n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y-    det:_ qu:_] -    n5[cat:p]![]-    {n6[cat:prep]![]-      {-        n7 type:lex "de"-      } -      n8 type:subst [cat:p idx:?Z mode:inf sujidx:?Y]![cat:p idx:?Z -        mode:_ sujidx:_]-    }-}--  %16 qu-sujet qui persuade gn  pinf_de ?	qu0vn2pinf1-qu0vn2pinf1(?E ?X ?Y ?Z) initial-  n1[cat:p]![]-{-  n2 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]-    n3 anchor [cat:v idx:?E]![]-  n5 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z det:_ qu:_ ] -    n6[cat:p]![]-    {n7[cat:prep]![]-      {-        n8 type:lex "de"-      } -      n9 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z -        mode:_ sujidx:_]-    }}--  %17 qu-obj	 qui gn persuade-il pinf_de ?	qu2n0vpinf1-qu2n0vpinf1(?E ?X ?Y ?Z) initial-  n1[cat:p]![]-{-  n2 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z det:_ qu:plus] -    n3[cat:p idx:?E]![]-    {-      n4 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]-        n5 anchor [cat:v idx:?E]![cat:p idx:?E]-    }-  n7[cat:prep]![]-  {-    n8 type:lex "de"-  } -  n9 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y -    mode:_ sujidx:_]-}--%18 rel-sjt	 n qui persuade gn  pinf_de	rel0vn2pinf1-rel0vn2pinf1(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?X det:plus qu:_]![cat:n idx:?X det:_ qu:_ ]-{-  n1 type:foot [cat:n idx:?X det:_ qu:_]![cat:n idx:?X det:_ qu:_ ]-    n2[cat:p]![]-    {-      n3 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]-        n4 anchor [cat:v idx:?E]![]-      n6 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:_-        det:_ qu:_] -        n7[cat:p]![]-        {n8[cat:prep]![]-          {-            n9 type:lex "de"-          } -          n10 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y -            mode:_ sujidx:_]-        }}}--%19 rel-obj	  n dont gn persuade gn		rel1n0vn2-rel1n0vn2(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?Y det:plus qu:_]![cat:n idx:?Y det:_ qu:_ ]-{-  n1 type:foot [cat:n idx:?Y det:_ qu:_]![cat:n idx:?Y det:_ qu:_]-    n2[cat:p]![]-    {-      n3 type:subst [cat:c idx:?Y det:plus qu:_]![cat:c idx:?Y det:_ qu:_] -        n4[cat:p idx:?E]![]-        {-          n5 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]-            n6 anchor [cat:v idx:?E]![cat:p idx:?E]-        }-      n8 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y -        det:_ qu:minus ]-    }-}-

@@ -0,0 +1,439 @@+%% 02 april 2004+%% 1. Jean promet un cadeau a Marie+%% 2. Jean promet a Marie de partir+%% 3. Qui promet un cadeau a Marie?+%% 4. Que promet Jean a Marie?+%% 5. A qui Jean promet-il un cadeau?+%% 6. la personne qui promet un cadeau a Marie+%% 7. le cadeau que Jean promet a Marie+%% 8. la personne a qui Jean promet un cadeau+%% 9. promettre un cadeau a Marie+%% 10. promettant un cadeau a Marie+%% 11. donner un livre a marie++Det(?I) auxiliary+n1[cat:n idx:?I det:_ qu:minus]![cat:n idx:?I det:_ qu:minus]+{+  n2 anchor [cat:det]![]+  n4 type:foot [cat:n idx:?I det:_ qu:_ ]![cat:n idx:?I det:minus qu:_ ]+}++  % Common Nouns: voyage+nC(?I) initial+  n1 anchor [cat:n idx:?I det:_ qu:?W ]![cat:n idx:?I det:minus qu:minus ]+% Proper Nouns: Jean++nP(?I) initial+  n1 anchor [cat:n idx:?I det:plus qu:minus]![cat:n idx:?I det:plus qu:minus ]++  %1 declarative	gn promet gn sp_a+n0vn1sp2(?E ?X ?Y ?Z) initial+  n1[cat:p]![]+{+  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]+    n3 anchor [cat:v idx:?E]![]+  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]+    n6[cat:sp idx:?Z det:plus]![det:_ ]+    { n8[cat:prep]![]+      {+        n9 type:lex "a"+      }+      n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z+        det:_ qu:_] +    }+}++  %2 infinitive	V GN SP_a+vinfn1sp2(?E ?X ?Y ?Z)  initial+  n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p idx:?E mode:_ sujidx:_]+{+  n2 anchor [cat:v idx:?E]![]+  n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]+    n5[cat:sp idx:?Z det:plus]![det:_ ]+    { n6[cat:prep]![]+      {+        n7 type:lex "a"+      }+      n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z+        det:_ qu:_] +    }+}++  %3 question sujet	qui V GN GP_a ?+qu0vn1sp2(?E ?X ?Y ?Z) initial+  n1[cat:p]![]+{+  n2 type:subst [cat:c idx:?X det:plus qu:minus]![idx:?X det:_ qu:_ ]+    n3 anchor [cat:v idx:?E]![]+  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]+    n6[cat:sp idx:?Z det:plus]![det:_ ]+    { n8[cat:prep]![]+      {+        n9 type:lex "a"+      }+      n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z det:_ qu:_ ] +    }+}++  %4 question objet+qu1vn0sp2(?E ?X ?Y ?Z) initial+  n1[cat:p]![]+{+  n2 type:subst [cat:n idx:?Y det:plus qu:plus]![cat:n idx:?Y det:_ qu:plus ]+    n3[cat:p idx:?E]![]+    {+      n4 anchor [cat:v idx:?E]![idx:?E]+      n6 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X+        det:_ qu:_ ]+        n7[cat:sp idx:?Z det:plus]![det:_ ]+        { n8[cat:prep]![]+          {+            n9 type:lex "a"+          }+          n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z	det:_ qu:_] +        }+    }+}++  %5 question objet indirect+qu2n0vn1(?E ?X ?Y ?Z) initial+  n1[cat:p]![]+{+  n2[cat:sp idx:?Z det:plus]![det:_ ]+  { n3[cat:prep]![]+    {+      n4 type:lex "a"+    }+    n5 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z det:_ qu:plus] +  }+  n6[cat:p idx:?E]![]+  {+    n7 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]+      n8 anchor [cat:v idx:?E]![idx:?E]+    n10 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]+  }+}++%6 relative sujet	qui V gn sp_a +rel0vn1sp2(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?X det:plus qu:_]![cat:n idx:?X det:_ qu:_ ]+{+  n1 type:foot [cat:n idx:?X det:_ qu:_]![cat:n idx:?X det:_ qu:_ ]+    n2[cat:p]![]+    {+      n3 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]+        n4 anchor [cat:v idx:?E]![]+      n6 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]+        n7[cat:sp idx:?Z ]![]+        { n8[cat:prep]![]+          {+            n9 type:lex "a"+          }+          n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:_+            det:_ qu:_] +        }+      n9[cat:p]![]+      {n10[cat:prep]![]+        {+          n11 type:lex "de"+        } +        n12 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z +          mode:_ sujidx:_]+      }}}++%7 relative objet+rel1vn0sp2(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?Y det:plus qu:_]![cat:n idx:?Y det:_ qu:_ ]+{+  n1 type:foot [cat:n idx:?Y det:_ qu:_]![cat:n idx:?Y det:_ qu:_ ]+    n2[cat:p]![]+    {+      n3 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]+        n4 anchor [cat:v idx:?E]![]+      n6 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]+        n7[cat:sp idx:?Z ]![]+        { n8[cat:prep]![]+          {+            n9 type:lex "a"+          }+          n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:_+            det:_ qu:_] +        }+    }+}++%8 relative objet indirect+rel2n0vn1(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?Z det:plus qu:_]![cat:n idx:?Z det:_ qu:_ ]+{+  n1 type:foot [cat:n idx:?Z det:_ qu:_]![cat:n idx:?Z det:_ qu:_]+    n2[cat:p]![]+    {+      n3[cat:sp idx:?Z det:plus]![det:_ ]+      { n4[cat:prep]![]+        {+          n5 type:lex "a"+        }+        n6 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z det:_ qu:plus] +      }+      n7[cat:p idx:?E]![]+      {+        n8 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]+          n9 anchor [cat:v idx:?E]![cat:p idx:?E]+        n11 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_ ]+      }+    }+}++  %9 declarative	GN V GN_a Pinf_de+n0vsp2pinf1(?E ?X ?Y ?Z) initial+  n1[cat:p]![]+{+  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]+    n3 anchor [cat:v idx:?E]![]+  n5[cat:sp idx:?Y det:plus]![det:_ ]+  { n6[cat:prep]![]+    {+      n7 type:lex "a"+    }+    n8 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_] +  }+  n9[cat:p]![]+  {n10[cat:prep]![]+    {+      n11 type:lex "de"+    } +    n12 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![idx:?Z mode:_ sujidx:_]+  }+}++  %10 infinitive	V SP_a Inf_de+vinfsp2pinf1(?E ?X ?Y ?Z) initial+  n1[cat:p idx:?E mode:inf sujidx:?X]![idx:?Y mode:_ sujidx:_]+{+  n2 anchor [cat:v idx:?E]![]+  n4[cat:sp idx:?Z det:plus]![det:_ ]+  { n5[cat:prep]![]+    {+      n6 type:lex "a"+    }+    n7 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z+      det:_ qu:_] +  }+  n8[cat:p]![]+  {n9[cat:prep]![]+    {+      n10 type:lex "de"+    } +    n11 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z +      mode:_ sujidx:_]+  }+}++  %11 question sujet	qui V GP_a Pinf_de ?+qu0vsp2pinf1(?E ?X ?Y ?Z) initial +  n1[cat:p]![]+{+  n2 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]+    n3 anchor [cat:v idx:?E]![]+  n5[cat:sp idx:?Z det:plus]![det:_ ]+  { n6[cat:prep]![]+    {+      n7 type:lex "a"+    }+    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z det:_ qu:_ ] +  }+  n9[cat:p]![]+  {n10[cat:prep]![]+    {+      n11 type:lex "de"+    } +    n12 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z +      mode:_ sujidx:_]+  }}++  %12 question objet indirect+qu2n0vpinf1(?E ?X ?Y ?Z) initial+  n1[cat:p]![]+{+  n2[cat:sp idx:?Z det:plus]![det:_ ]+  { n3[cat:prep]![]+    {+      n4 type:lex "a"+    }+    n5 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z det:_ qu:plus] +  }+  n6[cat:p idx:?E]![]+  {+    n7 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]+      n8 anchor [cat:v idx:?E]![cat:p idx:?E]+  }+  n10[cat:prep]![]+  {+    n11 type:lex "de"+  } +  n12 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z +    mode:_ sujidx:_]+}++%13 relative sujet	qui V sp_a pinf_de+rel0vsp2pinf1(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?X det:plus qu:_]![cat:n idx:?X det:_ qu:_ ]+{+  n1 type:foot [cat:n idx:?X det:_ qu:_]![cat:n idx:?X det:_ qu:_ ]+    n2[cat:p]![]+    {+      n3 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]+        n4 anchor [cat:v idx:?E]![]+      n6[cat:sp idx:?Z ]![]+      { n7[cat:prep]![]+        {+          n8 type:lex "a"+        }+        n9 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:_+          det:_ qu:_] +      }+      n10[cat:p]![]+      {n11[cat:prep]![]+        {+          n12 type:lex "de"+        } +        n13 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z +          mode:_ sujidx:_]+      }}}++%14 relative objet indirect	a qui GN v Pinf_de+rel2n0vpinf1(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?Z det:plus qu:_]![cat:n idx:?Z det:_ qu:_ ]+{+  n1 type:foot [cat:n idx:?Z det:_ qu:_]![cat:n idx:?Z det:_ qu:_]+    n2[cat:p]![]+    {+      n3[cat:sp idx:?Z det:plus]![det:_ ]+      { n4[cat:prep]![]+        {+          n5 type:lex "a"+        }+        n6 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z det:_ qu:plus] +      }+      n7[cat:p idx:?E]![]+      {+        n8 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]+          n9 anchor [cat:v idx:?E]![cat:p idx:?E]+      }+      n9[cat:p]![]+      {n10[cat:prep]![]+        {+          n11 type:lex "de"+        } +        n12 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y+          mode:_ sujidx:_]+      }+    }}+++  %15 declarative gn0 persuade gn2 pinf_de1	n0vn2pinf1 +n0vn2pinf1(?E ?X ?Y ?Z) initial+  n1[cat:p]![]+{+  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]+    n3 anchor [cat:v idx:?E]![]+  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y det:_ qu:_]+    n6[cat:p]![]+    {n7[cat:prep]![]+      {+        n8 type:lex "de"+      } +      n9 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![idx:?Z mode:_ sujidx:_]+    }+}++  %15 infinitive persuader gn  pinf_de	vinfn2pinf1+vinfn2pinf1(?E ?X ?Y ?Z) initial+  n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p idx:?Y mode:_ sujidx:_]+{+  n2 anchor [cat:v idx:?E]![]+  n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y+    det:_ qu:_] +    n5[cat:p]![]+    {n6[cat:prep]![]+      {+        n7 type:lex "de"+      } +      n8 type:subst [cat:p idx:?Z mode:inf sujidx:?Y]![cat:p idx:?Z +        mode:_ sujidx:_]+    }+}++  %16 qu-sujet qui persuade gn  pinf_de ?	qu0vn2pinf1+qu0vn2pinf1(?E ?X ?Y ?Z) initial+  n1[cat:p]![]+{+  n2 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]+    n3 anchor [cat:v idx:?E]![]+  n5 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z det:_ qu:_ ] +    n6[cat:p]![]+    {n7[cat:prep]![]+      {+        n8 type:lex "de"+      } +      n9 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z +        mode:_ sujidx:_]+    }}++  %17 qu-obj	 qui gn persuade-il pinf_de ?	qu2n0vpinf1+qu2n0vpinf1(?E ?X ?Y ?Z) initial+  n1[cat:p]![]+{+  n2 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z det:_ qu:plus] +    n3[cat:p idx:?E]![]+    {+      n4 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]+        n5 anchor [cat:v idx:?E]![cat:p idx:?E]+    }+  n7[cat:prep]![]+  {+    n8 type:lex "de"+  } +  n9 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y +    mode:_ sujidx:_]+}++%18 rel-sjt	 n qui persuade gn  pinf_de	rel0vn2pinf1+rel0vn2pinf1(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?X det:plus qu:_]![cat:n idx:?X det:_ qu:_ ]+{+  n1 type:foot [cat:n idx:?X det:_ qu:_]![cat:n idx:?X det:_ qu:_ ]+    n2[cat:p]![]+    {+      n3 type:subst [cat:c idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:_ ]+        n4 anchor [cat:v idx:?E]![]+      n6 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:_+        det:_ qu:_] +        n7[cat:p]![]+        {n8[cat:prep]![]+          {+            n9 type:lex "de"+          } +          n10 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y +            mode:_ sujidx:_]+        }}}++%19 rel-obj	  n dont gn persuade gn		rel1n0vn2+rel1n0vn2(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?Y det:plus qu:_]![cat:n idx:?Y det:_ qu:_ ]+{+  n1 type:foot [cat:n idx:?Y det:_ qu:_]![cat:n idx:?Y det:_ qu:_]+    n2[cat:p]![]+    {+      n3 type:subst [cat:c idx:?Y det:plus qu:_]![cat:c idx:?Y det:_ qu:_] +        n4[cat:p idx:?E]![]+        {+          n5 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X det:_ qu:minus ]+            n6 anchor [cat:v idx:?E]![cat:p idx:?E]+        }+      n8 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y +        det:_ qu:minus ]+    }+}+

@@ -48,9 +48,13 @@ Vinny Pn(?Entity ! agr:sg3) semantics:[name(_ ?Entity vincent)] +% Unicode Émilie Pn(?Entity ! agr:sg3) semantics:[name(_ ?Entity émilie)] +% string literals+"Joe \"the Boxer\" Stephens" Pn(?Entity ! agr:sg3)+semantics:[name(_ ?Entity joe_stephens)]  %% Verbs %% intransitive verbs

@@ -1,92 +0,0 @@-%% -%% Tree Templates-%%-%%-%% INITIAL TREES-%%   s trees-%%     (IntrV, TrV, TrVPP)-%%   np trees-%%     (Dp, Pn)-%%   n trees-%%     (Cn)-%%-%% AUXILIARY TREES-%%   n trees-%%     (Adj)-%%   vp trees-%%     (Adv)---%% INITIAL TREES--vArity1:IntrV(?Event ?Agent ! agr:?A) initial-	n1[cat:s idx:?Event]![]-	{	-	 n2 type:subst [cat:np idx:?Agent]![]-	 n3 [cat:vp idx:?Event]![]-	  {-	   n4 anchor [cat:v idx:?Event]![]-	  }-	}--vArity2:TrV(?Event ?Agent ?Experiencer ! agr:?A) initial-	n1[cat:s idx:?Event]![]-	{-	 n2 type:subst [cat:np idx:?Agent ]![]-	 n3[cat:vp idx:?Event]![]-	  {-	   n4 anchor [cat:v idx:?Event]![]-	   n6 type:subst [cat:np idx:?Experiencer ]![]-	  }-	}--vArity3:TrVPP(?Event ?Agent ?Theme ?Loc ! agr:?A) initial-	n1[cat:s idx:?Event]![]-	{-	  n2 type:subst [cat:np idx:?Agent ]![]-	  n3[cat:vp idx:?Event]![]-	  {-	    n4 anchor [cat:v idx:?Event]![]-	    n6 type:subst [cat:np idx:?Theme ]![]-	    n7 aconstr:noadj [cat:pp]![]-            {-	      n8[cat:p]![]-	      {-	        n9 type:lex "from"-	      }-	      n10 type:subst [cat:np idx:?Loc ]![]-	    }-	  }-	}--Dp(?Entity ! agr:?A) initial-	n1[cat:np idx:?Entity]![]-	{-	  n2 anchor [cat:det]![]-	  n4 type:subst [cat:n idx:?Entity ]![]-	}--Pn(?Entity ! agr:?A) initial-	n1[cat:np idx:?Entity]![]-	{-	 n2 anchor [cat:pn idx:?Entity]![]-	}--Cn(?Entity ! agr:?A) initial-	n1 anchor [cat:n idx:?Entity]![]--%% ?AUXILIARY ?TREES--Adj(?Entity) auxiliary-	n1[cat:n idx:?Entity]![]-	{-	  n2 anchor [cat:adj]![]-	  n4 type:foot [cat:n idx:?Entity ]![]-	}--Adv(?Event) auxiliary-	n1[cat:vp idx:?Event]![]-	{-	  n2 type:foot [cat:vp idx:?Event]![]-	  n3 anchor [cat:adv]![]-	}	

@@ -18,6 +18,12 @@              name(s2 ex émilie)] [Vincent loves Émilie] +v_loves_j+semantics: [ name(s1 a vincent)+             love(e a ex)+             name(s2 ex joe_stephens)]+[Vincent loves Joe "the Boxer" Stephens]+ v_loves_m_f semantics : [name(s1 a vincent)              love(e a ex)

@@ -0,0 +1,92 @@+%% +%% Tree Templates+%%+%%+%% INITIAL TREES+%%   s trees+%%     (IntrV, TrV, TrVPP)+%%   np trees+%%     (Dp, Pn)+%%   n trees+%%     (Cn)+%%+%% AUXILIARY TREES+%%   n trees+%%     (Adj)+%%   vp trees+%%     (Adv)+++%% INITIAL TREES++vArity1:IntrV(?Event ?Agent ! agr:?A) initial+	n1[cat:s idx:?Event]![]+	{	+	 n2 type:subst [cat:np idx:?Agent]![]+	 n3 [cat:vp idx:?Event]![]+	  {+	   n4 anchor [cat:v idx:?Event]![]+	  }+	}++vArity2:TrV(?Event ?Agent ?Experiencer ! agr:?A) initial+	n1[cat:s idx:?Event]![]+	{+	 n2 type:subst [cat:np idx:?Agent ]![]+	 n3[cat:vp idx:?Event]![]+	  {+	   n4 anchor [cat:v idx:?Event]![]+	   n6 type:subst [cat:np idx:?Experiencer ]![]+	  }+	}++vArity3:TrVPP(?Event ?Agent ?Theme ?Loc ! agr:?A) initial+	n1[cat:s idx:?Event]![]+	{+	  n2 type:subst [cat:np idx:?Agent ]![]+	  n3[cat:vp idx:?Event]![]+	  {+	    n4 anchor [cat:v idx:?Event]![]+	    n6 type:subst [cat:np idx:?Theme ]![]+	    n7 aconstr:noadj [cat:pp]![]+            {+	      n8[cat:p]![]+	      {+	        n9 type:lex "from"+	      }+	      n10 type:subst [cat:np idx:?Loc ]![]+	    }+	  }+	}++Dp(?Entity ! agr:?A) initial+	n1[cat:np idx:?Entity]![]+	{+	  n2 anchor [cat:det]![]+	  n4 type:subst [cat:n idx:?Entity ]![]+	}++Pn(?Entity ! agr:?A) initial+	n1[cat:np idx:?Entity]![]+	{+	 n2 anchor [cat:pn idx:?Entity]![]+	}++Cn(?Entity ! agr:?A) initial+	n1 anchor [cat:n idx:?Entity]![]++%% ?AUXILIARY ?TREES++Adj(?Entity) auxiliary+	n1[cat:n idx:?Entity]![]+	{+	  n2 anchor [cat:adj]![]+	  n4 type:foot [cat:n idx:?Entity ]![]+	}++Adv(?Event) auxiliary+	n1[cat:vp idx:?Event]![]+	{+	  n2 type:foot [cat:vp idx:?Event]![]+	  n3 anchor [cat:adv]![]+	}	

@@ -1,363 +0,0 @@-%%-%% GENI Macro-%% This macro was automatically generated by-%% a tagml->macro script, tagml2genimacro.xsl-%% 2005-%% contact: kow@loria.fr lai@loria.fr--n() initial-n1 anchor--{-}--pro() initial-n1 anchor--{-}--pro_substantif() initial-n1 [cat:nom]![cat:nom]-{-n1.1 anchor-}--det_n() auxiliary-n1 [cat:nom]![cat:nom]-{-n1.1 anchor-n1.2 type:foot [cat:nom]![cat:nom]-}--n_la() auxiliary-n1 [cat:nom]![cat:nom]-{-n1.1 type:foot [cat:nom]![cat:nom]-n1.2 anchor-}--det_substantif() initial-n1 [cat:nom]![cat:nom]-{-n1.1 anchor-}--det_det() auxiliary-n1 [cat:det]![cat:det]-{-n1.1 type:foot [cat:det]![cat:det]-n1.2 anchor-}--np() initial-n1 anchor--{-}--np_substantif() initial-n1 [cat:nom]![cat:nom]-{-n1.1 anchor-}--n_np() auxiliary-n1 [cat:nom]![cat:nom]-{-n1.1 type:foot [cat:nom]![cat:nom]-n1.2 anchor-}--n_con_n() initial-n1 [cat:nom]![cat:nom]-{-n1.1 type:subst [cat:nom]![cat:nom]-n1.2 anchor-n1.3 type:subst [cat:nom]![cat:nom]-}--enum_n() auxiliary-n1 [cat:nom]![cat:nom]-{-n1.1 type:foot [cat:nom]![cat:nom]-n1.2 anchor-}--n_pred() initial-n1 [cat:nom]![cat:nom]-{-n1.1 type:subst [cat:nom]![cat:nom]-n1.2 [cat:gp]![cat:gp]-{-n1.2.1 anchor-n1.2.2 type:subst [cat:nom]![cat:nom]-}-}--compl_n() initial-n1 [cat:nom]![cat:nom]-{-n1.1 type:subst [cat:nom]![cat:nom]-n1.2 [cat:cdn]![cat:cdn]-{-n1.2.1 anchor-n1.2.2 type:subst [cat:nom]![cat:nom]-}-}--adj() initial-n1 anchor--{-}--adj_substantif() initial-n1 [cat:nom]![cat:nom]-{-n1.1 anchor-}--adv_adj() auxiliary-n1 [cat:adj]![cat:adj]-{-n1.1 anchor-n1.2 type:foot [cat:adj]![cat:adj]-}--adj_n() auxiliary-n1 [cat:nom]![cat:nom]-{-n1.1 anchor-n1.2 type:foot [cat:nom]![cat:nom]-}--n_adj() auxiliary-n1 [cat:nom]![cat:nom]-{-n1.1 type:foot [cat:nom]![cat:nom]-n1.2 anchor-}--n_gp() auxiliary-n1 [cat:nom]![cat:nom]-{-n1.1 type:foot [cat:nom]![cat:nom]-n1.2 [cat:gp]![cat:gp]-{-n1.2.1 anchor-n1.2.2 type:subst [cat:nom]![cat:nom]-}-}--s_gp() auxiliary-n1 [cat:sen]![cat:sen]-{-n1.1 type:foot [cat:sen]![cat:sen]-n1.2 [cat:gp]![cat:gp]-{-n1.2.1 anchor-n1.2.2 type:subst [cat:nom]![cat:nom]-}-}--gp_s() auxiliary-n1 [cat:sen]![cat:sen]-{-n1.1 type:foot [cat:sen]![cat:sen]-n1.2 [cat:gp]![cat:gp]-{-n1.2.1 anchor-n1.2.2 type:subst [cat:nom]![cat:nom]-}-}--gp() initial-n1 [cat:gp]![cat:gp]-{-n1.1 anchor-n1.2 type:subst [cat:nom]![cat:nom]-}--gpro() initial-n1 [cat:nom]![cat:nom]-{-n1.1 anchor-n1.2 type:subst [cat:nom]![cat:nom]-}--gpro_n_right() auxiliary-n1 [cat:nom]![cat:nom]-{-n1.1 type:foot [cat:nom]![cat:nom]-n1.2 anchor-n1.3 type:subst [cat:nom]![cat:nom]-}--n0_v() initial-n1 [cat:sen]![cat:sen]-{-n1.1 type:subst [cat:nom]![cat:nom]-n1.2 anchor-}--n0_v_n1() initial-n1 [cat:sen]![cat:sen]-{-n1.1 type:subst [cat:nom]![cat:nom]-n1.2 anchor-n1.3 type:subst [cat:nom]![cat:nom]-}--pro_v() initial-n1 [cat:sen]![cat:sen]-{-n1.1 type:subst [cat:pro]![cat:pro]-n1.2 anchor-}--pro_v_n1() initial-n1 [cat:sen]![cat:sen]-{-n1.1 type:subst [cat:pro]![cat:pro]-n1.2 anchor-n1.3 type:subst [cat:nom]![cat:nom]-}--v_inf() initial-n1 [cat:sen]![cat:sen]-{-n1.1 anchor-}--v_n1_inf() initial-n1 [cat:sen]![cat:sen]-{-n1.1 anchor-n1.2 type:subst [cat:nom]![cat:nom]-}--n0_v_s() initial-n1 [cat:sen]![cat:sen]-{-n1.1 type:subst [cat:nom]![cat:nom]-n1.2 anchor-n1.3 type:subst [cat:sen]![cat:sen]-}--pro_v_s() initial-n1 [cat:sen]![cat:sen]-{-n1.1 type:subst [cat:pro]![cat:pro]-n1.2 anchor-n1.3 type:subst [cat:sen]![cat:sen]-}--mod_v() auxiliary-n1 [cat:ver]![cat:ver]-{-n1.1 anchor-n1.2 type:foot [cat:ver]![cat:ver]-}--il_faut_n0() initial-n1 [cat:sen]![cat:sen]-{-n1.1 type:lex "il"-n1.2 anchor-n1.3 type:subst [cat:nom]![cat:nom]-}--mod_pro_left() auxiliary-n1 [cat:ver]![cat:ver]-{-n1.1 anchor-n1.2 type:foot [cat:ver]![cat:ver]-}--qu_est_ce_que() initial-n1 [cat:sen]![cat:sen]-{-n1.1 anchor-n1.2 type:subst [cat:sen]![cat:sen]-}--v_pro() initial-n1 [cat:sen]![cat:sen]-{-n1.1 anchor-n1.2 type:subst [cat:pro]![cat:pro]-}--v_pro_n() initial-n1 [cat:sen]![cat:sen]-{-n1.1 anchor-n1.2 type:subst [cat:pro]![cat:pro]-n1.3 type:subst [cat:nom]![cat:nom]-}--v_pro_s() initial-n1 [cat:sen]![cat:sen]-{-n1.1 anchor-n1.2 type:subst [cat:pro]![cat:pro]-n1.3 type:subst [cat:sen]![cat:sen]-}--mod_adv_left() auxiliary-n1 [cat:ver]![cat:ver]-{-n1.1 anchor-n1.2 type:foot [cat:ver]![cat:ver]-}--mod_adv_right() auxiliary-n1 [cat:ver]![cat:ver]-{-n1.1 type:foot [cat:ver]![cat:ver]-n1.2 anchor-}--mod_adv() auxiliary-n1 [cat:adv]![cat:adv]-{-n1.1 anchor-n1.2 type:foot [cat:adv]![cat:adv]-}--mod_adv_n_left() auxiliary-n1 [cat:nom]![cat:nom]-{-n1.1 type:foot [cat:nom]![cat:nom]-n1.2 anchor-}--mod_adv_n_right() auxiliary-n1 [cat:nom]![cat:nom]-{-n1.1 anchor-n1.2 type:foot [cat:nom]![cat:nom]-}--adv() initial-n1 anchor--{-}--entre_np_et_np() initial-n1 [cat:gp]![cat:gp]-{-n1.1 anchor-n1.2 type:subst [cat:nompropre]![cat:nompropre]-n1.3 type:lex "et"-n1.4 type:subst [cat:nompropre]![cat:nompropre]-}--int() initial-n1 anchor--{-}-

@@ -0,0 +1,363 @@+%%+%% GENI Macro+%% This macro was automatically generated by+%% a tagml->macro script, tagml2genimacro.xsl+%% 2005+%% contact: kow@loria.fr lai@loria.fr++n() initial+n1 anchor++{+}++pro() initial+n1 anchor++{+}++pro_substantif() initial+n1 [cat:nom]![cat:nom]+{+n1.1 anchor+}++det_n() auxiliary+n1 [cat:nom]![cat:nom]+{+n1.1 anchor+n1.2 type:foot [cat:nom]![cat:nom]+}++n_la() auxiliary+n1 [cat:nom]![cat:nom]+{+n1.1 type:foot [cat:nom]![cat:nom]+n1.2 anchor+}++det_substantif() initial+n1 [cat:nom]![cat:nom]+{+n1.1 anchor+}++det_det() auxiliary+n1 [cat:det]![cat:det]+{+n1.1 type:foot [cat:det]![cat:det]+n1.2 anchor+}++np() initial+n1 anchor++{+}++np_substantif() initial+n1 [cat:nom]![cat:nom]+{+n1.1 anchor+}++n_np() auxiliary+n1 [cat:nom]![cat:nom]+{+n1.1 type:foot [cat:nom]![cat:nom]+n1.2 anchor+}++n_con_n() initial+n1 [cat:nom]![cat:nom]+{+n1.1 type:subst [cat:nom]![cat:nom]+n1.2 anchor+n1.3 type:subst [cat:nom]![cat:nom]+}++enum_n() auxiliary+n1 [cat:nom]![cat:nom]+{+n1.1 type:foot [cat:nom]![cat:nom]+n1.2 anchor+}++n_pred() initial+n1 [cat:nom]![cat:nom]+{+n1.1 type:subst [cat:nom]![cat:nom]+n1.2 [cat:gp]![cat:gp]+{+n1.2.1 anchor+n1.2.2 type:subst [cat:nom]![cat:nom]+}+}++compl_n() initial+n1 [cat:nom]![cat:nom]+{+n1.1 type:subst [cat:nom]![cat:nom]+n1.2 [cat:cdn]![cat:cdn]+{+n1.2.1 anchor+n1.2.2 type:subst [cat:nom]![cat:nom]+}+}++adj() initial+n1 anchor++{+}++adj_substantif() initial+n1 [cat:nom]![cat:nom]+{+n1.1 anchor+}++adv_adj() auxiliary+n1 [cat:adj]![cat:adj]+{+n1.1 anchor+n1.2 type:foot [cat:adj]![cat:adj]+}++adj_n() auxiliary+n1 [cat:nom]![cat:nom]+{+n1.1 anchor+n1.2 type:foot [cat:nom]![cat:nom]+}++n_adj() auxiliary+n1 [cat:nom]![cat:nom]+{+n1.1 type:foot [cat:nom]![cat:nom]+n1.2 anchor+}++n_gp() auxiliary+n1 [cat:nom]![cat:nom]+{+n1.1 type:foot [cat:nom]![cat:nom]+n1.2 [cat:gp]![cat:gp]+{+n1.2.1 anchor+n1.2.2 type:subst [cat:nom]![cat:nom]+}+}++s_gp() auxiliary+n1 [cat:sen]![cat:sen]+{+n1.1 type:foot [cat:sen]![cat:sen]+n1.2 [cat:gp]![cat:gp]+{+n1.2.1 anchor+n1.2.2 type:subst [cat:nom]![cat:nom]+}+}++gp_s() auxiliary+n1 [cat:sen]![cat:sen]+{+n1.1 type:foot [cat:sen]![cat:sen]+n1.2 [cat:gp]![cat:gp]+{+n1.2.1 anchor+n1.2.2 type:subst [cat:nom]![cat:nom]+}+}++gp() initial+n1 [cat:gp]![cat:gp]+{+n1.1 anchor+n1.2 type:subst [cat:nom]![cat:nom]+}++gpro() initial+n1 [cat:nom]![cat:nom]+{+n1.1 anchor+n1.2 type:subst [cat:nom]![cat:nom]+}++gpro_n_right() auxiliary+n1 [cat:nom]![cat:nom]+{+n1.1 type:foot [cat:nom]![cat:nom]+n1.2 anchor+n1.3 type:subst [cat:nom]![cat:nom]+}++n0_v() initial+n1 [cat:sen]![cat:sen]+{+n1.1 type:subst [cat:nom]![cat:nom]+n1.2 anchor+}++n0_v_n1() initial+n1 [cat:sen]![cat:sen]+{+n1.1 type:subst [cat:nom]![cat:nom]+n1.2 anchor+n1.3 type:subst [cat:nom]![cat:nom]+}++pro_v() initial+n1 [cat:sen]![cat:sen]+{+n1.1 type:subst [cat:pro]![cat:pro]+n1.2 anchor+}++pro_v_n1() initial+n1 [cat:sen]![cat:sen]+{+n1.1 type:subst [cat:pro]![cat:pro]+n1.2 anchor+n1.3 type:subst [cat:nom]![cat:nom]+}++v_inf() initial+n1 [cat:sen]![cat:sen]+{+n1.1 anchor+}++v_n1_inf() initial+n1 [cat:sen]![cat:sen]+{+n1.1 anchor+n1.2 type:subst [cat:nom]![cat:nom]+}++n0_v_s() initial+n1 [cat:sen]![cat:sen]+{+n1.1 type:subst [cat:nom]![cat:nom]+n1.2 anchor+n1.3 type:subst [cat:sen]![cat:sen]+}++pro_v_s() initial+n1 [cat:sen]![cat:sen]+{+n1.1 type:subst [cat:pro]![cat:pro]+n1.2 anchor+n1.3 type:subst [cat:sen]![cat:sen]+}++mod_v() auxiliary+n1 [cat:ver]![cat:ver]+{+n1.1 anchor+n1.2 type:foot [cat:ver]![cat:ver]+}++il_faut_n0() initial+n1 [cat:sen]![cat:sen]+{+n1.1 type:lex "il"+n1.2 anchor+n1.3 type:subst [cat:nom]![cat:nom]+}++mod_pro_left() auxiliary+n1 [cat:ver]![cat:ver]+{+n1.1 anchor+n1.2 type:foot [cat:ver]![cat:ver]+}++qu_est_ce_que() initial+n1 [cat:sen]![cat:sen]+{+n1.1 anchor+n1.2 type:subst [cat:sen]![cat:sen]+}++v_pro() initial+n1 [cat:sen]![cat:sen]+{+n1.1 anchor+n1.2 type:subst [cat:pro]![cat:pro]+}++v_pro_n() initial+n1 [cat:sen]![cat:sen]+{+n1.1 anchor+n1.2 type:subst [cat:pro]![cat:pro]+n1.3 type:subst [cat:nom]![cat:nom]+}++v_pro_s() initial+n1 [cat:sen]![cat:sen]+{+n1.1 anchor+n1.2 type:subst [cat:pro]![cat:pro]+n1.3 type:subst [cat:sen]![cat:sen]+}++mod_adv_left() auxiliary+n1 [cat:ver]![cat:ver]+{+n1.1 anchor+n1.2 type:foot [cat:ver]![cat:ver]+}++mod_adv_right() auxiliary+n1 [cat:ver]![cat:ver]+{+n1.1 type:foot [cat:ver]![cat:ver]+n1.2 anchor+}++mod_adv() auxiliary+n1 [cat:adv]![cat:adv]+{+n1.1 anchor+n1.2 type:foot [cat:adv]![cat:adv]+}++mod_adv_n_left() auxiliary+n1 [cat:nom]![cat:nom]+{+n1.1 type:foot [cat:nom]![cat:nom]+n1.2 anchor+}++mod_adv_n_right() auxiliary+n1 [cat:nom]![cat:nom]+{+n1.1 anchor+n1.2 type:foot [cat:nom]![cat:nom]+}++adv() initial+n1 anchor++{+}++entre_np_et_np() initial+n1 [cat:gp]![cat:gp]+{+n1.1 anchor+n1.2 type:subst [cat:nompropre]![cat:nompropre]+n1.3 type:lex "et"+n1.4 type:subst [cat:nompropre]![cat:nompropre]+}++int() initial+n1 anchor++{+}+

@@ -1,450 +0,0 @@-%% 02 april 2004-%% 1. Jean promet un cadeau a Marie-%% 2. Jean promet a Marie de partir-%% 6. la personne qui promet un cadeau a Marie-%% 7. le cadeau que Jean promet a Marie-%% 8. la personne a qui Jean promet un cadeau-%% 9. promettre un cadeau a Marie-%% 10. promettant un cadeau a Marie-%% 11. donner un livre a marie--% FIXME: eric the non-linguist set all cat:p nodes with unspecified mode to FIXME--Det(?I) auxiliary-n1[cat:n idx:?I det:plus qu:minus]![cat:n idx:?I qu:minus]-{-  n2 type:anchor [cat:det]![]-  n4 type:foot [cat:n idx:?I]![cat:n idx:?I det:minus]-}--clitic:cl(?H ?X ! idx:?X ) initial-n1 type:anchor [cat:cl idx:?X]![cat:cl idx:?X] {}--pronoun:pn(?H ?X ! idx:?X num:?Num gen:?Gen pers:?Pers) initial-n1 [cat:n idx:?X num:?Num gen:?Gen pers:?Pers]![cat:n idx:?X]-{-  n2 type:anchor [cat:pn num:?Num gen:?Gen pers:?Pers]![] -}--% Common Nouns: voyage-nC(?I!num:?Num gen:?Gen) initial-n1 [cat:n num:?Num gen:?Gen idx:?I]![cat:n num:?Num gen:?Gen idx:?I det:minus qu:minus]-{-  n2 type:anchor [cat:n num:?Num gen:?Gen]![]-}--% Proper Nouns: Jean-nP(?I!pers:?Pers num:?Num gen:?Gen) initial-n1 type:anchor [cat:n num:?Num pers:?Pers gen:?Gen idx:?I det:plus qu:minus]![cat:n idx:?I det:plus qu:minus] {}----% jean se aimer -- note: we rely on top/bottom unification-% for this to work-vArity2:n0v(?E ?X ?Y) initial -n1[cat:p mode:FIXME]![]-{-  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?Y]-  n5 [cat:se idx:?X det:plus qu:minus]![cat:se idx:?Y]-  n3 type:anchor [cat:v idx:?E]![]-}--vArity2:n0cl1v(?E ?X ?Y) initial-n1[cat:p mode:FIXME]![]-{-  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X]-  n5 type:subst [cat:cl idx:?Y det:plus qu:minus]![cat:cl idx:?Y]-  n3 type:anchor [cat:v idx:?E]![]-}--vArity2:n0vn1(?E ?X ?Y) initial-n1[cat:p mode:FIXME]![]-{-  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X]-  n3 type:anchor [cat:v idx:?E]![]-  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]-} --% aimer N (jean espere [aimer Marie])-vArity2:vinfn1(?E ?X ?Y) initial -n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p]-{-  n2 type:anchor [cat:v idx:?E]![]-  n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]-}--% le aimer (jean espere [le aimer])-cl0vinf(?E ?X ?Y) initial -n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p]-{-  n5 type:subst [cat:cl idx:?Y det:plus qu:minus]![cat:cl idx:?Y]-  n2 type:anchor [cat:v idx:?E]![]-}--% infinitive: le donner un livre (je promets de le donner un livre)-vArity3:cl2vinfn0(?E ?X ?Y ?Z) initial -n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p]-{-  n5 type:subst [cat:cl idx:?Z det:plus qu:minus]![cat:cl idx:?Z]-  n2 type:anchor [cat:v idx:?E]![]-  n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]-}  --  %1 declarative	gn promet gn sp_a-vArity3:n0vn1sp2(?E ?X ?Y ?Z) initial-n1[cat:p mode:FIXME]![]-{-  n2 type:subst [cat:n pers:?Pers num:?Num idx:?X det:plus qu:minus]![cat:n idx:?X]-  n3[cat:v idx:?E]![]-  {-    n4 type:anchor [cat:v pers:?Pers num:?Num]![] -  }-  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]-  n6[cat:sp idx:?Z det:plus]![]-  { n8[cat:prep]![]-    {-      n9 type:lex "a"-    }-    n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] -  }-}---  %2 infinitive	?V GN SP_a-vArity3:vinfn1sp2(?E ?X ?Y ?Z) initial-n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p]-{-  n2 type:anchor [cat:v idx:?E]![]-  n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]-  n5[cat:sp idx:?Z det:plus]![]-  { n6[cat:prep]![]-    {-      n7 type:lex "a"-    }-    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] -  }-}--vArity3:n0vn1inf2(?E ?X ?Y ?Z) initial-n1[cat:p mode:FIXME]![]-{-  n2 type:subst [cat:n idx:?X pers:?Pers num:?Num det:plus qu:minus]![cat:n idx:?X]-  n3[cat:v idx:?E]![]-  {-    n4 type:anchor [cat:v pers:?Pers num:?Num]![] -  }-  n5[cat:sp idx:?Z det:plus]![]-  { n6[cat:p]![]-    {-      n7 type:lex "a"-    }-    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z-    ] -  }-  n9 type:subst [cat:p idx:?Y mode:inf]![cat:p idx:?Y] -}--%8 relative objet indirect-vArity3:rel2n0vn1(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?Z det:plus]![cat:n idx:?Z]-{-  n1 type:foot [cat:n idx:?Z]![cat:n idx:?Z]-  n2[cat:p]![]-  {-    n3[cat:sp idx:?Z det:plus]![]-    { n4[cat:prep]![]-      {-        n5 type:lex "a"-      }-      n6 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z  qu:plus] -    }-    n7[cat:p idx:?E]![]-    {-      n8 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X  qu:minus]-      n9 type:anchor [cat:v idx:?E]![cat:p idx:?E]-      n11 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]-    }-  }-}--  %9 declarative	GN V GN_a Pinf_de-vArity3control:n0vsp2pinf1(?E ?X ?Y ?Z) initial-n1[cat:p mode:FIXME]![]-{-  n2 type:subst [cat:n pers:?Pers num:?Num idx:?X det:plus qu:minus]![cat:n idx:?X]-  n3[cat:v idx:?E]![]-  {-    n4 type:anchor [cat:v pers:?Pers num:?Num]![]-  }-  n5[cat:sp idx:?Z det:plus]![]-  { n6[cat:prep]![]-    {-      n7 type:lex "a"-    }-    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] -  }-  n9[cat:p]![]-  {n10[cat:prep]![]-    {-      n11 type:lex "de"-    } -    n12 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y]-  }-}--  %10 infinitive	V SP_a Inf_de-vArity3control:vinfsp2pinf1(?E ?X ?Y ?Z)  initial-n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p] -{-  n2 type:anchor [cat:v idx:?E]![]-  n4[cat:sp idx:?Y det:plus]![]-  { n5[cat:prep]![]-    {-      n6 type:lex "a"-    }-    n7 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y-    ] -  }-  n8[cat:p]![]-  {n9[cat:prep]![]-    {-      n10 type:lex "de"-    } -    n11 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y]--  }-}--  % kowey: promettre a marie de faire...-vArity3control:vinfn2pinf1(?E ?X ?Y ?Z) initial-n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p] -{-  n2 type:anchor [cat:v idx:?E]![]--  n5[cat:sp idx:?Z det:plus]![]-  { n6[cat:prep]![]-    {-      n7 type:lex "a"-    }-    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] -  }--  n10[cat:p]![]-  {n11[cat:prep]![]-    {-      n12 type:lex "de"-    } -    n13 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y]-  }-}--  %13 relative sujet	qui V sp_a pinf_de-vArity3control:rel0vsp2pinf1(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?X det:plus]![cat:n idx:?X]-{-  n1 type:foot [cat:n idx:?X]![cat:n idx:?X]-  n2[cat:p]![]-  {-    n3 type:subst [cat:cl idx:?X det:plus qu:minus]![cat:cl idx:?X]-    n4 type:anchor [cat:v idx:?E]![]-    n6[cat:sp idx:?Y]![]-    { n7[cat:prep]![]-      {-        n8 type:lex "a"-      }-      n9 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n -      ] -    }-    n10[cat:p]![]-    {n11[cat:prep]![]-      {-        n12 type:lex "de"-      } -      n13 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y]-    }}}---%14 relative objet indirect	a qui GN v Pinf_de-vArity3control:rel2n0vpinf1(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?Y det:plus]![cat:n idx:?Y]-{-  n1 type:foot [cat:n idx:?Y]![cat:n idx:?Y]-  n2[cat:p]![]-  {-    n3[cat:sp idx:?Y det:plus]![]-    { n4[cat:prep]![]-      {-        n5 type:lex "a"-      }-      n6 type:subst [cat:n idx:?Y det:plus qu:plus]![cat:n idx:?Y  qu:plus] -    }-    n7[cat:p idx:?E]![]-    {-      n8 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X  qu:minus]-      n9 type:anchor [cat:v idx:?E]![cat:p idx:?E]-    }-    n9[cat:p]![]-    {n10[cat:prep]![]-      {-        n11 type:lex "de"-      } -      n12 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z]-    }-  }}---vArity3control:rel0vn2pinf1(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?X det:plus]![cat:n idx:?X]-{-  n1 type:foot [cat:n idx:?X]![cat:n idx:?X]-  n2[cat:p]![]-  {-    n3 type:subst [cat:cl idx:?X det:plus qu:minus]![cat:n idx:?X]-    n4 type:anchor [cat:v idx:?E]![]-    n6 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n -    ] -    n7[cat:p]![]-    {n8[cat:prep]![]-      {-        n9 type:lex "de"-      } -      n10 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z]-    }}}--% relative sujet-vArity3control:rel0vn1sp2(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?X det:plus]![cat:n idx:?X]-{-  n1 type:foot [cat:n idx:?X]![cat:n idx:?X]-  n2[cat:p]![]-  {-    n3 type:subst [cat:cl idx:?X det:plus qu:minus]![cat:n idx:?X]-    n4 type:anchor [cat:v idx:?E]![]-    n6 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z]-    n7[cat:sp idx:?Y]![]-    { n8[cat:p]![]-      {-        n9 type:lex "a"-      }-      n10 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n] -    }-  }-}--% relative objet-vArity3control:rel1vn0sp2(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?X det:plus]![cat:n idx:?X]-{-  n1 type:foot [cat:n idx:?X]![cat:n idx:?X]-  n2[cat:p]![]-  {-    n3 type:subst [cat:cl idx:?X det:plus qu:minus]![cat:cl idx:?X]-    n4 type:anchor [cat:v idx:?E]![]-    n6 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z]-    n7[cat:sp idx:?Y]![]-    { n8[cat:p]![]-      {-        n9 type:lex "a"-      }-      n10 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n] -    }-  }-}--  % relative objet indirect-rel2vn0n1(?E ?X ?Y ?Z) auxiliary-n0[cat:n idx:?Y det:plus]![cat:n idx:?Y]-{-  n1 type:foot [cat:n idx:?Y]![cat:n idx:?Y]-  n2[cat:p]![]-  {-    n3[cat:sp idx:?Y det:plus]![]-    { n4[cat:p]![]-      {-        n5 type:lex "a"-      }-      n6 type:subst [cat:n idx:?Y det:plus qu:plus]![cat:n idx:?Y  qu:plus] -    }-    n7[cat:p idx:?E]![]-    {-      n8 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X  qu:minus]-      n9 type:anchor [cat:v idx:?E]![cat:p idx:?E]-      n11 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z]-    }-  }-}--  % kowey: for persuader instead of promettre-  % (sujidx is set differently)-vArity3controlObj:n0vsp2pinf1b(?E ?X ?Y ?Z) initial-n1[cat:p mode:FIXME]![]-{-  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X]-  n3 type:anchor [cat:v idx:?E]![]-  n5[cat:sp idx:?Z det:plus]![]-  { n6[cat:prep]![]-    {-      n7 type:lex "a"-    }-    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] -  }-  n9[cat:p]![]-  {n10[cat:prep]![]-    {-      n11 type:lex "de"-    } -    n12 type:subst [cat:p idx:?Y mode:inf sujidx:?Z]![cat:p idx:?Y]-  }-}--  %15 declarative gn0 persuade gn2 pinf_de1	n0vn2pinf1 -vArity3controlObj:n0vn2pinf1b(?E ?X ?Y ?Z) initial-n1[cat:p mode:FIXME]![]-{-  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X]-  n3 type:anchor [cat:v idx:?E]![]-  n5 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z]-  n6[cat:p]![]-  {n7[cat:prep]![]-    {-      n8 type:lex "de"-    } -    n9 type:subst [cat:p idx:?Y mode:inf sujidx:?Z]![cat:p idx:?Y] -  }-}--  %15 infinitive persuader gn  pinf_de	vinfn2pinf1-vArity3controlObj:vinfn2pinf1b(?E ?X ?Y ?Z) initial-n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p] -{-  n2 type:anchor [cat:v idx:?E]![]-  n4 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] -  n5[cat:p]![]-  {n6[cat:prep]![]-    {-      n7 type:lex "de"-    } -    n8 type:subst [cat:p idx:?Y mode:inf sujidx:?Z]![cat:p idx:?Y]-  }-}--  %18 rel-sjt	 n qui persuade gn  pinf_de	rel0vn2pinf1-vArity3controlObj:n0vn1sp2(?E ?X ?Y ?Z) initial-n1[cat:p mode:FIXME]![]-{-  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X]-  n3 type:anchor [cat:v idx:?E]![]-  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]-  n6[cat:sp idx:?Z det:plus]![]-  { n8[cat:p]![]-    {-      n9 type:lex "a"-    }-    n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z-    ] -  }-}--% vi: set cinoptions=0,p0:--

@@ -0,0 +1,450 @@+%% 02 april 2004+%% 1. Jean promet un cadeau a Marie+%% 2. Jean promet a Marie de partir+%% 6. la personne qui promet un cadeau a Marie+%% 7. le cadeau que Jean promet a Marie+%% 8. la personne a qui Jean promet un cadeau+%% 9. promettre un cadeau a Marie+%% 10. promettant un cadeau a Marie+%% 11. donner un livre a marie++% FIXME: eric the non-linguist set all cat:p nodes with unspecified mode to FIXME++Det(?I) auxiliary+n1[cat:n idx:?I det:plus qu:minus]![cat:n idx:?I qu:minus]+{+  n2 type:anchor [cat:det]![]+  n4 type:foot [cat:n idx:?I]![cat:n idx:?I det:minus]+}++clitic:cl(?H ?X ! idx:?X ) initial+n1 type:anchor [cat:cl idx:?X]![cat:cl idx:?X] {}++pronoun:pn(?H ?X ! idx:?X num:?Num gen:?Gen pers:?Pers) initial+n1 [cat:n idx:?X num:?Num gen:?Gen pers:?Pers]![cat:n idx:?X]+{+  n2 type:anchor [cat:pn num:?Num gen:?Gen pers:?Pers]![] +}++% Common Nouns: voyage+nC(?I!num:?Num gen:?Gen) initial+n1 [cat:n num:?Num gen:?Gen idx:?I]![cat:n num:?Num gen:?Gen idx:?I det:minus qu:minus]+{+  n2 type:anchor [cat:n num:?Num gen:?Gen]![]+}++% Proper Nouns: Jean+nP(?I!pers:?Pers num:?Num gen:?Gen) initial+n1 type:anchor [cat:n num:?Num pers:?Pers gen:?Gen idx:?I det:plus qu:minus]![cat:n idx:?I det:plus qu:minus] {}++++% jean se aimer -- note: we rely on top/bottom unification+% for this to work+vArity2:n0v(?E ?X ?Y) initial +n1[cat:p mode:FIXME]![]+{+  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?Y]+  n5 [cat:se idx:?X det:plus qu:minus]![cat:se idx:?Y]+  n3 type:anchor [cat:v idx:?E]![]+}++vArity2:n0cl1v(?E ?X ?Y) initial+n1[cat:p mode:FIXME]![]+{+  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X]+  n5 type:subst [cat:cl idx:?Y det:plus qu:minus]![cat:cl idx:?Y]+  n3 type:anchor [cat:v idx:?E]![]+}++vArity2:n0vn1(?E ?X ?Y) initial+n1[cat:p mode:FIXME]![]+{+  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X]+  n3 type:anchor [cat:v idx:?E]![]+  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]+} ++% aimer N (jean espere [aimer Marie])+vArity2:vinfn1(?E ?X ?Y) initial +n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p]+{+  n2 type:anchor [cat:v idx:?E]![]+  n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]+}++% le aimer (jean espere [le aimer])+cl0vinf(?E ?X ?Y) initial +n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p]+{+  n5 type:subst [cat:cl idx:?Y det:plus qu:minus]![cat:cl idx:?Y]+  n2 type:anchor [cat:v idx:?E]![]+}++% infinitive: le donner un livre (je promets de le donner un livre)+vArity3:cl2vinfn0(?E ?X ?Y ?Z) initial +n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p]+{+  n5 type:subst [cat:cl idx:?Z det:plus qu:minus]![cat:cl idx:?Z]+  n2 type:anchor [cat:v idx:?E]![]+  n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]+}  ++  %1 declarative	gn promet gn sp_a+vArity3:n0vn1sp2(?E ?X ?Y ?Z) initial+n1[cat:p mode:FIXME]![]+{+  n2 type:subst [cat:n pers:?Pers num:?Num idx:?X det:plus qu:minus]![cat:n idx:?X]+  n3[cat:v idx:?E]![]+  {+    n4 type:anchor [cat:v pers:?Pers num:?Num]![] +  }+  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]+  n6[cat:sp idx:?Z det:plus]![]+  { n8[cat:prep]![]+    {+      n9 type:lex "a"+    }+    n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] +  }+}+++  %2 infinitive	?V GN SP_a+vArity3:vinfn1sp2(?E ?X ?Y ?Z) initial+n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p]+{+  n2 type:anchor [cat:v idx:?E]![]+  n4 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]+  n5[cat:sp idx:?Z det:plus]![]+  { n6[cat:prep]![]+    {+      n7 type:lex "a"+    }+    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] +  }+}++vArity3:n0vn1inf2(?E ?X ?Y ?Z) initial+n1[cat:p mode:FIXME]![]+{+  n2 type:subst [cat:n idx:?X pers:?Pers num:?Num det:plus qu:minus]![cat:n idx:?X]+  n3[cat:v idx:?E]![]+  {+    n4 type:anchor [cat:v pers:?Pers num:?Num]![] +  }+  n5[cat:sp idx:?Z det:plus]![]+  { n6[cat:p]![]+    {+      n7 type:lex "a"+    }+    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z+    ] +  }+  n9 type:subst [cat:p idx:?Y mode:inf]![cat:p idx:?Y] +}++%8 relative objet indirect+vArity3:rel2n0vn1(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?Z det:plus]![cat:n idx:?Z]+{+  n1 type:foot [cat:n idx:?Z]![cat:n idx:?Z]+  n2[cat:p]![]+  {+    n3[cat:sp idx:?Z det:plus]![]+    { n4[cat:prep]![]+      {+        n5 type:lex "a"+      }+      n6 type:subst [cat:n idx:?Z det:plus qu:plus]![cat:n idx:?Z  qu:plus] +    }+    n7[cat:p idx:?E]![]+    {+      n8 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X  qu:minus]+      n9 type:anchor [cat:v idx:?E]![cat:p idx:?E]+      n11 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]+    }+  }+}++  %9 declarative	GN V GN_a Pinf_de+vArity3control:n0vsp2pinf1(?E ?X ?Y ?Z) initial+n1[cat:p mode:FIXME]![]+{+  n2 type:subst [cat:n pers:?Pers num:?Num idx:?X det:plus qu:minus]![cat:n idx:?X]+  n3[cat:v idx:?E]![]+  {+    n4 type:anchor [cat:v pers:?Pers num:?Num]![]+  }+  n5[cat:sp idx:?Z det:plus]![]+  { n6[cat:prep]![]+    {+      n7 type:lex "a"+    }+    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] +  }+  n9[cat:p]![]+  {n10[cat:prep]![]+    {+      n11 type:lex "de"+    } +    n12 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y]+  }+}++  %10 infinitive	V SP_a Inf_de+vArity3control:vinfsp2pinf1(?E ?X ?Y ?Z)  initial+n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p] +{+  n2 type:anchor [cat:v idx:?E]![]+  n4[cat:sp idx:?Y det:plus]![]+  { n5[cat:prep]![]+    {+      n6 type:lex "a"+    }+    n7 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y+    ] +  }+  n8[cat:p]![]+  {n9[cat:prep]![]+    {+      n10 type:lex "de"+    } +    n11 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y]++  }+}++  % kowey: promettre a marie de faire...+vArity3control:vinfn2pinf1(?E ?X ?Y ?Z) initial+n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p] +{+  n2 type:anchor [cat:v idx:?E]![]++  n5[cat:sp idx:?Z det:plus]![]+  { n6[cat:prep]![]+    {+      n7 type:lex "a"+    }+    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] +  }++  n10[cat:p]![]+  {n11[cat:prep]![]+    {+      n12 type:lex "de"+    } +    n13 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y]+  }+}++  %13 relative sujet	qui V sp_a pinf_de+vArity3control:rel0vsp2pinf1(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?X det:plus]![cat:n idx:?X]+{+  n1 type:foot [cat:n idx:?X]![cat:n idx:?X]+  n2[cat:p]![]+  {+    n3 type:subst [cat:cl idx:?X det:plus qu:minus]![cat:cl idx:?X]+    n4 type:anchor [cat:v idx:?E]![]+    n6[cat:sp idx:?Y]![]+    { n7[cat:prep]![]+      {+        n8 type:lex "a"+      }+      n9 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n +      ] +    }+    n10[cat:p]![]+    {n11[cat:prep]![]+      {+        n12 type:lex "de"+      } +      n13 type:subst [cat:p idx:?Y mode:inf sujidx:?X]![cat:p idx:?Y]+    }}}+++%14 relative objet indirect	a qui GN v Pinf_de+vArity3control:rel2n0vpinf1(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?Y det:plus]![cat:n idx:?Y]+{+  n1 type:foot [cat:n idx:?Y]![cat:n idx:?Y]+  n2[cat:p]![]+  {+    n3[cat:sp idx:?Y det:plus]![]+    { n4[cat:prep]![]+      {+        n5 type:lex "a"+      }+      n6 type:subst [cat:n idx:?Y det:plus qu:plus]![cat:n idx:?Y  qu:plus] +    }+    n7[cat:p idx:?E]![]+    {+      n8 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X  qu:minus]+      n9 type:anchor [cat:v idx:?E]![cat:p idx:?E]+    }+    n9[cat:p]![]+    {n10[cat:prep]![]+      {+        n11 type:lex "de"+      } +      n12 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z]+    }+  }}+++vArity3control:rel0vn2pinf1(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?X det:plus]![cat:n idx:?X]+{+  n1 type:foot [cat:n idx:?X]![cat:n idx:?X]+  n2[cat:p]![]+  {+    n3 type:subst [cat:cl idx:?X det:plus qu:minus]![cat:n idx:?X]+    n4 type:anchor [cat:v idx:?E]![]+    n6 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n +    ] +    n7[cat:p]![]+    {n8[cat:prep]![]+      {+        n9 type:lex "de"+      } +      n10 type:subst [cat:p idx:?Z mode:inf sujidx:?X]![cat:p idx:?Z]+    }}}++% relative sujet+vArity3control:rel0vn1sp2(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?X det:plus]![cat:n idx:?X]+{+  n1 type:foot [cat:n idx:?X]![cat:n idx:?X]+  n2[cat:p]![]+  {+    n3 type:subst [cat:cl idx:?X det:plus qu:minus]![cat:n idx:?X]+    n4 type:anchor [cat:v idx:?E]![]+    n6 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z]+    n7[cat:sp idx:?Y]![]+    { n8[cat:p]![]+      {+        n9 type:lex "a"+      }+      n10 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n] +    }+  }+}++% relative objet+vArity3control:rel1vn0sp2(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?X det:plus]![cat:n idx:?X]+{+  n1 type:foot [cat:n idx:?X]![cat:n idx:?X]+  n2[cat:p]![]+  {+    n3 type:subst [cat:cl idx:?X det:plus qu:minus]![cat:cl idx:?X]+    n4 type:anchor [cat:v idx:?E]![]+    n6 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z]+    n7[cat:sp idx:?Y]![]+    { n8[cat:p]![]+      {+        n9 type:lex "a"+      }+      n10 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n] +    }+  }+}++  % relative objet indirect+rel2vn0n1(?E ?X ?Y ?Z) auxiliary+n0[cat:n idx:?Y det:plus]![cat:n idx:?Y]+{+  n1 type:foot [cat:n idx:?Y]![cat:n idx:?Y]+  n2[cat:p]![]+  {+    n3[cat:sp idx:?Y det:plus]![]+    { n4[cat:p]![]+      {+        n5 type:lex "a"+      }+      n6 type:subst [cat:n idx:?Y det:plus qu:plus]![cat:n idx:?Y  qu:plus] +    }+    n7[cat:p idx:?E]![]+    {+      n8 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X  qu:minus]+      n9 type:anchor [cat:v idx:?E]![cat:p idx:?E]+      n11 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z]+    }+  }+}++  % kowey: for persuader instead of promettre+  % (sujidx is set differently)+vArity3controlObj:n0vsp2pinf1b(?E ?X ?Y ?Z) initial+n1[cat:p mode:FIXME]![]+{+  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X]+  n3 type:anchor [cat:v idx:?E]![]+  n5[cat:sp idx:?Z det:plus]![]+  { n6[cat:prep]![]+    {+      n7 type:lex "a"+    }+    n8 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] +  }+  n9[cat:p]![]+  {n10[cat:prep]![]+    {+      n11 type:lex "de"+    } +    n12 type:subst [cat:p idx:?Y mode:inf sujidx:?Z]![cat:p idx:?Y]+  }+}++  %15 declarative gn0 persuade gn2 pinf_de1	n0vn2pinf1 +vArity3controlObj:n0vn2pinf1b(?E ?X ?Y ?Z) initial+n1[cat:p mode:FIXME]![]+{+  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X]+  n3 type:anchor [cat:v idx:?E]![]+  n5 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z]+  n6[cat:p]![]+  {n7[cat:prep]![]+    {+      n8 type:lex "de"+    } +    n9 type:subst [cat:p idx:?Y mode:inf sujidx:?Z]![cat:p idx:?Y] +  }+}++  %15 infinitive persuader gn  pinf_de	vinfn2pinf1+vArity3controlObj:vinfn2pinf1b(?E ?X ?Y ?Z) initial+n1[cat:p idx:?E mode:inf sujidx:?X]![cat:p] +{+  n2 type:anchor [cat:v idx:?E]![]+  n4 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z] +  n5[cat:p]![]+  {n6[cat:prep]![]+    {+      n7 type:lex "de"+    } +    n8 type:subst [cat:p idx:?Y mode:inf sujidx:?Z]![cat:p idx:?Y]+  }+}++  %18 rel-sjt	 n qui persuade gn  pinf_de	rel0vn2pinf1+vArity3controlObj:n0vn1sp2(?E ?X ?Y ?Z) initial+n1[cat:p mode:FIXME]![]+{+  n2 type:subst [cat:n idx:?X det:plus qu:minus]![cat:n idx:?X]+  n3 type:anchor [cat:v idx:?E]![]+  n5 type:subst [cat:n idx:?Y det:plus qu:minus]![cat:n idx:?Y]+  n6[cat:sp idx:?Z det:plus]![]+  { n8[cat:p]![]+    {+      n9 type:lex "a"+    }+    n10 type:subst [cat:n idx:?Z det:plus qu:minus]![cat:n idx:?Z+    ] +  }+}++% vi: set cinoptions=0,p0:++

@@ -15,12 +15,12 @@ SUITE_LEXICON:=$(LEXICON_DIR)/$(FULL_LEXICON_PREFIX).lex SUITE_MORPH:=$(LEXICON_DIR)/$(MORPH_PREFIX).mph -GENI_GRAMMAR:=$(COMPILED_GRAMMAR_DIR)/$(GRAMMAR).genib+GENI_GRAMMAR:=$(COMPILED_GRAMMAR_DIR)/$(GRAMMAR).geni GENI_LEXICON:=$(LEXICON_DIR)/$(FULL_LEXICON_PREFIX).glex GENI_MORPH:=$(LEXICON_DIR)/$(MORPH_PREFIX).gmorph GENI_SUITE:=suite -GENI_OPTIMISATIONS:='pol f-sem'+GENI_OPTIMISATIONS:='pol'  GENI_LEX_FLAGS:=-l $(GENI_LEXICON) -s $(GENI_SUITE) ifdef ENABLE_MORPH@@ -59,7 +59,7 @@ NEW_DERIVATIONS:=new-derivations  run: $(GENI_GRAMMAR) lexicon morph-	$(GENI) -m $< $(GENI_FLAGS) --nogui --batchdir=results+	$(GENI) -m $< $(GENI_FLAGS) --nogui --batchdir=results --rootfeat='[cat:s]'  # -------------------------------------------------------------------- # running GenI@@ -109,11 +109,7 @@  %.geni : %.xml 	$(ECHO_STATUS) "converting to geni text format: $(basename $<)"-	$(SILENTLY) geniconvert -f tagml -t geni $< -o $@--%.genib : %.geni-	$(ECHO_STATUS) "converting to geni binary format: $<"-	$(SILENTLY) geniconvert -f geni -t genib $< -o $@+	$(SILENTLY) xsltproc  -o $@ xmg2geni.xsl $<  # -------------------------------------------------------------------- # lexicon

@@ -0,0 +1,5 @@+module Main where++import NLP.GenI.Test++main = runTests

@@ -0,0 +1,53 @@+-- ----------------------------------------------------------------------+-- GenI surface realiser+-- Copyright (C) 2009 Eric Kow+--+-- This program is free software; you can redistribute it and/or+-- modify it under the terms of the GNU General Public License+-- as published by the Free Software Foundation; either version 2+-- of the License, or (at your option) any later version.+--+-- This program is distributed in the hope that it will be useful,+-- but WITHOUT ANY WARRANTY; without even the implied warranty of+-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the+-- GNU General Public License for more details.+--+-- You should have received a copy of the GNU General Public License+-- along with this program; if not, write to the Free Software+-- Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.+-- ----------------------------------------------------------------------++module NLP.GenI.Test where++import Data.List ( isPrefixOf )+import System.Environment ( getArgs )++import Test.Framework++import NLP.GenI.Test.FeatureStructure ( suite )+import NLP.GenI.Test.Parser ( suite )+import NLP.GenI.Test.GeniVal ( suite )+import NLP.GenI.Test.LexicalSelection ( suite )+import NLP.GenI.Test.Lexicon ( suite )+import NLP.GenI.Test.Morphology ( suite )+import NLP.GenI.Test.Polarity ( suite )+import NLP.GenI.Test.Semantics ( suite )+import NLP.GenI.Test.Simple.SimpleBuilder ( suite )+import NLP.GenI.Regression++runTests :: IO ()+runTests = do+    args <- filter (not . (`isPrefixOf` "--unit-tests")) `fmap` getArgs+    funcSuite <- NLP.GenI.Regression.mkSuite+    flip defaultMainWithArgs args+        [ NLP.GenI.Test.GeniVal.suite+        , NLP.GenI.Test.Parser.suite+        , NLP.GenI.Test.FeatureStructure.suite+        , NLP.GenI.Test.LexicalSelection.suite+        , NLP.GenI.Test.Lexicon.suite+        , NLP.GenI.Test.Morphology.suite+        , NLP.GenI.Test.Polarity.suite+        , NLP.GenI.Test.Semantics.suite+        , NLP.GenI.Test.Simple.SimpleBuilder.suite+        , funcSuite+        ]

@@ -0,0 +1,20 @@+-- GenI surface realiser+-- Copyright (C) 2005 Carlos Areces and Eric Kow+--+-- This program is free software; you can redistribute it and/or+-- modify it under the terms of the GNU General Public License+-- as published by the Free Software Foundation; either version 2+-- of the License, or (at your option) any later version.+--+-- This program is distributed in the hope that it will be useful,+-- but WITHOUT ANY WARRANTY; without even the implied warranty of+-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the+-- GNU General Public License for more details.+--+-- You should have received a copy of the GNU General Public License+-- along with this program; if not, write to the Free Software+-- Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.++module Main (module NLP.GenI.Main) where++import NLP.GenI.Main

@@ -0,0 +1,12 @@+module BoolExp where++data BoolExp a = Cond a+               | And (BoolExp a) (BoolExp a)+               | Or  (BoolExp a) (BoolExp a)+               | Not (BoolExp a)++check :: (a -> Bool) -> BoolExp a -> Bool+check f (Cond x)  = f x+check f (And x y) = check f x && check f y+check f (Or x y)  = check f x || check f y+check f (Not x)   = not (check f x)

@@ -0,0 +1,14 @@+{-# OPTIONS_GHC -fno-warn-unused-imports #-}+module Data.FullList+   (FullList,+    fromFL,+    indeedFL,+    head,+    tail,+    (++),+    sortNub,+    Listable (..)+    ) where++import Data.FullList.Internal+import Prelude hiding ( head, tail, (++) )

@@ -0,0 +1,80 @@+{-# LANGUAGE DeriveDataTypeable #-}++-- from http://www.haskell.org/haskellwiki/Non-empty_list+-- Safe list functions++module Data.FullList.Internal where++import Data.Binary+import Control.DeepSeq+import Prelude hiding (head, tail, (++))+import qualified Prelude+import Data.Data+import Data.List ( sort, nub )++newtype FullList a = FullList [a]  -- data constructor is not exported!+  deriving (Eq, Ord, Show, Data, Typeable)++fromFL :: FullList a -> [a]+fromFL (FullList x) = x                 -- Injection into general lists++-- The following is an analogue of `maybe'+indeedFL :: [a] -> w -> (FullList a -> w) -> w+indeedFL x on_empty on_full+    | null x = on_empty+    | otherwise = on_full $ FullList x++-- The following are _total_ functions+-- They are guaranteed to be safe, and so we could have used+-- unsafeHead# and unsafeTail# if GHC provides though...++head :: FullList a -> a+head (FullList (x:_)) = x+head (FullList _) = error "NList.head is broken"++tail :: FullList a -> [a]+tail (FullList (_:x)) = x+tail (FullList _) = error "NList.tail is broken"++(++) :: FullList a -> FullList a -> FullList a+(++) x y = FullList ((Prelude.++) (fromFL x) (fromFL y)) -- OK because both already full++sortNub :: (Eq a, Ord a) => FullList a -> FullList a+sortNub xs =+  case (sort . nub . fromFL $ xs) of+   []     -> error "sortNub is broken"+   (y:ys) -> y !: ys++-- Mapping over a non-empty list gives a non-empty list+instance Functor FullList where+    fmap f (FullList x) = FullList (map f x)++-- Adding something to a general list surely gives a non-empty list+infixr 5 !:++class Listable l where+    (!:) :: a -> l a -> FullList a++instance Listable [] where+    (!:) h t = FullList (h:t)++instance Listable FullList where+    (!:) h (FullList t) = FullList (h:t)++{-!+deriving instance NFData a => NFData (FullList a)+deriving instance Binary a => Binary (FullList a)+!-}+-- GENERATED START+++instance (NFData a) => NFData (FullList a) where+        rnf (FullList x1) = rnf x1 `seq` ()+++instance (Binary a) => Binary (FullList a) where+        put (FullList x1) = put x1+        get+          = do x1 <- get+               return (FullList x1)+-- GENERATED STOP

@@ -1,126 +0,0 @@-% GenI surface realiser-% Copyright (C) 2005 Carlos Areces and Eric Kow-%-% This program is free software; you can redistribute it and/or-% modify it under the terms of the GNU General Public License-% as published by the Free Software Foundation; either version 2-% of the License, or (at your option) any later version.-%-% This program is distributed in the hope that it will be useful,-% but WITHOUT ANY WARRANTY; without even the implied warranty of-% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the-% GNU General Public License for more details.-%-% You should have received a copy of the GNU General Public License-% along with this program; if not, write to the Free Software-% Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.--\chapter{Main}--Welcome to the GenI source code.  The main module is where everything-starts from.  If you're trying to figure out how GenI works, the main-action is in Geni and Tags -(chapters \ref{cha:Geni} and \ref{cha:Tags}).  --\begin{code}-module Main (main) where-\end{code}--\ignore{-\begin{code}-import Control.Applicative ((<$>))-import Data.IORef(newIORef)-import Data.Typeable( Typeable )-import Data.Version ( showVersion )-import System.Environment(getArgs, getProgName)--import Paths_GenI ( version )--import NLP.GenI.Geni(emptyProgState)-import NLP.GenI.Console(consoleGeni)-import NLP.GenI.Configuration (treatArgs, optionsForStandardGenI, processInstructions,-                               usage, optionsSections, Params,-                               hasFlagP, BatchDirFlg(..), DisableGuiFlg(..),-                               DumpDerivationFlg(..),  FromStdinFlg(..),-                               HelpFlg(..), VersionFlg(..), TestCaseFlg(..),-                               RegressionTestModeFlg(..), RunUnitTestFlg(..),-                              )-import NLP.GenI.Regression (regressionGeni)-import NLP.GenI.Test (runTests)--#ifdef DISABLE_GUI-import NLP.GenI.Configuration(setFlagP)-import NLP.GenI.Geni(ProgStateRef)-#else-import NLP.GenI.Gui(guiGeni)-#endif--#ifdef DISABLE_GUI-guiGeni :: ProgStateRef -> IO ()-guiGeni = consoleGeni-#endif-\end{code}-}--In figure \ref{fig:code-outline-main} we show what happens from main: First, we-hand control off to either the console or the graphical user interface.  These-functions then do all the business stuff like loading files and figuring out-what to generate.  From there, they invoke the the generation step-\fnref{runGeni} which does surface realisation from A-Z.  Alternately, the-graphical interface could invoke a graphical debugger which also does surface-realisation from A-Z but allows you to intervene, inspect and stop at each-step.--\begin{figure}-\begin{center}-\includegraphics[scale=0.25]{images/code-outline-main}-\label{fig:code-outline-main}-\caption{How the GenI entry point is used}-\end{center}-\end{figure}--\begin{code}-main :: IO ()-main = do       -  pname <- getProgName-  args  <- getArgs-  confArgs <- forceGuiFlag <$> (processInstructions =<< treatArgs optionsForStandardGenI args)-  let pst = emptyProgState confArgs-  pstRef <- newIORef pst-  let has :: (Typeable f, Typeable x) => (x -> f) -> Bool-      has = flip hasFlagP confArgs-      mustRunInConsole = has DumpDerivationFlg || has FromStdinFlg || has BatchDirFlg-      canRunInConsole  = has TestCaseFlg-  case () of-   _ | has HelpFlg               -> putStrLn (usage optionsSections pname)-     | has VersionFlg            -> putStrLn ("GenI " ++ showVersion version)-     | has RunUnitTestFlg        -> runTests-     | has RegressionTestModeFlg -> regressionGeni pstRef-     | mustRunInConsole          -> consoleGeni pstRef-     | not (has DisableGuiFlg)   -> guiGeni pstRef-     | canRunInConsole           -> consoleGeni pstRef-     | otherwise                 -> fail $ unlines-        [ "GenI must either be run..."-        , " - with the graphical interface enabled"-        , " - in regression testing mode"-        , " - in self-diagnostic unit test mode"-        , " - with a test case specified"-        , " - with a batch directory specified or"-        , " - with --dump"-        , " - with --from-stdin"-        ]--forceGuiFlag :: Params -> Params-#ifdef DISABLE_GUI-forceGuiFlag = setFlagP DisableGuiFlg ()-#else-forceGuiFlag = id-#endif-\end{code}--% TODO-% Define what is and what is not exported from the modules.  -%      In particular in BTypes take care to export the inspection function -%      but not the types.-%      Re-write functions in Main as needed.-% Change input in Lexicon and Grammar to allow more than one anchor.

@@ -0,0 +1,872 @@+-- GenI surface realiser+-- Copyright (C) 2005 Carlos Areces and Eric Kow+--+-- This program is free software; you can redistribute it and/or+-- modify it under the terms of the GNU General Public License+-- as published by the Free Software Foundation; either version 2+-- of the License, or (at your option) any later version.+--+-- This program is distributed in the hope that it will be useful,+-- but WITHOUT ANY WARRANTY; without even the implied warranty of+-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the+-- GNU General Public License for more details.+--+-- You should have received a copy of the GNU General Public License+-- along with this program; if not, write to the Free Software+-- Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.++{-# LANGUAGE ScopedTypeVariables, ExistentialQuantification, TypeSynonymInstances #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE DeriveDataTypeable #-}+{-# LANGUAGE OverloadedStrings #-}++-- | This is the interface between the front and backends of the generator. The GUI+--   and the console interface both talk to this module, and in turn, this module+--   talks to the input file parsers and the surface realisation engine.+module NLP.GenI (+             -- * Main interface++             -- ** Program state and configuration+             ProgState(..), ProgStateRef, emptyProgState,+             LexicalSelector,++             -- ** Running GenI+             runGeni,+             GeniResults(..),+             GeniResult(..), isSuccess, GeniError(..), GeniSuccess(..),+             GeniLexSel(..),+             ResultType(..),++             -- * Helpers+             initGeni, extractResults,+             lemmaSentenceString, prettyResult,+             showRealisations, histogram,+             getTraces,++             -- ** Loading things+             loadEverything,+             Loadable(..),+             loadLexicon,+             loadGeniMacros,+             loadTestSuite, parseSemInput,+             loadRanking, BadInputException(..),+             loadFromString,+             )+where+++import Control.Applicative ((<$>),(<*>))+import Control.DeepSeq+import Control.Exception+import Control.Monad.Error+import Data.Binary (Binary, decodeFile)+import Data.IORef (IORef, readIORef, modifyIORef)+import Data.List+import Data.Maybe (fromMaybe)+import Data.Monoid ( mappend, mempty )+import Data.Text ( Text )+import Data.Typeable (Typeable)+import System.CPUTime( getCPUTime )+import System.IO ( stderr )+import qualified Data.Map as Map+import qualified Data.Text as T+import qualified Data.Text.IO as T++import Data.FullList ( fromFL )+import Text.JSON+import qualified System.IO.UTF8 as UTF8++import NLP.GenI.Configuration+    ( Params, customMorph, customSelector+    , getFlagP, hasFlagP, hasOpt, Optimisation(NoConstraints)+    , MacrosFlg(..), LexiconFlg(..), TestSuiteFlg(..)+    , MorphInfoFlg(..), MorphCmdFlg(..)+    , RankingConstraintsFlg(..)+    , PartialFlg(..)+    , FromStdinFlg(..), VerboseModeFlg(..)+    , NoLoadTestSuiteFlg(..)+    , RootFeatureFlg(..)+    , TracesFlg(..)+    , grammarType+    , GrammarType(..)+    )+import NLP.GenI.General+    ( histogram, geniBug, snd3, first3, ePutStr, ePutStrLn, eFlush,+    -- mkLogname,+    )+import NLP.GenI.GeniVal+import NLP.GenI.LexicalSelection ( LexicalSelector, LexicalSelection(..), defaultLexicalSelector )+import NLP.GenI.Lexicon+import NLP.GenI.Morphology+import NLP.GenI.OptimalityTheory+import NLP.GenI.Parser (geniMacros, geniTagElems,+                    geniLexicon, geniTestSuite,+                    geniTestSuiteString, geniSemanticInput,+                    geniMorphInfo,+                    runParser,+                    ParseError,+                    )+import NLP.GenI.Pretty+import NLP.GenI.Semantics+import NLP.GenI.Statistics+import NLP.GenI.Tag ( TagElem, idname, tsemantics, ttrace, setTidnums )+import NLP.GenI.TestSuite ( TestCase(..) )+import NLP.GenI.TreeSchema+import NLP.GenI.Warning+import qualified NLP.GenI.Builder as B++-- -- DEBUG+-- import Control.Monad.Writer+-- import NLP.GenI.Lexicon+-- import NLP.GenI.LexicalSelection+-- import NLP.GenI.FeatureStructures++-- --------------------------------------------------------------------+-- ProgState+-- --------------------------------------------------------------------++-- | The program state consists of its configuration options and abstract,+--   cleaned up representations of all the data it's had to load into memory+--   (tree schemata files, lexicon files, etc).  The intention is for the+--   state to stay static until the next time something triggers some file+--   loading.+data ProgState = ProgState+    { pa       :: Params  -- ^ the current configuration+    , gr       :: Macros  -- ^ tree schemata+    , le       :: Lexicon -- ^ lexical entries+    , morphinf :: MorphInputFn -- ^ function to extract morphological+                               -- information from the semantics (you may+                               -- instead be looking for+                               -- 'NLP.GenI.Configuration.customMorph')+    , ranking  :: OtRanking -- ^ OT constraints    (optional)+    , traces   :: [Text]    -- ^ simplified traces (optional)+    }++type ProgStateRef = IORef ProgState++-- | The program state when you start GenI for the very first time+emptyProgState :: Params -> ProgState+emptyProgState args = ProgState+    { pa = args+    , gr = []+    , le = []+    , morphinf = const Nothing+    , traces = []+    , ranking = []+    }++-- --------------------------------------------------------------------+-- Interface+-- Loading and parsing+-- --------------------------------------------------------------------++-- | We have one master function that loads all the files GenI is expected to+--   use.  This just calls the sub-loaders below, some of which are exported+--   for use by the graphical interface.  The master function also makes sure+--   to complain intelligently if some of the required files are missing.+loadEverything :: ProgStateRef -> IO() +loadEverything pstRef =+  do pst <- readIORef pstRef+     --+     let config   = pa pst+         isMissing f = not $ hasFlagP f config+     -- grammar type+         isNotPreanchored = grammarType config /= PreAnchored+         isNotPrecompiled = grammarType config /= PreCompiled+         useTestSuite =  isMissing FromStdinFlg+                      && isMissing NoLoadTestSuiteFlg+     -- display +     let errormsg =+           concat $ intersperse ", " [ msg | (con, msg) <- errorlst, con ]+         errorlst =+              [ (isMissing RootFeatureFlg,+                "a root feature [empty feature is fine if you are not using polarity filtering]")+              , (isNotPrecompiled && isMissing MacrosFlg,+                "a tree file")+              , (isNotPreanchored && isMissing LexiconFlg,+                "a lexicon file")+              , (useTestSuite && isMissing TestSuiteFlg,+                "a test suite") ]+     unless (null errormsg) $ fail ("Please specify: " ++ errormsg)+     -- we only have to read in grammars from the simple format+     case grammarType config of +        PreAnchored -> return ()+        PreCompiled -> return ()+        _        -> loadGeniMacros pstRef >> return ()+     -- we don't have to read in the lexicon if it's already pre-anchored+     when isNotPreanchored $ loadLexicon pstRef >> return ()+     -- in any case, we have to...+     loadMorphInfo pstRef+     when useTestSuite $ loadTestSuite pstRef >> return ()+     -- the trace filter file+     loadTraces pstRef+     -- OT ranking+     loadRanking pstRef+++-- | The file loading functions all work the same way: we load the file,+--   and try to parse it.  If this doesn't work, we just fail in IO, and+--   GenI dies.  If we succeed, we update the program state passed in as+--   an IORef.+class Loadable x where+  lParse       :: FilePath -- ^ source (optional)+               -> String -> Either ParseError x+  lSet         :: x -> ProgState -> ProgState+  lSummarise   :: x -> String++-- | Note that here we assume the input consists of UTF-8 encoded file+lParseFromFile :: Loadable x => FilePath -> IO (Either ParseError x)+lParseFromFile f = lParse f `fmap` UTF8.readFile f++-- | Returns the input too (convenient for type checking)+lSetState :: Loadable x => ProgStateRef -> x -> IO x+lSetState pstRef x = modifyIORef pstRef (lSet x) >> return x++-- to be phased out+throwOnParseError :: String -> Either ParseError x -> IO x+throwOnParseError descr (Left err) = throwIO (BadInputException descr err)+throwOnParseError _ (Right p)  = return p++data BadInputException = BadInputException String ParseError+  deriving (Show, Typeable)++instance Exception BadInputException++data L a = Loadable a => L++-- | Load something, exiting GenI if we have not been given the+--   appropriate flag+loadOrDie :: forall f a . (Eq f, Typeable f, Loadable a)+          => L a+          -> (FilePath -> f) -- ^ flag+          -> String+          -> ProgStateRef+          -> IO a+loadOrDie L flg descr pstRef =+  withFlagOrDie flg pstRef descr $ \f -> do+   v <- verbosity pstRef+   x <- withLoadStatus v f descr lParseFromFile+     >>= throwOnParseError descr+     >>= lSetState pstRef+   return x++-- | Load something from a string rather than a file+loadFromString :: Loadable a => ProgStateRef+               -> String -- ^ description+               -> String -- ^ string to load+               -> IO a+loadFromString pstRef descr s =+  throwOnParseError descr (lParse "" s) >>= lSetState pstRef++instance Loadable Lexicon where+  lParse f = fmap toLexicon . runParser geniLexicon () f+    where+     fixEntry  = finaliseVars "" -- anonymise singletons for performance+               . sorter+     toLexicon = map fixEntry+     sorter l  = l { isemantics = (sortByAmbiguity . isemantics) l }+  lSet x p = p { le = x }+  lSummarise x = show (length x) ++ " lemmas"++instance Loadable Macros where+  lParse f = runParser geniMacros () f+  lSet x p = p { gr = x }+  lSummarise x = show (length x) ++ " schemata"++loadLexicon :: ProgStateRef -> IO Lexicon+loadLexicon = loadOrDie (L :: L Lexicon) LexiconFlg "lexicon"++-- | The macros are stored as a hashing function in the monad.+loadGeniMacros :: ProgStateRef -> IO Macros+loadGeniMacros pstRef =+  withFlagOrDie MacrosFlg pstRef descr $ \f -> do+     v <- verbosity pstRef+     withLoadStatus v f descr (parseFromFileMaybeBinary lParseFromFile)+     >>= throwOnParseError "tree schemata"+     >>= lSetState pstRef+  where+   descr = "trees"++-- | Load something, but only if we are configured to do so+loadOptional :: forall f a . (Eq f, Typeable f, Loadable a)+             => L a+             -> (FilePath -> f) -- ^ flag+             -> String+             -> ProgStateRef+             -> IO ()+loadOptional L flg descr pstRef =+  withFlagOrIgnore flg pstRef $ \f -> do+   v <- verbosity pstRef+   x <- withLoadStatus v f descr lParseFromFile+     >>= throwOnParseError descr+     >>= lSetState pstRef+   let _ = x :: a+   return () -- ignore++newtype MorphFnL = MorphFnL MorphInputFn++instance Loadable MorphFnL where+  lParse f = fmap (MorphFnL . readMorph) . runParser geniMorphInfo () f+  lSet (MorphFnL x) p = p { morphinf = x }+  lSummarise _ = "morphinfo"++newtype TracesL = TracesL [Text]++instance Loadable TracesL where+    lParse _ = Right . TracesL . T.lines . T.pack+    lSet (TracesL xs) p = p { traces = xs }+    lSummarise (TracesL xs) = show (length xs) ++ " traces"++instance Loadable OtRanking where+  lParse _ = resultToEither2 . decode+  lSet r p = p { ranking = r }+  lSummarise _ = "ranking"++loadMorphInfo :: ProgStateRef -> IO ()+loadMorphInfo = loadOptional (L :: L MorphFnL) MorphInfoFlg "morphological info"++loadTraces :: ProgStateRef -> IO ()+loadTraces = loadOptional (L :: L TracesL) TracesFlg "traces"++loadRanking :: ProgStateRef -> IO ()+loadRanking = loadOptional (L :: L OtRanking) RankingConstraintsFlg "OT constraints"++resultToEither2 :: Result a -> Either ParseError a+resultToEither2 r =+  case resultToEither r of+    Left e  -> runParser (fail e) () "" [] -- convoluted way to generate a Parsec error+    Right x -> Right x++-- Target semantics+--+-- Reading in the target semantics (or test suite) is a little more+-- complicated.  It follows the same general schema as above, except+-- that we parse the file twice: once for our internal representation,+-- and once to get a string representation of each test case.  The+-- string representation is for the graphical interface; it avoids us+-- figuring out how to pretty-print things because we can assume the+-- user will format it the way s/he wants.++newtype TestSuiteL = TestSuiteL [TestCase]++instance Loadable TestSuiteL where+ lParse f s =+   case runParser geniTestSuite () f s of+     Left e     -> Left e+     Right sem  -> case runParser geniTestSuiteString () f s of+        Left e      -> Left e+        Right mStrs -> Right (TestSuiteL (zipWith cleanup sem mStrs))+   where+    cleanup tc str =+        tc { tcSem = first3 sortSem (tcSem tc)+           , tcSemString = str }+ --+ lSet (TestSuiteL _) p = p+ lSummarise (TestSuiteL x) = show (length x) ++ " cases"++-- |+loadTestSuite :: ProgStateRef -> IO [TestCase]+loadTestSuite pstRef = do+  TestSuiteL xs <- loadOrDie (L :: L TestSuiteL) TestSuiteFlg "test suite" pstRef+  return xs++parseSemInput :: String -> Either ParseError SemInput+parseSemInput = fmap smooth . runParser geniSemanticInput () "semantics"+  where+    smooth (s,r,l) = (sortSem s, sort r, l)++-- Helpers for loading files++withFlag :: forall f a . (Eq f, Typeable f)+         => (FilePath -> f) -- ^ flag+         -> ProgStateRef+         -> IO a               -- ^ null action+         -> (FilePath -> IO a) -- ^ job+         -> IO a+withFlag flag pstRef z job =+ do config <- pa `fmap` readIORef pstRef+    case getFlagP flag config of+      Nothing -> z+      Just  x -> job x++withFlagOrIgnore :: forall f . (Eq f, Typeable f)+                 => (FilePath -> f) -- ^ flag+                 -> ProgStateRef+                 -> (FilePath -> IO ())+                 -> IO ()+withFlagOrIgnore flag pstRef = withFlag flag pstRef (return ())++withFlagOrDie :: forall f a . (Eq f, Typeable f)+              => (FilePath -> f) -- ^ flag+              -> ProgStateRef+              -> String+              -> (FilePath -> IO a)+              -> IO a+withFlagOrDie flag pstRef description =+    withFlag flag pstRef (fail msg)+  where+    msg = "Please specify a " ++ description ++ " file!"++withLoadStatus :: Loadable a+               => Bool                    -- ^ verbose+               -> FilePath             -- ^ file to load+               -> String               -- ^ description+               -> (FilePath -> IO (Either ParseError a)) -- ^ parsing cmd+               -> IO (Either ParseError a)+withLoadStatus False f _ p = p f+withLoadStatus True  f d p = do+  ePutStr $ unwords [ "Loading",  d, f ++ "... " ]+  eFlush+  mx <- p f+  ePutStrLn $ either (const "ERROR") (\x -> lSummarise x ++ " loaded") mx+  return mx++parseFromFileMaybeBinary :: Binary a+                         => (FilePath -> IO (Either ParseError a))+                         -> FilePath+                         -> IO (Either ParseError a)+parseFromFileMaybeBinary p f =+ if (".genib" `isSuffixOf` f)+    then Right `fmap` decodeFile f+    else p f++-- --------------------------------------------------------------------+-- Surface realisation - entry point+-- --------------------------------------------------------------------++-- | 'GeniResults' is the outcome of running GenI on a single input semantics.+--   Each distinct result is returned as a single 'GeniResult' (NB: a single+--   result may expand into multiple strings through morphological+--   post-processing),+data GeniResults = GeniResults+    { grResults        :: [GeniResult] -- ^ one per chart item+    , grGlobalWarnings :: [Text]       -- ^ usually from lexical selection+    , grStatistics     :: Statistics   -- ^ things like number of chart items+                                       --   to help study efficiency+    }++data GeniResult = GError   GeniError+                | GSuccess GeniSuccess+  deriving (Ord, Eq)++isSuccess :: GeniResult -> Bool+isSuccess (GSuccess _) = True+isSuccess (GError _)   = False++data GeniError = GeniError [Text]+  deriving (Ord, Eq)++data GeniSuccess = GeniSuccess+    { grLemmaSentence :: LemmaPlusSentence -- ^ “original” uninflected result +    , grRealisations  :: [Text]            -- ^ results after morphology+    , grResultType    :: ResultType+    , grWarnings      :: [Text]            -- ^ warnings “local” to this particular+                                           --   item, cf. 'grGlobalWarnings'+    , grDerivation    :: B.TagDerivation   -- ^ derivation tree behind the result+    , grOrigin        :: Integer           -- ^ normally a chart item id+    , grLexSelection  :: [GeniLexSel]      -- ^ the lexical selection behind+                                           --   this result (info only)+    , grRanking       :: Int               -- ^ see 'NLP.GenI.OptimalityTheory'+    , grViolations    :: [OtViolation]     -- ^ which OT constraints were violated+    } deriving (Ord, Eq)++data GeniLexSel = GeniLexSel+    { nlTree  :: Text+    , nlTrace :: [Text]+    } deriving (Ord, Eq)++data ResultType = CompleteResult | PartialResult deriving (Ord, Eq)++instance Pretty GeniError where+    pretty (GeniError xs) = T.intercalate "\n" $ map ("Error:" <+>) xs++-- | Entry point! (the most useful function to know here)+-- +--   * Initialises the realiser (lexical selection, among other things),+--+--   * Runs the builder (the surface realisation engine proper)+--+--   * Unpacks the builder results +--+--   * Finalises the results (morphological generation)+--+--   In addition to the results, this returns a generator state.  The latter is+--   is mostly useful for debugging via the graphical interface.+--   Note that we assumes that you have already loaded in your grammar and+--   parsed your input semantics.+runGeni :: ProgStateRef -> SemInput -> B.Builder st it Params -> IO (GeniResults,st)+runGeni pstRef semInput builder = do+     pst <- readIORef pstRef+     let config = pa pst+         run    = B.run builder+     -- step 1: lexical selection+     (initStuff, initWarns) <- initGeni pstRef semInput+     --force evaluation before measuring start time to avoid including grammar/lexicon parsing.+     start <- rnf initStuff `seq` getCPUTime+     -- step 2: chart generation+     let (finalSt, stats) = run initStuff config+     -- step 3: unpacking and+     -- step 4: post-processing+     results <- extractResults pstRef builder finalSt+     --force evaluation before measuring end time to account for all the work that should be done.+     end <- rnf results `seq` getCPUTime+     let elapsedTime = picosToMillis $! end - start+         diff = round (elapsedTime :: Double) :: Int+         stats2 = updateMetrics (incrIntMetric "gen_time"  (fromIntegral diff) ) stats+         gresults = GeniResults { grResults        = results+                                , grStatistics     = stats2+                                , grGlobalWarnings = map showWarnings (fromGeniWarnings initWarns)+                                }+     return (gresults, finalSt)+  where+    showWarnings = T.intercalate "\n" . showGeniWarning++-- | This is a helper to 'runGenI'. It's mainly useful if you are building+--   interactive GenI debugging tools.+--+--   Given a builder state,+--+--   * Unpacks the builder results+--+--   * Finalises the results (morphological generation)+extractResults :: ProgStateRef ->  B.Builder st it Params -> st -> IO [GeniResult]+extractResults pstRef builder finalSt = do+    config  <- pa <$> readIORef pstRef+    -- step 3: unpacking+    let uninflected = B.unpack builder finalSt+        (rawResults, resultTy) =+            if null uninflected && hasFlagP PartialFlg config+               then (B.partial builder finalSt, PartialResult)+               else (uninflected              , CompleteResult)+        status = B.finished builder finalSt+    -- step 4: post-processing+    finaliseResults pstRef (resultTy, status, rawResults)++-- --------------------------------------------------------------------+-- Surface realisation - sub steps+-- --------------------------------------------------------------------++-- | 'initGeni' performs lexical selection and strips the input semantics of+--   any morpohological literals+initGeni :: ProgStateRef -> SemInput -> IO (B.Input, GeniWarnings)+initGeni pstRef semInput_ = do+    pst <- readIORef pstRef+    let semInput = stripMorphStuff pst+                 . maybeRemoveConstraints pst+                 $ semInput_+    -- lexical selection+    selection <- runLexSelection pstRef semInput+    -- strip morphological predicates+    let initStuff = B.Input +          { B.inSemInput = semInput+          , B.inLex   = lsLexEntries selection+          , B.inCands = map (\c -> (c,-1)) (lsAnchored selection)+          }+    return (initStuff, lsWarnings selection)+  where+    stripMorphStuff pst = first3 (stripMorphSem (morphinf pst))+    -- disable constraints if the NoConstraintsFlg pessimisation is active+    maybeRemoveConstraints pst =+         if hasOpt NoConstraints (pa pst) then removeConstraints else id++-- | 'finaliseResults' does any post-processing steps that we want to integrate+--   into mainline GenI.  So far, this consists of morphological realisation and+--   OT ranking+finaliseResults :: ProgStateRef -> (ResultType, B.GenStatus, [B.Output]) -> IO [GeniResult]+finaliseResults pstRef (ty, status, os) = do+    pst <- readIORef pstRef+    -- morph TODO: make this a bit safer+    mss <- case getFlagP MorphCmdFlg (pa pst) of+             Nothing  -> let morph = fromMaybe (map sansMorph) (customMorph (pa pst))+                         in  return (morph sentences)+             Just cmd -> map snd `fmap` inflectSentencesUsingCmd cmd sentences+    -- OT ranking+    let unranked = zipWith (sansRanking pst) os mss+        rank = rankResults (getTraces pst) grDerivation (ranking pst)+        successes = map addRanking (rank unranked)+        failures  = case status of+                      B.Error str -> [GeniError [str]]+                      B.Finished  -> []+                      B.Active    -> []+    return (map GError failures ++ map GSuccess successes)+ where+  sentences = map snd3 os+  sansRanking pst (i,l,d) rs = GeniSuccess+               { grLemmaSentence = l+               , grRealisations = moRealisations rs+               , grWarnings     = moWarnings rs+               , grDerivation   = d+               , grLexSelection = map (\x -> GeniLexSel x (getTraces pst x)) (B.lexicalSelection d)+               , grRanking = -1+               , grViolations = []+               , grResultType = ty+               , grOrigin     = i+               }+  addRanking (i,res,vs) = res { grViolations = vs, grRanking = i }++-- --------------------------------------------------------------------+-- Displaying results+-- --------------------------------------------------------------------++-- | Show the sentences produced by the generator, in a relatively compact form+showRealisations :: [String] -> String+showRealisations [] = "(none)"+showRealisations xs = unlines . map sho . Map.toList . histogram $ xs+  where+   sho (x,1) = x+   sho (x,c) = x ++ " (" ++ show c ++ " instances)"++-- | No morphology! Pretend the lemma string is a sentence+lemmaSentenceString :: GeniSuccess -> Text+lemmaSentenceString = T.unwords . map lpLemma . grLemmaSentence++prettyResult :: ProgState -> GeniSuccess -> Text+prettyResult pst nr =+    T.intercalate "\n" . map showOne . grRealisations $ nr+ where+    showOne str = pretty theRanking <> ". " <> str <> "\n" <> violations+    violations  = prettyViolations tracesFn verbose (grViolations nr)+    theRanking  = grRanking nr+    verbose  = hasFlagP VerboseModeFlg (pa pst)+    tracesFn = getTraces pst++-- | 'getTraces' is most likely useful for grammars produced by a+--   metagrammar system.  Given a tree name, we retrieve the ``trace''+--   information from the grammar for all trees that have this name.  We+--   assume the tree name was constructed by GenI; see the source code for+--   details.+getTraces :: ProgState -> Text -> [Text]+getTraces pst tname =+  filt $ concat [ ptrace t | t <- gr pst, pidname t == readPidname tname ]+  where+   filt = case traces pst of+          []    -> id+          theTs -> filter (`elem` theTs)++-- | We assume the name was constructed by 'combineName'+readPidname :: Text -> Text+readPidname n =+    case T.splitOn ":" n of+        (_:_:p:_) -> p+        _         -> geniBug "NLP.GenI.readPidname or combineName are broken"++-- --------------------------------------------------------------------+-- Lexical selection+-- --------------------------------------------------------------------++-- | Runs the lexical selection (be it the standard GenI version or+--   a custom function supplied by a user) and runs the results+--   through the universal 'finaliseLexSelection'.+--+--   Also hunts for some warning conditions+runLexSelection :: ProgStateRef -> SemInput -> IO LexicalSelection+runLexSelection pstRef (tsem,_,litConstrs) = do+    pst <- readIORef pstRef+    let config   = pa pst+        verbose  = hasFlagP VerboseModeFlg config+    -- perform lexical selection+    selector  <- getLexicalSelector pstRef+    selection <- selector (gr pst) (le pst) tsem+    let lexCand   = lsLexEntries selection+        candFinal = finaliseLexSelection (morphinf pst) tsem litConstrs (lsAnchored selection)+    -- status+    when verbose $ T.hPutStrLn stderr . T.unlines $+        "Lexical items selected:"+        :  map (indent . showLexeme . fromFL . iword) lexCand+        ++ ["Trees anchored (family) :"]+        ++ map (indent . idname) candFinal+    -- warnings+    let semWarnings = case missingLiterals candFinal tsem of+                       [] -> []+                       xs -> [NoLexSelection xs]+    return $ selection { lsAnchored = candFinal+                       , lsWarnings = mkGeniWarnings semWarnings `mappend` lsWarnings selection+                       }+  where+    indent  x = ' ' `T.cons` x++-- | Grab the lexical selector from the config, or return the standard GenI+--   version if none is supplied+getLexicalSelector :: ProgStateRef -> IO LexicalSelector+getLexicalSelector pstRef = do+  config <- pa <$> readIORef pstRef+  case (customSelector config, grammarType config) of+    (Just s, _)            -> return s+    (Nothing, PreAnchored) -> mkPreAnchoredLexicalSelector pstRef+    (Nothing, _)           -> return defaultLexicalSelector++-- | @missingLiterals ts sem@ returns any literals in @sem@ that do not+--   appear in any of the @ts@ trees+missingLiterals :: [TagElem] -> [Literal GeniVal] -> [Literal GeniVal]+missingLiterals cands tsem =+   tsem \\ (nub $ concatMap tsemantics cands)++-- | Post-processes lexical selection results to things which+--   GenI considers applicable to all situations:+--+--   * attaches morphological information to trees+--+--   * throws out elementary trees that violate trace constraints+--     given by the user+--+--   * filters out any elementary tree whose semantics contains+--     things that are not in the input semantics+finaliseLexSelection :: MorphInputFn -> Sem -> [LitConstr] -> [TagElem] -> [TagElem]+finaliseLexSelection morph tsem litConstrs =+  setTidnums . considerCoherency . considerLc . considerMorph+ where+   -- attach any morphological information to the candidates+   considerMorph = attachMorph morph tsem+   -- filter out candidates which do not fulfill the trace constraints+   matchesLc t = all (`elem` myTrace) constrs+         where constrs = concat [ cs | (l,cs) <- litConstrs, l `elem` mySem ]+               mySem   = tsemantics t+               myTrace = ttrace t+   considerLc = filter matchesLc+   -- filter out candidates whose semantics has bonus stuff which does+   -- not occur in the input semantics+   considerCoherency = filter (all (`elem` tsem) . tsemantics)++-- --------------------------------------------------------------------+-- Pre-selection and pre-anchoring+-- --------------------------------------------------------------------++newtype PreAnchoredL = PreAnchoredL [TagElem]++instance Loadable PreAnchoredL where+  lParse f = fmap PreAnchoredL+           . runParser geniTagElems () f+  lSet _ p = p -- this does not update prog state at all+  lSummarise (PreAnchoredL xs) = show (length xs) ++ " trees"++readPreAnchored :: ProgStateRef -> IO [TagElem]+readPreAnchored pstRef = do+  PreAnchoredL xs <- loadOrDie (L :: L PreAnchoredL)+                        MacrosFlg "preanchored trees" pstRef+  return xs++mkPreAnchoredLexicalSelector :: ProgStateRef -> IO LexicalSelector+mkPreAnchoredLexicalSelector pstRef = do+  xs <- readPreAnchored pstRef+  return (\_ _ _ -> return (LexicalSelection xs [] mempty))++-- --------------------------------------------------------------------+-- Boring utility code+-- --------------------------------------------------------------------++verbosity :: ProgStateRef -> IO Bool+verbosity = fmap (hasFlagP VerboseModeFlg . pa)+          . readIORef++instance JSON GeniResult where+ readJSON j =+    case readJSON j of+      Ok s    -> Ok (GSuccess s)+      Error _ -> GError `fmap` readJSON j+ showJSON (GSuccess x) = showJSON x+ showJSON (GError   x) = showJSON x++instance JSON GeniSuccess where+ readJSON j = do+   jo <- fromJSObject `fmap` readJSON j+   let field x = maybe (fail $ "Could not find: " ++ x) readJSON+               $ lookup x jo+   GeniSuccess <$> field "raw"+               <*> field "realisations"+               <*> field "result-type"+               <*> field "warnings"+               <*> field "derivation"+               <*> field "chart-item"+               <*> field "lexical-selection"+               <*> field "ranking"+               <*> field "violations"+ showJSON nr =+     JSObject . toJSObject $ [ ("raw", showJSON $ grLemmaSentence nr)+                             , ("realisations", showJSONs $ grRealisations nr)+                             , ("derivation", showJSONs $ grDerivation nr)+                             , ("lexical-selection", showJSONs $ grLexSelection nr)+                             , ("ranking", showJSON $ grRanking nr)+                             , ("violations", showJSONs $ grViolations nr)+                             , ("result-type", showJSON $ grResultType nr)+                             , ("chart-item", showJSON $ grOrigin nr)+                             , ("warnings",   showJSONs $ grWarnings nr)+                             ]++instance JSON GeniError where+ readJSON j =+    do jo <- fromJSObject `fmap` readJSON j+       let field x = maybe (fail $ "Could not find: " ++ x) readJSON+                   $ lookup x jo+       GeniError  <$> field "errors"+ showJSON (GeniError xs) =+     JSObject . toJSObject $ [ ("errors", showJSON xs) ]++instance JSON ResultType where+  readJSON j =+    do js <- fromJSString `fmap` readJSON j+       case js of+         "partial"   -> return PartialResult+         "complete"  -> return CompleteResult+         ty          -> fail $ "unknown result type: " ++ ty+  showJSON CompleteResult = JSString $ toJSString "complete"+  showJSON PartialResult  = JSString $ toJSString "partial"++instance JSON GeniLexSel where+ readJSON j =+    do jo <- fromJSObject `fmap` readJSON j+       let field x = maybe (fail $ "Could not find: " ++ x) readJSON+                   $ lookup x jo+       GeniLexSel <$> field "lex-item"+                  <*> field "trace"+ showJSON x =+     JSObject . toJSObject $ [ ("lex-item", showJSON  $ nlTree x)+                             , ("trace",    showJSONs $ nlTrace x)+                             ]++-- Converts picoseconds to milliseconds.+picosToMillis :: Integer -> Double+picosToMillis t = realToFrac t / (10^(9 :: Int))++{-+data MNAME = MNAME deriving Typeable+logname :: String+logname = mkLogname MNAME+-}++{-!+deriving instance NFData GeniResult+deriving instance NFData GeniSuccess+deriving instance NFData GeniError+deriving instance NFData ResultType+deriving instance NFData GeniLexSel+!-}++-- GENERATED START++ +instance NFData GeniResult where+        rnf (GError x1) = rnf x1 `seq` ()+        rnf (GSuccess x1) = rnf x1 `seq` ()++ +instance NFData GeniSuccess where+        rnf (GeniSuccess x1 x2 x3 x4 x5 x6 x7 x8 x9)+          = rnf x1 `seq`+              rnf x2 `seq`+                rnf x3 `seq`+                  rnf x4 `seq`+                    rnf x5 `seq` rnf x6 `seq` rnf x7 `seq` rnf x8 `seq` rnf x9 `seq` ()++ +instance NFData GeniError where+        rnf (GeniError x1) = rnf x1 `seq` ()++ +instance NFData ResultType where+        rnf CompleteResult = ()+        rnf PartialResult = ()++ +instance NFData GeniLexSel where+        rnf (GeniLexSel x1 x2) = rnf x1 `seq` rnf x2 `seq` ()+-- GENERATED STOP

@@ -1,757 +0,0 @@-% GenI surface realiser-% Copyright (C) 2005 Carlos Areces and Eric Kow-%-% This program is free software; you can redistribute it and/or-% modify it under the terms of the GNU General Public License-% as published by the Free Software Foundation; either version 2-% of the License, or (at your option) any later version.-%-% This program is distributed in the hope that it will be useful,-% but WITHOUT ANY WARRANTY; without even the implied warranty of-% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the-% GNU General Public License for more details.-%-% You should have received a copy of the GNU General Public License-% along with this program; if not, write to the Free Software-% Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.--\chapter{Btypes}-\label{cha:Btypes}--This module provides basic datatypes like GNode, as well as operations-on trees, nodes and semantics.  Things here are meant to be relatively-low-level and primitive (well, with the exception of feature structure-unification, that is).--\ignore{-\begin{code}-{-# OPTIONS_GHC -fno-warn-orphans #-}-{-# LANGUAGE MultiParamTypeClasses, TypeSynonymInstances, FlexibleInstances, DeriveDataTypeable #-}-module NLP.GenI.Btypes(-   -- Datatypes-   GNode(..), GType(Subs, Foot, Lex, Other), NodeName,-   Ttree(..), MTtree, SemPols, TestCase(..),-   Ptype(Initial,Auxiliar,Unspecified),-   Pred, Flist, AvPair(..), GeniVal(..),-   Lexicon, ILexEntry(..), MorphLexEntry, Macros, Sem, LitConstr, SemInput, Subst,-   emptyLE, emptyGNode, emptyMacro,--   -- GNode stuff-   gCategory, showLexeme, lexemeAttributes, gnnameIs,--   -- Functions from Tree GNode-   plugTree, spliceTree,-   root, rootUpd, foot, setLexeme, setAnchor,--   -- Functions from Sem-   toKeys, subsumeSem, sortSem, showSem, showPred,-   emptyPred,--   -- Functions from Flist-   sortFlist, unify, unifyFeat, mergeSubst,-   showFlist, showPairs, showAv,--   -- Other functions-   replace, DescendGeniVal(..), replaceList,-   Collectable(..), Idable(..),-   alphaConvert, alphaConvertById,-   fromGConst, fromGVar,-   isConst, isVar, isAnon,--   -- Polarities--) where----- import Debug.Trace -- for test stuff-import Data.List-import Data.Maybe ( mapMaybe )-import Data.Function ( on )-import Data.Generics (Data)-import Data.Typeable (Typeable)-import qualified Data.Map as Map-import qualified Data.Set as Set-import Data.Tree--import Data.Generics.PlateDirect--import NLP.GenI.General(filterTree, listRepNode, snd3, geniBug)-import NLP.GenI.GeniVal----instance Show (IO()) where---  show _ = ""-\end{code}-}--% -----------------------------------------------------------------------\section{Grammar}-% ------------------------------------------------------------------------A grammar is composed of some unanchored trees (macros) and individual-lexical entries. The trees are grouped into families. Every lexical-entry is associated with a single family.  See section section-\ref{sec:combine_macros} for the process that combines lexical items-and trees into a set of anchored trees.--\begin{code}-type MTtree = Ttree GNode-type Macros = [MTtree]--data Ttree a = TT-  { params  :: [GeniVal]-  , pfamily :: String-  , pidname :: String-  , pinterface :: Flist-  , ptype :: Ptype-  , psemantics :: Maybe Sem-  , ptrace :: [String]-  , tree :: Tree a }-  deriving (Show, Data, Typeable)--data Ptype = Initial | Auxiliar | Unspecified-             deriving (Show, Eq, Data, Typeable)--instance Biplate (Ttree String) GeniVal where-  biplate (TT zps x1 x2 zint x3 zsem x4 x5) =-     plate TT ||* zps  |- x1 |- x2-              ||+ zint |- x3-              |+ zsem |- x4 |- x5--instance Biplate (Ttree GNode) GeniVal where-  biplate (TT zps x1 x2 zint x3 zsem x4 zt) =-     plate TT ||* zps  |- x1 |- x2-              ||+ zint |- x3-              |+ zsem |- x4-              |+ zt--instance DescendGeniVal (Ttree GNode) where-  descendGeniVal s mt =-    mt { params = descendGeniVal s (params mt)-       , tree   = descendGeniVal s (tree mt)-       , pinterface  = descendGeniVal s (pinterface mt)-       , psemantics = descendGeniVal s (psemantics mt) }--instance (Collectable a) => Collectable (Ttree a) where-  collect mt = (collect $ params mt) . (collect $ tree mt) .-               (collect $ psemantics mt) . (collect $ pinterface mt)---- | A null tree which you can use for various debugging or display purposes.-emptyMacro :: MTtree-emptyMacro = TT { params  = [],-                  pidname = "",-                  pfamily = "",-                  pinterface = [],-                  ptype = Unspecified,-                  psemantics = Nothing,-                  ptrace = [],-                  tree  = Node emptyGNode []-                 }-\end{code}--\paragraph{Lexical entries}--\begin{code}--- | A lexicon maps semantic predicates to lexical entries.-type Lexicon = Map.Map String [ILexEntry]-type SemPols  = [Int]-data ILexEntry = ILE-    { -- normally just a singleton, useful for merging synonyms-      iword       :: [String]-    , ifamname    :: String-    , iparams     :: [GeniVal]-    , iinterface  :: Flist-    , ifilters    :: Flist-    , iequations  :: Flist-    , iptype      :: Ptype-    , isemantics  :: Sem-    , isempols    :: [SemPols] }-  deriving (Show, Eq, Data, Typeable)--instance Biplate ILexEntry GeniVal where-  biplate (ILE x1 x2 zps zint zfilts zeq x3 zsem x4) =-    plate ILE |- x1 |- x2-              ||* zps-              ||+ zint-              ||+ zfilts-              ||+ zeq  |- x3-              ||+ zsem |- x4--instance DescendGeniVal ILexEntry where-  descendGeniVal s i =-    i { iinterface  = descendGeniVal s (iinterface i)-      , iequations  = descendGeniVal s (iequations i)-      , isemantics  = descendGeniVal s (isemantics i)-      , iparams = descendGeniVal s (iparams i) }--instance Collectable ILexEntry where-  collect l = (collect $ iinterface l) . (collect $ iparams l) .-              (collect $ ifilters l) . (collect $ iequations l) .-              (collect $ isemantics l)--emptyLE :: ILexEntry-emptyLE = ILE { iword = [],-                ifamname = "",-                iparams = [],-                iinterface   = [],-                ifilters = [],-                iptype = Unspecified,-                isemantics = [],-                iequations = [],-                isempols   = [] }-\end{code}--\begin{code}-type MorphLexEntry = (String,String,Flist)-\end{code}--% -----------------------------------------------------------------------\section{TAG nodes (GNode)}-% ------------------------------------------------------------------------\begin{code}--- | A single node of a TAG tree.-data GNode = GN{gnname :: NodeName,-                gup    :: Flist,      -- ^ top feature structure-                gdown  :: Flist,      -- ^ bottom feature structure-                ganchor  :: Bool,     -- ^ @False@ for na nodes-                glexeme  :: [String], -- ^ @[]@ for na nodes-                gtype    :: GType,-                gaconstr :: Bool,-                gorigin  :: String  -- ^ for TAG, this would be the elementary tree-                                    --   that this node originally came from-                }-           deriving (Eq, Data, Typeable)--instance Biplate GNode GeniVal where-  biplate (GN x1 zu zd x2 x3 x4 x5 x6) =-     plate GN |- x1-              ||+ zu-              ||+ zd |- x2 |- x3 |- x4 |- x5 |- x6--instance Biplate (Tree GNode) GeniVal where-  biplate (Node zn zkids) = plate Node |+ zn ||+ zkids---- Node type used during parsing of the grammar-data GType = Subs | Foot | Lex | Other-           deriving (Show, Eq, Data, Typeable)--type NodeName = String---- | A null 'GNode' which you can use for various debugging or display purposes.-emptyGNode :: GNode-emptyGNode = GN { gnname = "",-                  gup = [], gdown = [],-                  ganchor = False,-                  glexeme = [],-                  gtype = Other,-                  gaconstr = False,-                  gorigin = "" }--gnnameIs :: NodeName -> GNode -> Bool-gnnameIs n = (== n) . gnname-\end{code}--A TAG node may have a category.  In the core GenI algorithm, there is nothing-which distinguishes the category from any other attributes.  But for some-other uses, such as checking if it is a result or for display purposes, we-do treat this attribute differently.  We take here the convention that the-category of a node is associated to the attribute ``cat''.-\begin{code}--- | Return the value of the "cat" attribute, if available-gCategory :: Flist -> Maybe GeniVal-gCategory top =-  case [ v | AvPair "cat" v <- top ] of-  []  -> Nothing-  [c] -> Just c-  _   -> geniBug $ "Impossible case: node with more than one category"-\end{code}--A TAG node might also have a lexeme.  If we are lucky, this is explicitly-set in the glexeme field of the node.  Otherwise, we try to guess it from-a list of distinguished attributes (in order of preference).-\begin{code}--- | Attributes recognised as lexemes, in order of preference-lexemeAttributes :: [String]-lexemeAttributes = [ "lex", "phon", "cat" ]-\end{code}--\paragraph{show (GNode)} the default show for GNode tries to-be very compact; it only shows the value for cat attribute-and any flags which are marked on that node.--\begin{code}-instance Show GNode where-  show gn =-    let cat_ = case gCategory.gup $ gn of-               Nothing -> []-               Just c  -> show c-        lex_ = showLexeme $ glexeme gn-        ---        stub = concat $ intersperse ":" $ filter (not.null) [ cat_, lex_ ]-        extra = case (gtype gn) of-                   Subs -> " !"-                   Foot -> " *"-                   _    -> if (gaconstr gn)  then " #"   else ""-    in stub ++ extra---- FIXME: will have to think of nicer way - one which involves--- unpacking the trees :-(-showLexeme :: [String] -> String-showLexeme []   = ""-showLexeme [l]  = l-showLexeme xs   = concat $ intersperse "|" xs-\end{code}--A Replacement on a GNode consists of replacements on its top and bottom-feature structures--\begin{code}-instance DescendGeniVal GNode where-  descendGeniVal s gn =-    gn { gup = descendGeniVal s (gup gn)-       , gdown = descendGeniVal s (gdown gn) }-\end{code}--% -----------------------------------------------------------------------\section{Tree manipulation}-% ------------------------------------------------------------------------\begin{code}-root :: Tree a -> a-root (Node a _) = a--rootUpd :: Tree a -> a -> Tree a-rootUpd (Node _ l) b = (Node b l)--foot :: Tree GNode -> GNode-foot t = case filterTree (\n -> gtype n == Foot) t of-         [x] -> x-         _   -> geniBug $ "foot returned weird result"-\end{code}--\begin{code}--- | Given a lexical item @s@ and a Tree GNode t, returns the tree t'---   where l has been assigned to the anchor node in t'-setAnchor :: [String] -> Tree GNode -> Tree GNode-setAnchor s t =-  let filt (Node a []) = (gtype a == Lex && ganchor a)-      filt _ = False-  in case listRepNode (setLexeme s) filt [t] of-     ([r],True) -> r-     _ -> geniBug $ "setLexeme " ++ show s ++ " returned weird result"---- | Given a lexical item @l@ and a tree node @n@ (actually a subtree---   with no children), return the same node with the lexical item as---   its unique child.  The idea is that it converts terminal lexeme nodes---   into preterminal nodes where the actual terminal is the given lexical---   item-setLexeme :: [String] -> Tree GNode -> Tree GNode-setLexeme l (Node a []) = Node a [ Node subanc [] ]-  where subanc = emptyGNode { gnname = '_' : ((gnname a) ++ ('.' : (concat l)))-                            , gaconstr = True-                            , glexeme = l}-setLexeme _ _ = geniBug "impossible case in setLexeme - subtree with kids"-\end{code}--\subsection{Substitution and Adjunction}--This module handles just the tree-cutting aspects of TAG substitution and-adjunction.  We do substitution with a very general \fnreflite{plugTree}-function, whose only job is to plug two trees together at a specified node.-Note that this function is also used to implement adjunction.--\begin{code}--- | Plug the first tree into the second tree at the specified node.---   Anything below the second node is silently discarded.---   We assume the trees are pluggable; it is treated as a bug if---   they are not!-plugTree :: Tree NodeName -> NodeName -> Tree NodeName -> Tree NodeName-plugTree male n female =-  case listRepNode (const male) (nmatch n) [female] of-  ([r], True) -> r-  _           -> geniBug $ "unexpected plug failure at node " ++ n---- | Given two trees 'auxt' and 't', splice the tree 'auxt' into---   't' via the TAG adjunction rule.-spliceTree :: NodeName      -- ^ foot node of the aux tree-           -> Tree NodeName -- ^ aux tree-           -> NodeName      -- ^ place to adjoin in target tree-           -> Tree NodeName -- ^ target tree-           -> Tree NodeName-spliceTree f auxT n targetT =-  case findSubTree n targetT of -- excise the subtree at n-  Nothing -> geniBug $ "Unexpected adjunction failure. " ++-                       "Could not find node " ++ n ++ " of target tree."-  Just eT -> -- plug the excised bit into the aux-             let auxPlus = plugTree eT f auxT-             -- plug the augmented aux at n-             in  plugTree auxPlus n targetT--nmatch :: NodeName -> Tree NodeName -> Bool-nmatch n (Node a _) = a == n--findSubTree :: NodeName -> Tree NodeName -> Maybe (Tree NodeName)-findSubTree n n2@(Node x ks)-  | x == n    = Just n2-  | otherwise = case mapMaybe (findSubTree n) ks of-                []    -> Nothing-                (h:_) -> Just h-\end{code}--% -----------------------------------------------------------------------\section{Features and variables}-% ------------------------------------------------------------------------\begin{code}-type Flist   = [AvPair]-data AvPair  = AvPair { avAtt :: String-                      , avVal ::  GeniVal }-  deriving (Ord, Eq, Data, Typeable)--instance Biplate AvPair GeniVal where-  biplate (AvPair a v) = plate AvPair |- a |* v-\end{code}--\subsection{Collectable}--A Collectable is something which can return its variables as a set.-By variables, what I most had in mind was the GVar values in a-GeniVal.  This notion is probably not very useful outside the context of-alpha-conversion task, but it seems general enough that I'll keep it-around for a good bit, until either some use for it creeps up, or I find-a more general notion that I can transform this into.--\begin{code}-class Collectable a where-  collect :: a -> Set.Set String -> Set.Set String--instance Collectable a => Collectable (Maybe a) where-  collect Nothing  s = s-  collect (Just x) s = collect x s--instance (Collectable a => Collectable [a]) where-  collect l s = foldr collect s l--instance (Collectable a => Collectable (Tree a)) where-  collect = collect.flatten---- Pred is what I had in mind here-instance ((Collectable a, Collectable b, Collectable c)-           => Collectable (a,b,c)) where-  collect (a,b,c) = collect a . collect b . collect c--instance Collectable GeniVal where-  collect (GVar v) s = Set.insert v s-  collect _ s = s--instance Collectable AvPair where-  collect (AvPair _ b) = collect b--instance Collectable GNode where-  collect n = (collect $ gdown n) . (collect $ gup n)-\end{code}--\subsection{DescendGeniVal}-\label{sec:replacable}-\label{sec:replacements}--The idea of replacing one variable value with another is something that-appears all over the place in GenI.  So we try to smooth out its use by-making a type class out of it.--\begin{code}--\end{code}--Substitution on list consists of performing substitution on-each item.  Each item, is independent of the other,-of course.--\begin{code}-instance DescendGeniVal a => DescendGeniVal (Map.Map k a) where-  descendGeniVal s = {-# SCC "descendGeniVal" #-} Map.map (descendGeniVal s)--instance DescendGeniVal AvPair where-  descendGeniVal s (AvPair a v) = {-# SCC "descendGeniVal" #-} AvPair a (descendGeniVal s v)--instance DescendGeniVal a => DescendGeniVal (String, a) where-  descendGeniVal s (n,v) = {-# SCC "descendGeniVal" #-} (n,descendGeniVal s v)--instance DescendGeniVal ([String], Flist) where-  descendGeniVal s (a,v) = {-# SCC "descendGeniVal" #-} (a, descendGeniVal s v)-\end{code}--\subsection{Idable}--\begin{code}--- | An Idable is something that can be mapped to a unique id.---   You might consider using this to implement Ord, but I won't.---   Note that the only use I have for this so far (20 dec 2005)---  is in alpha-conversion.-class Idable a where-  idOf :: a -> Integer-\end{code}--\subsection{Other feature and variable stuff}--Our approach to $\alpha$-conversion works by appending a unique suffix-to all variables in an object.  See section \ref{sec:fs_unification} for-why we want this.--\begin{code}-alphaConvertById :: (Collectable a, DescendGeniVal a, Idable a) => a -> a-alphaConvertById x = {-# SCC "alphaConvertById" #-}-  alphaConvert ('-' : (show . idOf $ x)) x--alphaConvert :: (Collectable a, DescendGeniVal a) => String -> a -> a-alphaConvert suffix x = {-# SCC "alphaConvert" #-}-  let vars   = Set.elems $ collect x Set.empty-      convert v = GVar (v ++ suffix)-      subst = Map.fromList $ map (\v -> (v, convert v)) vars-  in replace subst x-\end{code}--\begin{code}--- | Sort an Flist according with its attributes-sortFlist :: Flist -> Flist-sortFlist = sortBy (compare `on` avAtt)--showFlist :: Flist -> String-showFlist f = "[" ++ showPairs f ++ "]"--showPairs :: Flist -> String-showPairs = unwords . map showAv--showAv :: AvPair -> String-showAv (AvPair y z) = y ++ ":" ++ show z--instance Show AvPair where-  show = showAv-\end{code}--% -----------------------------------------------------------------------\section{Semantics}-\label{btypes_semantics}-% ------------------------------------------------------------------------\begin{code}--- handle, predicate, parameters-type Pred = (GeniVal, GeniVal, [GeniVal])-type Sem = [Pred]-type LitConstr = (Pred, [String])-type SemInput  = (Sem,Flist,[LitConstr])--instance Biplate Pred GeniVal where-  biplate (g1, g2, g3) = plate (,,) |* g1 |* g2 ||* g3--instance Biplate (Maybe Sem) GeniVal where-  biplate (Just s) = plate Just ||+ s-  biplate Nothing  = plate Nothing--data TestCase = TestCase-       { tcName :: String-       , tcSemString :: String -- ^ for gui-       , tcSem  :: SemInput-       , tcExpected :: [String] -- ^ expected results (for testing)-       , tcOutputs :: [(String, Map.Map (String,String) [String])]-       -- ^ results we actually got, and their traces (for testing)-       } deriving Show--emptyPred :: Pred-emptyPred = (GAnon,GAnon,[])-\end{code}--A replacement on a predicate is just a replacement on its parameters--\begin{code}-instance DescendGeniVal Pred where-  descendGeniVal s (h, n, lp) = (descendGeniVal s h, descendGeniVal s n, descendGeniVal s lp)-\end{code}--\begin{code}-showSem :: Sem -> String-showSem l =-    "[" ++ (unwords $ map showPred l) ++ "]"--showPred :: Pred -> String-showPred (h, p, l) = showh ++ show p ++ "(" ++ unwords (map show l) ++ ")"-  where-    hideh (GConst [x]) = "genihandle" `isPrefixOf` x-    hideh _ = False-    ---    showh = if (hideh h) then "" else (show h) ++ ":"-\end{code}--\begin{code}--- | Given a Semantics, return the string with the proper keys---   (propsymbol+arity) to access the agenda-toKeys :: Sem -> [String]-toKeys l = map (\(_,prop,par) -> show prop ++ (show $ length par)) l-\end{code}--\subsection{Semantic subsumption}-\label{fn:subsumeSem}--FIXME: comment fix--Given tsem the input semantics, and lsem the semantics of a potential-lexical candidate, returns a list of possible ways that the lexical-semantics could subsume the input semantics.  We return a pair with-the semantics that would result from unification\footnote{We need to-do this because there may be anonymous variables}, and the-substitutions that need to be propagated throughout the rest of the-lexical item later on.--Note: we return more than one possible substitution because s could be-different subsets of ts.  Consider, for example, \semexpr{love(j,m),-  name(j,john), name(m,mary)} and the candidate \semexpr{name(X,Y)}.--TODO WE ASSUME BOTH SEMANTICS ARE ORDERED and that the input semantics is-non-empty.--\begin{code}-subsumeSem :: Sem -> Sem -> [(Sem,Subst)]-subsumeSem tsem lsem =-  subsumeSemHelper ([],Map.empty) (reverse tsem) (reverse lsem)-\end{code}--This is tricky because each substep returns multiple results.  We solicit-the help of accumulators to keep things from getting confused.--\begin{code}-subsumeSemHelper :: (Sem,Subst) -> Sem -> Sem -> [(Sem,Subst)]-subsumeSemHelper _ [] _  =-  error "input semantics is non-empty in subsumeSemHelper"-subsumeSemHelper acc _ []      = [acc]-subsumeSemHelper acc tsem (hd:tl) =-  let (accSem,accSub) = acc-      -- does the literal hd subsume the input semantics?-      pRes = subsumePred tsem hd-      -- toPred reconstructs the literal hd with new parameters p.-      -- The head of the list is taken to be the handle.-      toPred p = (head p, snd3 hd, tail p)-      -- next adds a result from predication subsumption to-      -- the accumulators and goes to the next recursive step-      next (p,s) = subsumeSemHelper acc2 tsem2 tl2-         where tl2   = replace s tl-               tsem2 = replace s tsem-               acc2  = (toPred p : accSem, mergeSubst accSub s)-  in concatMap next pRes-\end{code}--\fnlabel{subsumePred}-The first Sem s1 and second Sem s2 are the same when we start we circle on s2-looking for a match for Pred, and meanwhile we apply the partical substitutions-to s1.  Note: we treat the handle as if it were a parameter.--\begin{code}-subsumePred :: Sem -> Pred -> [([GeniVal],Subst)]-subsumePred [] _ = []-subsumePred ((h1, p1, la1):l) (pred2@(h2,p2,la2)) =-    -- if we found the proper predicate-    if ((p1 == p2) && (length la1 == length la2))-    then let mrs  = unify (h1:la1) (h2:la2)-             next = subsumePred l pred2-         in maybe next (:next) mrs-    else if (p1 < p2) -- note that the semantics have to be reversed!-         then []-         else subsumePred l pred2-\end{code}--\subsection{Other semantic stuff}--\begin{code}--- | Sort semantics first according to its predicate, and then to its handles.-sortSem :: Sem -> Sem-sortSem = sortBy (\(h1,p1,a1) (h2,p2,a2) -> compare (p1, h1:a1) (p2, h2:a2))-\end{code}--% ---------------------------------------------------------------------\subsection{Feature structure unification}-\label{sec:fs_unification}-% ----------------------------------------------------------------------Feature structure unification takes two feature lists as input.  If it-fails, it returns Nothing.  Otherwise, it returns a tuple with:--\begin{enumerate}-\item a unified feature structure list-\item a list of variable replacements that will need to be propagated-      across other feature structures with the same variables-\end{enumerate}--Unification fails if, at any point during the unification process, the-two lists have different constant values for the same attribute.-For example, unification fails on the following inputs because they have-different values for the \textit{number} attribute:--\begin{quotation}-\fs{\it cat:np\\ \it number:3\\}-\fs{\it cat:np\\ \it number:2\\}-\end{quotation}--Note that the following input should also fail as a result on the-coreference on \textit{?X}.--\begin{quotation}-\fs{\it cat:np\\ \it one: 1\\  \it two:2\\}-\fs{\it cat:np\\ \it one: ?X\\ \it two:?X\\}-\end{quotation}--On the other hand, any other pair of feature lists should unify-succesfully, even those that do not share the same attributes.-Below are some examples of successful unifications:--\begin{quotation}-\fs{\it cat:np\\ \it one: 1\\  \it two:2\\}-\fs{\it cat:np\\ \it one: ?X\\ \it two:?Y\\}-$\rightarrow$-\fs{\it cat:np\\ \it one: 1\\ \it two:2\\},-\end{quotation}--\begin{quotation}-\fs{\it cat:np\\ \it number:3\\}-\fs{\it cat:np\\ \it case:nom\\}-$\rightarrow$-\fs{\it cat:np\\ \it case:nom\\ \it number:3\\},-\end{quotation}--\begin{code}--- | 'unifyFeat' performs feature structure unification, under the---   these assumptions about the input:------    * Features are ordered------    * The Flists do not share variables (renaming has already---      been done.------   The features are allowed to have different sets of attributes,---   beacuse we use 'alignFeat' to realign them.-unifyFeat :: Monad m => Flist -> Flist -> m (Flist, Subst)-unifyFeat f1 f2 =-  {-# SCC "unification" #-}-  let (att, val1, val2) = unzip3 $ alignFeat f1 f2-  in att `seq`-     do (res, subst) <- unify val1 val2-        return (zipWith AvPair att res, subst)---- | 'alignFeat' is a pre-procesing step used to ensure that feature structures---   have the same set of keys.  If a key is missing in one, we copy it to the---   other with an anonymous value.------   The two feature structures must be sorted for this to work-alignFeat :: Flist -> Flist -> [(String,GeniVal,GeniVal)]-alignFeat f1 f2 = alignFeatH f1 f2 []--alignFeatH :: Flist -> Flist -> [(String,GeniVal,GeniVal)] -> [(String,GeniVal,GeniVal)]-alignFeatH [] [] acc = reverse acc-alignFeatH [] (AvPair f v :x) acc = alignFeatH [] x ((f,GAnon,v) : acc)-alignFeatH x [] acc = alignFeatH [] x acc-alignFeatH fs1@(AvPair f1 v1:l1) fs2@(AvPair f2 v2:l2) acc =-   case compare f1 f2 of-     EQ -> alignFeatH l1 l2  ((f1, v1, v2) : acc)-     LT -> alignFeatH l1 fs2 ((f1, v1, GAnon) : acc)-     GT -> alignFeatH fs1 l2 ((f2, GAnon, v2) : acc)-\end{code}--