- From: Christian Chiarcos <christian.chiarcos@web.de>
- Date: Mon, 01 Jul 2019 15:07:10 +0200
- To: klimek@informatik.uni-leipzig.de, "Fahad Khan" <anasfkhan81@gmail.com>
- Cc: public-ontolex <public-ontolex@w3.org>
- Message-ID: <op.z382p8wqbr5td5@kitaba>
Dear Fahad, thanks a lot for this update. In fact, it ties in quite neatly with other approaches on parsing with SWRL/RIF, e.g., Graham Wilcock HPSG parser. On the other hand, we should keep in mind that Wilcock basically failed (not in terms of expressivity or performance, but in terms of adaptation by the community) and he himself thus abandoned the idea. So, while we *should* mention that rules can be implemented in this way (in terms or SW technology, this is the "right" way of implementing rules), I don't think we should prescribe SWRL nor RIF. This is for two reasons: On a technological level, RIF is a high-level technology, operating on top of OWL, so its proper handling requires a lot of expertise by the user and is technically demanding. I'm not sure about the popularity of either RIF or OWL beyond the core Semantic Web community anymore, whereas plain RDF is relatively widely used. On a conceptual level, the dominating paradigm in morphology generation are finite state transducers, and these can be reduced to regular expressions, and as we have native support for regex in SPARQL Update, SWRL and most programming languages, this would be more generic and come with a lower entry barrier. But then, regular expressions must also not be the only way to populate a paradigm (resp., a particular inflection type), as many lexicographers and linguists will find this too technical and prefer to provide representative examples rather than concrete rules -- and our modelling should cover both uses. Just my 2ct, Christian PS: I see drawbacks of the regex idea, too, in particular in that it is string-based rather than concept-based. PPS: A compromise could be to use the swrlb:replace to write transformation rules with regular expressions. However, the SWRL serialization in Turtle is close to a nightmare (because its bindings are internally represented by lists), and we should probably use TTL for illustrative examples. I doubt we could convincingly sell this to anyone. Am .07.2019, 12:13 Uhr, schrieb Fahad Khan <anasfkhan81@gmail.com>: > Hi Bettina, All,Here is the poster I presented at Euralex last year > which I mentioned in the last telco and which describes the approach we > took to modelling Italian >morphology using SWRL: > https://docs.google.com/presentation/d/1pHt8IG0ni5x9AkoPCsCCccRPEFIeObW7eR-PxY1JN7A/edit?usp=sharing > Cheers,Fahad > > On Tue, 25 Jun 2019 at 12:12, Bettina Klimek > <klimek@informatik.uni-leipzig.de> wrote: >> Hi all, >> >> this is the link to the telco today at 1pm CEST: >> >> https://hangouts.google.com/call/UNgLuAFv3BfDfX7P5x8EAEEI >> >> We will continue to discuss the modelling of morphological patterns and >> paradigms. >> >> Regards, >> >> Bettina >> >> --Bettina Klimek >> PhD Student >> Department of Computer Science, University of Leipzig >> Institute for Applied Informatics (InfAI) >> Goerdelerring 9 >> 04109 Leipzig >> >> Research Group: http://aksw.org/Groups/KILT >> Homepage: http://aksw.org/BettinaKlimek >> Projects: http://mmoon.org, http://linguistics.okfn.org >> Events: 12 -17 May 2019 "3rd Summer Datathon on Linguistic Linked Open >> Data (SD-LLOD 2019)" >> https://datathon2019.linguistic-lod.org/ >> 20-22 May 2019 "LDK 2019 – 2nd Conference on Language, Data >> and Knowledge" >> http://2019.ldk-conf.org/
Received on Monday, 1 July 2019 13:07:36 UTC