ParSem

parsem@mailman.uni-konstanz.de

13 discussions

Jürgen Wedekind RIP
by Josef van Genabith 29 Dec '21

29 Dec '21

Jürgen Wedekind RIP It is with great sadness that we hear about the passing of Jürgen Wedekind (1956-2021). Jürgen made seminal contributions to LFG and unification-based grammars, including the use of classical logics in describing feature-based grammars, properties of machine translation and complexity and decidability of generation with feature-based grammars, with a string of publications in the journal of Computational Linguistics (1999, 2012, 2014 and 2020). Jürgen was our colleague at IMS, University of Stuttgart, Germany (1985-1996), a research scientist at the University of Tübingen, Germany (1996-1999), a senior researcher and graduate course director at the Center for Language Technology and the University of Copenhagen, Denmark (1999-2021) and a frequent visiting scholar and consultant at XEROX PARC, California. Jürgen obtained his PhD in 1990, and his Habilitation in 1998. We miss Jürgen as a colleague and a friend. We share our sorrow with Jürgen's family. Anette, Thierry and Josef

1 0

restarting ParGram?
by Agnieszka Patejuk 28 Aug '21

28 Aug '21

Hi, I am sending this message to all potentially relevant lists (ParGram, XLE, LFG, ParSem) so as to maximise the chance that it will reach people who are interested in this topic. If you know someone who might be interested but is not subscribed to these lists, please consider letting them know. The question is: who would be interested in restarting ParGram meetings? I am not sure what would be the best way to organise this discussion, so I am suggesting the following: • if you think your answer might be of interest to many people (for instance, it might spark a discussion), please consider replying to the list(s) • if not, please reply only to me – I will later go through the responses and post a summary to the relevant lists. I hope that later we can discuss this topic in more detail with people who have expressed interest. All best, Agnieszka

10 17

lists working?
by Agnieszka Patejuk 28 Jul '21

28 Jul '21

Hi, I just wanted to check whether these lists are still working – I very much hope so! :-) All best, Agnieszka

1 0

Spring ParGram Meeting 2014
by Sebastian Sulger 03 Aug '15

03 Aug '15

Hi, At this year's ParGram meeting, we decided we should have 2 meetings in 2014 (spring and fall). Regarding the spring meeting, Ron Kaplan has volunteered to host it at Nuance in California. To find a suitable date, I created a Doodle poll which you can find here: http://doodle.com/niwz4hgptcn3rpsr Please participate in the poll so that we can find a date that suits most of us. By the way: This will be a special occasion since we will be celebrating 20 years of ParGram! Cheers, Jani -- Sebastian Sulger FB Sprachwissenschaft Universität Konstanz http://ling.uni-konstanz.de/pages/home/sulger

3 3

request to distribute
by Annie Zaenen 29 Jun '15

29 Jun '15

Call for Papers (Special Issue) Grammar Engineering: Precision Grammars Precision grammars are encodings of linguistic knowledge in a representation that is both interpretable by humans and and usable in parsers and sentence generators, which aim to handle rare constructions as well as the more common ones. LiLT solicits papers for a special issue on precision grammars, with a particular interest in the following topics: * Mixed or hybrid models of statistical and precision grammars * Gradient grammaticality in precision grammars * The use of machine learning and treebanks in creating precision grammars * Parsing evaluation metrics that focus on evaluating the coverage of rare phenomena * Applications that show the importance/advantages of precision grammars; * Handling of cross linguistic generalizations and typological information in multi-lingual projects * Precision grammar projects on less-studied languages The deadline for submissions is: October 31, 2015 Submissions should be sent to azaenen(a)stanford.edu <mailto:azaenen@stanford.edu> There is no special format required for submissions but accepted papers need to be submitted in LATEX. The editorial board for this issue is consists of Doug Arnold (University of Essex), Emily Bender (University of Washington), Philippe Blache (Aix Marseille Université), Gerlof Bouma (University of Gothenburg) , Gosse Bouma (University of Groningen), Miriam Butt (University of Konstanz), Eric De La Clergerie (INRIA), Dan Flickinger (Stanford University), Jan Hajič (Charles University of Prague), Julia Hockenmaier (University of Illinois at Urbana-Champaign), Ron Kaplan (Nuance), Tracy Holloway King (Ebay), Lori Levin (Carnegie Mellon University), Detmar Meurers (University of Tübingen), Joakim Nivre (Uppsala University), Aarne Ranta (Chalmers University), Stephan Oepen (University of Oslo), Adam Przepiórkowski (Polish Academy of Sciences), Laura Rimell (Cambridge University), Victoria Rosén (University of Bergen), Louisa Sadler (University of Essex), Mark Steedman (Edinburgh University), Gertjan van Noord (University of Groningen), Annie Zaenen (Stanford University).

