| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2016-06-15 | added a default value in dependency visualization for cases using maximum, ↵ | aarne | |
| to cover the case where the list of arcs is empty | |||
| 2016-06-09 | PGF service & minibar: only show dependency diagrams if the labels are known | hallgren | |
| + The PGF service now reads and caches dependency label configuration files. + The grammar info returned by command=grammar has a new boolean field 'hasDependencyLabels' to indicate if dependency labels were found for the grammar. Also, command=deptree will now fail if no labels are present. + The minibar only shows word dependency trees if labels are present. + Also changed the type of getDepLabels from [String] -> Labels to String -> Labels, since all uses were in the form "getDepLabels . lines". | |||
| 2016-06-08 | PGF.VisualizeTree: add white background in the SVG rendering of dependency trees | hallgren | |
| This makes them look the same as SVG produced by graphviz | |||
| 2016-06-08 | PGF.VisualizeTree: add SVG renderering of word dependency trees | hallgren | |
| This was done by introducing an intermediate representation for the LaTeX pictures produced by the LaTeX renderer and providing a new backend that outputs SVG instead of LaTeX. | |||
| 2016-06-03 | vd latex: some adjustments in heights and lengths | aarne | |
| 2016-06-02 | vd: arc heights now depend on number of arcs below rather than word distance | aarne | |
| 2016-05-26 | Add haddock documentation to PGF.graphvizDependencyTree and PGF.getDepLabels | hallgren | |
| They seemed very difficult to use without the documentation, since their types are not particularly self documenting. Also documented what the (Bool,Bool) argument to PGF.graphvizAbstractTree is for. | |||
| 2016-05-26 | Fix documentation typo on PGF.Haskell | hallgren | |
| 2016-05-23 | made the word length proportionate in dependency visualization, instead of ↵ | aarne | |
| using the max length for every word | |||
| 2016-02-23 | add forgotten file src/runtime/haskell/PGF/LexingAGreek.hs | leiss | |
| 2015-11-23 | vd -conll2latex now converts conll to latex. Without going through GF trees, ↵ | aarne | |
| but as a service to the dependency parser community. | |||
| 2015-11-18 | reduced label size and optimized arc length in vd -output=latex | aarne | |
| 2015-11-17 | latex visualization of dep trees: explained the program better and ↵ | aarne | |
| eliminated most magic numbers | |||
| 2015-11-17 | added -output=latex to visialize_dependencies. This generates more ↵ | aarne | |
| familiar-looking output than the default graphviz, which can moreover be pasted into LaTeX documents. Some more work is needed to make long sentences look nice and fit on a page; a constant word length is now used to simplify computing the coordinates. | |||
| 2015-11-05 | vp -showdep: as default label for the first (incl. only) argument, don't use ↵ | aarne | |
| dep#0 but assume it is the head | |||
| 2015-11-05 | improved documentation of vp -showdep | aarne | |
| 2015-11-04 | dependency labels in parse trees now with the -deps flag, -file=labels_file ↵ | aarne | |
| for configuration. With -nocat option this shows reasonable dep trees, more familiar looking than the vd command. With -showfun flag, the tree gives a rather complete picture of the analysis of the sentence. | |||
| 2015-11-04 | prepared visualize_parse for showing dependency labels | aarne | |
| 2015-08-31 | GF.Infra.SIO: The SIO monad now supports putStr in addition to putStrLn | hallgren | |
| Also included some unrelated minor changes. | |||
| 2015-08-28 | Comment out some dead code found with -fwarn-unused-binds | hallgren | |
| Also fixed some warnings and tightened some imports | |||
| 2015-07-16 | added a space after the tag in word alignment to work around a graphviz bug ↵ | aarne | |
| shown with Chinese characters | |||
| 2015-06-23 | Bump version of .gfo and .pgf files, improve error messages on version mismatch | hallgren | |
| Becacuse of the new special tokens added to the Symbol type, .gfo and .pgf files produced with the current version of GF can not always be used with older versions of GF and the PGF run-time system. The PGF version number was increased from (2,0) to (2,1). GF can still read version (2,0) and (1,0), so old PGF files continue to work. The GFO version was increased from "GF03" to "GF04". | |||
| 2015-06-17 | forgot changes in the serialization in the Haskell runtime | krasimir | |
| 2015-06-11 | fixed typo in the Haskell runtime | krasimir | |
| 2015-05-11 | added all orthographic primitives | krasimir | |
| 2015-04-20 | drop the dependency to FST | krasimir | |
| 2015-02-16 | Restore compatibility with ghc-7.4 | hallgren | |
| With ghc-7.4 'import M hiding (x)' causes an error if M does not export x... | |||
| 2015-02-16 | Changes for compatibility with ghc-7.10-rc2 | hallgren | |
| 2 modules: Name clashes caused by Applicative-Monad change in Prelude 2 modules: Ambiguities caused by Foldable/Traversable in Prelude 2 modules: Backwards incompatible changes in time-1.5 for defaultTimeLocale 9 modules: {-# LANGUAGE FlexibleContexts #-} (because GHC checks inferred types now, in addition to explicitly given type signatures) Also silenced warnings about tab characters in source files. | |||
| 2015-02-12 | PGF.Haskell: adding operators for selections from tables | hallgren | |
| 2015-02-09 | Translating linearization functions to Haskell: support for variants | hallgren | |
| By adding the flag -haskell=variants to the command line, GF will now generate linearization functions in Haskell that support variants. Variants are represented as lists in Haskell. Variants inside pre { ... } expressions are still ignored. TODO: apply some monad laws to generate more compact code (using an intermediate representation of the generated Haskell code, instead of pretty printing directly from the GF code). | |||
| 2015-01-19 | Translating linearization functions to Haskell: move a common record type to ↵ | hallgren | |
| PGF.Haskell Move the Haskell representation of the common linearization type {s:T} to the shared module PGF.Haskell, so that the same overloaded projection function proj_s can be used for all concrete syntaxes. | |||
| 2015-01-14 | Translating linearization functions to Haskell: better treatment of special ↵ | hallgren | |
| tokens Common code has been lifted out from the generated Haskell modules to an auxiliary module PGF.Haskell, which is currently included in the regular PGF library, although it is independent of it and probably belongs in a separate library. The type Str used by linearization functions is now based on a token type Tok, which is defined in PGF.Haskell. PGF.Haskell.Tok is similar to the type GF.Data.Str.Tok, but it has constructors for the special tokens BIND, SOFT_BIND and CAPIT, and there is a function fromStr :: Str -> String that computes the effects of these special tokens. | |||
| 2014-10-31 | now (+) in the abstract syntax works, i.e. it knows how to deal with partial ↵ | kr.angelov | |
| sums | |||
| 2014-10-30 | a more efficient tail call by using the new TUCK instruction | kr.angelov | |
| 2014-10-26 | an explicit SAVE instruction | kr.angelov | |
| 2014-10-22 | an explicit PUSH_FRAME instruction | kr.angelov | |
| 2014-10-19 | (un)lexmixed: added the other math environments than $ used in latex | aarne | |
| 2014-10-17 | one general case in dealing with backslash in latex lexing is enough | aarne | |
| 2014-10-17 | unlexing latex code: no space between closing $ and punctuation | aarne | |
| 2014-10-17 | lexer for latex code: don't separate backslash from the macro name that it marks | aarne | |
| 2014-10-16 | finally proper stack unwind in the evaluator | kr.angelov | |
| 2014-10-14 | the compiler now allows + to be used as a floating point addition in the ↵ | kr.angelov | |
| abstract syntax | |||
| 2014-10-09 | Prelude.CAPIT is now a built-in primitive. It still generates &| in the ↵ | kr.angelov | |
| Haskell runtime but will be intepreted in the C runtime | |||
| 2014-10-06 | using instruction RET was wrong; now use EVAL | kr.angelov | |
| 2014-09-29 | bugfix in the pattern matching compiler and a number of other fixes that I ↵ | kr.angelov | |
| somehow did not push before | |||
| 2014-09-11 | a major revision of the bytecode generator and JIT compiler. the effect is ↵ | kr.angelov | |
| that now we can compute with lambda functions and with true tail recursion | |||
| 2014-09-05 | the code for def rules now uses proper graph update to preserve lazyness | kr.angelov | |
| 2014-09-05 | full support for recursive def rules in the C runtime | kr.angelov | |
| 2014-09-01 | partial implementation for recursive def rules | kr.angelov | |
| 2014-08-13 | Fix warnings in 16 modules, mostly forward compatibility warnings from GHC 7.8 | hallgren | |
 |
index : gf-core.git | |
| Unnamed repository; edit this file 'description' to name the repository. | Adrian |
| summaryrefslogtreecommitdiff |