Peter Ljunglöf

Here is a proposed algorithm ### 1. (Manually) Decide which parameters should be merged In this example we want to merge `Sg` and `Pl`... ``` param Num = Sg |...

The example grammar: ``` abstract Mini = { cat S; VP; NP; Verb; Det; Noun; fun mkS : NP -> VP -> S; mkVP : Verb -> NP -> VP;...

Here is a larger example that I want to be able to handle. The grammar is `ExemplumSwe` from here: https://github.com/MUSTE-Project/MULLE/tree/develop/examples/grammars/exemplum The grammar currently accepts the following examples: - en stor...

Aren't you discussing two different problems here? In Krasimir's example the problem is record subtyping ({s,g,n} vs {g,n}). But in Herbert's and Thomas' examples, the problem is using an abstract...

1. Thanks, I'll look into that! 2. Yes, but then the problem is the maximum edit distance parameter: I would like this parameter to be the true weighted cost, otherwise...

Here is a suggestion of such a list (not including all RGL files), with 4 different priorities (`+++`, `++`, `+`, `-`). I'm sure that the priorities can be discussed, and...

Some thoughts by @krangelov, from the GF mailing list: > I think the frequencies are just the first guideline. The functions should be grouped in sets. I would start with...

Reflections by @aarneranta, from the GF mailing list: > ComplSlash and SlashV2a are also important. With them, the grammarian has to decide about (1) the S-V-O order (2) the NP...

@inariksit 's GFTest would be good to use here, but that will involve more work to set up

I like your suggestion. Should the examples also specify the top-level category or just assume the default one? (Which is `Utt`, right?) Perhaps the first line in each example should...