1 0

Spring 2015 PARGRAM meeting – 2-4 February 2015 (INESS workshop 5-6 February), Warsaw
by Adam Przepiorkowski 06 Oct '14

06 Oct '14

Dear All, The next PARGRAM meeting will be hosted during the week of 2–6 February 2015 by the Linguistic Engineering Group at the Institute of Computer Science, Polish Academy of Sciences, at its location (ul. Jana Kazimierza 5, Warszawa, Poland). The programme will appear in due course at the following web page, which already contains some more information: http://pargram.b.uib.no/meetings/spring-2015-meeting-in-warsaw/ Please write to Miriam (miriam.butt(a)uni-konstanz.de) and myself (adamp(a)ipipan.waw.pl) with suggestions of topics to be discussed. Please write to me (adamp(a)ipipan.waw.pl) as soon as possible if you intend to take part in the meeting – this is not binding for you but will help us reserve an appropriate room. All best, Adam P. -- Adam Przepiórkowski ˈadam ˌpʃɛpjurˈkɔfskʲi http://clip.ipipan.waw.pl/ ____ Computational Linguistics in Poland http://jlm.ipipan.waw.pl/ ___________ Journal of Language Modelling http://zil.ipipan.waw.pl/ ____________ Linguistic Engineering Group http://nkjp.pl/ _________________________ National Corpus of Polish

1 0

ParGram Sentences Reminder
by Sebastian Sulger 19 Feb '14

19 Feb '14

Hi, We would like to remind all of you to consider parsing the new set of ParGram sentences. Even if you cannot come to the Spring ParGram meeting, it would still be great if you could continue to support ParGram and ParGramBank by submitting your parses. The submission procedure is easy: - translate the sentences to your language; - gloss them and put them in a LaTeX file (use the attached Debrecen handout as a guideline; use the Leipzig Glossing Rules); - parse them; - (opt. disambiguate them); - save the c- and f-structures to eps files; - send the eps files as well as the LaTeX file to me. The plan is to add the sentences to ParGramBank (accessible on INESS: http://iness.uib.no/iness/main-page) after the meeting, i.e. after we have ensured parallelism. Miriam also provided the following notes on the sentences: ---------------------------------- "Also note that the sentences cover three things: 1) Negation -- this was decided on at the last meeting in Debrecen and Gyuri has kindly provided the sentences. 2) Possession --- this is something Jani is interested in and he provided the sentences. 3) The first four sentences of "The Gruffalo". A must read for anybody above 2 years of age. For categories 1 and 2 -- let us know if you have trouble translating them into your language. One of the issues with ParGramBank is that we need to have sentences that are comparable and there are some tough issues about what it means to be comparable (also discussed at the last meeting in Debrecen). We presumably cannot always ensure full comparability, but we can try to make sure that we aren't introducing silly extras that make things non-parallel and that could have been avoided." ---------------------------------- I'm sure that ParGramBank has the potential to grow and provide enough potential for a lot of further research into cross-linguistic treebanking (see, for example, the email by Lori Levin the other day). Best, Jani -- Sebastian Sulger FB Sprachwissenschaft Universität Konstanz http://ling.uni-konstanz.de/pages/home/sulger

1 1

semantic roles for LFG grammar engineering
by Adam Przepiorkowski 03 Feb '14

03 Feb '14

Dear All, [Apologies for cross-posting.] In the context of enriching the Polish LFG grammar with semantic representation, we are looking for a set of semantic roles (Agent, Patient, Beneficiary, etc.) that could be used to mark arguments (and possibly adjuncts) of verbs and other predicates. This set should be exhaustive in the sense that it should be possible to assign – more or less deterministically – a semantic role to any argument (and possibly adjunct) of any predicate. For this reason the standard – in LFG textbooks – sets of some 7 semantic roles do not seem sufficient. Instead, we are looking at larger repertoires proposed in VerbNet, in FrameNet and in John W. Sowa's work on Knowledge Representation. We don't have any strong views about any particular set of semantic roles, as long as it is exhaustive and applicable to real texts (as opposed to being merely theoretically interesting). Has anybody in the LFG community faced a similar task? If so, what set of semantic roles would you recommend? At the moment, we are wavering between VerbNet and Sowa's system, both being more manageable than numerous roles offered in FrameNet, but we are open to other solutions. Many thanks, best regards, Adam P. -- Adam Przepiórkowski ˈadam ˌpʃɛpjurˈkɔfskʲi http://clip.ipipan.waw.pl/ ____ Computational Linguistics in Poland http://jlm.ipipan.waw.pl/ ___________ Journal of Language Modelling http://zil.ipipan.waw.pl/ ____________ Linguistic Engineering Group http://nkjp.pl/ _________________________ National Corpus of Polish

4 3

ParGram sentences for upcoming meeting
by Sebastian Sulger 23 Jan '14

23 Jan '14

Hi, I attach the ParGram sentences for the upcoming ParGram meeting. If you would like to take part in the structure comparison, you should do the following: - translate the sentences to your language; - gloss them and put them in a LaTeX file (use the attached Debrecen handout as a guideline; use the Leipzig Glossing Rules); - parse them; - (opt. disambiguate them); - save the c- and f-structures to eps files; - send the eps files as well as the LaTeX file to me. I volunteer to compile the handout for the meeting. We will not have enough time to look at all 50 sentences in detail, so you are welcome to suggest sentences we can focus on. The plan is to add the sentences to the ParGram Parallel Treebank (accessible on INESS: http://iness.uib.no/iness/main-page) after the meeting, i.e. after we have ensured parallelism. Please let us know Best, Jani -- Sebastian Sulger FB Sprachwissenschaft Universität Konstanz http://ling.uni-konstanz.de/pages/home/sulger

3 3

fighting timeouts in XLE grammars?
by Agnieszka Patejuk 09 Oct '13

09 Oct '13

Dear all, We've been developing POLFIE, an LFG grammar of Polish, at ICS PAS for over 3 years. We'd like to concentrate on extending the empirical scope of the grammar, but we're having performance issues which affect the results quite badly. Currently we're testing the grammar on sentences extracted from Składnica, a treebank of Polish. There are 8333 sentences, average sentence length is 10 (all segments are counted, including punctuation). How are these sentences parsed? – an individual dictionary is created for each sentence (so the words are already disambiguated morphosyntactically) – each sentence is parsed on its own, in one XLE run. The following performance variables are used when parsing: – 100 seconds (set timeout 100) – 4096 MB memory (set max_xle_scratch_storage 4096). Current results (out of 8333 sentences): – parsed: 6926 – failed: 154 – out of memory: 11 – timeout: 1228 – unknown error: 14 Almost 15% of sentences are timed out, which is very worrying. The average length of a parsed sentence is almost 9 (8.74), while the average length of a timed out sentence is almost 19 (18.67). Have you had similar problems? Are you parsing real sentences, how long are your sentences? Do you have any suggestions what we could do so as to reduce the number of timed out sentences? Best, Agnieszka

6 8

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

ParSem