Zeitschriftenartikel: „Dependency Minimal Recursion Semantics“

1

Copestake, Ann, Dan Flickinger, Carl Pollard und Ivan A. Sag. „Minimal Recursion Semantics: An Introduction“. Research on Language and Computation 3, Nr. 2-3 (Juli 2005): 281–332. http://dx.doi.org/10.1007/s11168-006-6327-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Egg, M. „Wh-questions in underspecified minimal recursion semantics“. Journal of Semantics 15, Nr. 1 (01.02.1998): 37–82. http://dx.doi.org/10.1093/jos/15.1.37.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Jørgensen, Fredrik, und Jan Tore Lønning. „A Minimal Recursion Semantic Analysis of Locatives“. Computational Linguistics 35, Nr. 2 (Juni 2009): 229–70. http://dx.doi.org/10.1162/coli.06-69-prep5.

Der volle Inhalt der Quelle

Annotation:

The article describes a pilot implementation of a grammar containing different types of locative PPs. In particular, we investigate the distinction between static and directional locatives, and between different types of directional locatives. Locatives may act as modifiers as well as referring expressions depending on the syntactic context. We handle this with a single lexical entry. The implementation is of Norwegian locatives, but English locatives are both discussed and compared to Norwegian locatives. The semantic analysis is based on a proposal by Markus Kracht (2002), and we show how this analysis can be incorporated into Minimal Recursion Semantics (MRS) (Copestake et al. 2005). We discuss how the resulting system may be applied in a transfer-based machine translation system, and how we can map from a shallow MRS representation to a deeper semantic representation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Manshadi, Mehdi, Daniel Gildea und James F. Allen. „A Notion of Semantic Coherence for Underspecified Semantic Representation“. Computational Linguistics 44, Nr. 1 (März 2018): 39–83. http://dx.doi.org/10.1162/coli_a_00307.

Der volle Inhalt der Quelle

Annotation:

The general problem of finding satisfying solutions to constraint-based underspecified representations of quantifier scope is NP-complete. Existing frameworks, including Dominance Graphs, Minimal Recursion Semantics, and Hole Semantics, have struggled to balance expressivity and tractability in order to cover real natural language sentences with efficient algorithms. We address this trade-off with a general principle of coherence, which requires that every variable introduced in the domain of discourse must contribute to the overall semantics of the sentence. We show that every underspecified representation meeting this criterion can be efficiently processed, and that our set of representations subsumes all previously identified tractable sets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Yao, Xuchen, Gosse Bouma und Yi Zhang. „Semantics-based Question Generation and Implementation“. Dialogue & Discourse 3, Nr. 2 (16.03.2012): 11–42. http://dx.doi.org/10.5087/dad.2012.202.

Der volle Inhalt der Quelle

Annotation:

This paper presents a question generation system based on the approach of semantic rewriting. The state-of-the-art deep linguistic parsing and generation tools are employed to convert (back and forth) between the natural language sentences and their meaning representations in the form of Minimal Recursion Semantics (MRS). By carefully operating on the semantic structures, we show a principled way of generating questions without ad-hoc manipulation of the syntactic structures. Based on the (partial) understanding of the sentence meaning, the system generates questions which are semantically grounded and purposeful. And with the support of deep linguistic grammars, the grammaticality of the generation results is warranted. Further, with a specialized ranking model, the linguistic realizations from the general purpose generation model are further refined for our the question generation task. The evaluation results from QGSTEC2010 show promising prospects of the proposed approach.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Abo Khamis, Mahmoud, Hung Q. Ngo, Reinhard Pichler, Dan Suciu und Yisu Remy Wang. „Convergence of Datalog over (Pre-) Semirings“. ACM SIGMOD Record 52, Nr. 1 (07.06.2023): 75–82. http://dx.doi.org/10.1145/3604437.3604454.

Der volle Inhalt der Quelle

Annotation:

Recursive queries have been traditionally studied in the framework of datalog, a language that restricts recursion to monotone queries over sets, which is guaranteed to converge in polynomial time in the size of the input. But modern big data systems require recursive computations beyond the Boolean space. In this paper we study the convergence of datalog when it is interpreted over an arbitrary semiring. We consider an ordered semiring, define the semantics of a datalog program as a least fixpoint in this semiring, and study the number of steps required to reach that fixpoint, if ever. We identify algebraic properties of the semiring that correspond to certain convergence properties of datalog programs. Finally, we describe a class of ordered semirings on which one can generalize the semi-na¨ve evaluation algorithm to compute their minimal fixpoints.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Simov, Kiril, und Petya Osenova. „Special Thematic Section on Semantic Models for Natural Language Processing (Preface)“. Cybernetics and Information Technologies 18, Nr. 1 (01.03.2018): 93–94. http://dx.doi.org/10.2478/cait-2018-0008.

Der volle Inhalt der Quelle

Annotation:

Abstract With the availability of large language data online, cross-linked lexical resources (such as BabelNet, Predicate Matrix and UBY) and semantically annotated corpora (SemCor, OntoNotes, etc.), more and more applications in Natural Language Processing (NLP) have started to exploit various semantic models. The semantic models have been created on the base of LSA, clustering, word embeddings, deep learning, neural networks, etc., and abstract logical forms, such as Minimal Recursion Semantics (MRS) or Abstract Meaning Representation (AMR), etc. Additionally, the Linguistic Linked Open Data Cloud has been initiated (LLOD Cloud) which interlinks linguistic data for improving the tasks of NLP. This cloud has been expanding enormously for the last four-five years. It includes corpora, lexicons, thesauri, knowledge bases of various kinds, organized around appropriate ontologies, such as LEMON. The semantic models behind the data organization as well as the representation of the semantic resources themselves are a challenge to the NLP community. The NLP applications that extensively rely on the above discussed models include Machine Translation, Information Extraction, Question Answering, Text Simplification, etc.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

VOLIOTIS, C., N. M. SGOUROS und G. PAPAKONSTANTINOU. „ATTRIBUTE GRAMMAR BASED MODELING OF CONCURRENT CONSTRAINT LOGIC PROGRAMMING“. International Journal on Artificial Intelligence Tools 04, Nr. 03 (September 1995): 383–411. http://dx.doi.org/10.1142/s021821309500019x.

Der volle Inhalt der Quelle

Annotation:

The development of more powerful Concurrent Constraint Logic Programming (CCLP) languages depends largely on the development of environments that facilitate the specification and integration of constraints in the semantics of a logic program and automatically extract the inherent parallelism of Logic Programming. This paper presents a novel method for automating the parallel AND/OR execution of CCLP applications. This method consists of two stages. The first stage translates a logic program into an equivalent Attribute Grammar providing a common language in which the specifications of constraints and the semantics of a logic program can be expressed. The second stage evaluates this Attribute Grammar using MPAGE, a Multipass Parallel Attribute Grammar Evaluation algorithm. Support for the processing of constraints in the logic program is provided with the creation of a dependency graph between the variables of a logic rule during the first stage. Using this dependency graph MPAGE delays, if necessary, the evaluation of variables in a constraint until they become bound at some later point in processing. As a result our method supports rule representations in CLP languages with no restrictions on the ordering of subgoals. Furthermore, during execution MPAGE allows single rules in a CLP program to deal with multiple assignments of bindings, thus generating a minimal number of processes. Finally, this method is independent from the underlying hardware and its memory organization, therefore it can be implemented on both shared and distributed memory systems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Prokopaki-Kostopoulou, Nefeli, und Stasinos Konstantopoulos. „Optimizing within-distance queries by approximating shapes with maximal bounded boxes“. Open Research Europe 2 (09.05.2022): 57. http://dx.doi.org/10.12688/openreseurope.14321.1.

Der volle Inhalt der Quelle

Annotation:

Background: In geospatial query processing, spatial containment and intersection queries can be efficiently answered from the index. There is, however, a class of queries (such as within-distance) with a semantics that implies that every shape in the database is a potential match and should, in principle, be compared with the threshold. Naturally, this is impractical and optimizations have been developed that efficiently refine the set of candidate shapes before starting to actually compute distances and apply the threshold. In the case of the within-distance queries, many instances can be discarded in advance as too distant. Since geospatial databases organize data as a hierarchy of bounding boxes, this already provided the first direct optimization as the actual distance cannot be smaller than the distance between the bounding boxes. One can easily understand that there are shape configurations that give bounding boxes that are not very selective for near-by shapes. That is, configurations where there are shapes outside the requested distance but within the request distance from the bounding box. Methods: In this article, we investigate a further optimization in addition to and after comparing the bounding boxes, but before computing precise distances. We describe the distance optimizer operation currently used by PostGIS and show how the existing implementation prevails over approaches that use additional approximations. We implement a recursive algorithm to calculate the minimal possible largest inner rectangles of geometries. Results: We observe that the performance of the distance operation cannot be improved by using the inner approximations instead of the actual shapes. The overheads of the inner rectangles would not be recovered from calculating the distance between simpler geometries. Conclusions: The execution time of the distance operator has a small dependence on polygon complexity. Conclusively, an inner approximation for complex polygons cannot out-perform the standard PostGIS implementation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Frank, Anette, Kathrin Spreyer, Witold Drożdżyński, Hans-Ulrich Krieger und Ulrich Schäfer. „Constraint-based RMRS construction from shallow grammars“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 01.10.2004. http://dx.doi.org/10.21248/hpsg.2004.22.

Der volle Inhalt der Quelle

Annotation:

We present a constraint-based syntax-semantics interface for the construction of RMRS (Robust Minimal Recursion Semantics) representations from shallow grammars. The architecture is designed to allow modular interfaces to existing shallow grammars of various depth - ranging from chunk grammars to context-free stochastic grammars. We define modular semantics construction principles in a typed feature structure formalism that allow flexible adaptation to alternative grammars and different languages.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Beermann, Dorothee, und Lars Hellan. „A treatment of directionals in implemented HPSG grammars“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 01.10.2004. http://dx.doi.org/10.21248/hpsg.2004.20.

Der volle Inhalt der Quelle

Annotation:

This article proposes a semantics of directional expressions in Norwegian and German, regarded as VP modifiers. The analysis uses Minimal Recursion Semantics, as an integrated part of Matrix-based HPSG grammars. Directional expressions are analyzed as modifying an individual, the 'mover'. Context dependent directionals like here receive a decomposed analysis. Telicity values reflecting various types of directional and locative expressions are computed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Sio, Joanna Ut-Seong, und Sanghoun Song. „Divergence in expressing definiteness between Mandarin and Cantonese“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 15.10.2015. http://dx.doi.org/10.21248/hpsg.2015.11.

Der volle Inhalt der Quelle

Annotation:

In this paper, we model the dialectal variation in the expression of definiteness in Mandarin and Cantonese adopting the Head-Driven Phrase Structure Grammar (HPSG) framework (Pollard & Sag, 1994) and Minimal Recursion Semantics (MRS) (Copestake et al., 2005).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Asudeh, Ash, und Richard Crouch. „Glue semantics for HPSG“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 01.05.2002. http://dx.doi.org/10.21248/hpsg.2001.1.

Der volle Inhalt der Quelle

Annotation:

‎The glue approach to semantic interpretation has been developed principally for Lexical Functional Grammar. Recent work has shown how glue can be used with a variety of syntactic theories and this paper outlines how it can be applied to HPSG. As well as providing an alternative form of semantics for HPSG, we believe that the benefits of HPSG glue include the following: (1) simplification of the Semantics Principle; (2) a simple and elegant treatment of modifier scope, including empirical phenomena like quantifier scope ambiguity, the interaction of scope with raising, and recursive modification; (3) an analysis of control that handles agreement between controlled subjects and their coarguments while allowing for a property denotation for the controlled clause; (4) re-use of highly efficient techniques for semantic derivation already implemented for LFG, and which target problems of ambiguity management also addressed by Minimal Recursion Semantics.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Moeljadi, David, und Francis Bond. „HPSG analysis and computational implementation of Indonesian passives“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 15.10.2018. http://dx.doi.org/10.21248/hpsg.2018.8.

Der volle Inhalt der Quelle

Annotation:

This study aims to analyze and develop a detailed model of syntax and semantics of passive sentences in standard Indonesian in the framework of Head-Driven Phrase Structure Grammar (HPSG) (Pollard & Sag, 1994; Sag et al., 2003) and Minimal Recursion Semantics (MRS) (Copestake et al., 2005), explicit enough to be interpreted by a computer, focusing on implementation rather than theory. There are two main types of passive in Indonesian, following Sneddon et al. (2010, pp. 256-260) and Alwi et al. (2014, pp. 352-356), called ‘passive type 1’ (P1) and ‘passive type 2’ (P2). Both types were analyzed and implemented in the Indonesian Resource Grammar (INDRA), a computational grammar for Indonesian (Moeljadi et al., 2015).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Zamaraeva, Olga, Thomas Trimble, Kristen Howell, Michael Goodman, Antske Fokkens, Guy Emerson, Christopher Curtis und Emily Bender. „20 years of the Grammar Matrix: cross-linguistic hypothesis testing of increasingly complex interactions“. Journal of Language Modelling 10, Nr. 1 (20.10.2022). http://dx.doi.org/10.15398/jlm.v10i1.292.

Der volle Inhalt der Quelle

Annotation:

The Grammar Matrix project is a meta-grammar engineering framework expressed in Head-driven Phrase Structure Grammar (HPSG) and Minimal Recursion Semantics (MRS). It automates grammar implementation and is thus a tool and a resource for linguistic hypothesis testing at scale. In this paper, we summarize how the Grammar Matrix grew in the last decade and describe how new additions to the system have made it possible to study interactions between analyses, both monolingually and cross-linguistically, at new levels of complexity.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Bonami, Olivier. „syntax-semantics interface for tense and aspect in French“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 01.05.2002. http://dx.doi.org/10.21248/hpsg.2001.3.

Der volle Inhalt der Quelle

Annotation:

This paper proposes an HPSG account of the French tense and aspect system, focussing on the analysis of the passé simple (simple past) and imparfait (imperfective) tenses and their interaction with aspectually sensitive adjuncts. Starting from de Swart's (1998) analysis of the semantics of tense and aspect, I show that while the proposed semantic representations are appropriate, the analysis of implicit aspectual operators as coercion operators is inadequate. The proposed HPSG analysis relies on Minimal Recursion Semantics to relate standard syntactic structures with de Swart-style semantic representations. The analysis has two crucial features: first, it assumes that the semantic contribution of tense originates in the verb's semantic representation, despite the fact that tense can get wide scope over other semantic elements. Second, it allows the occurrence of implicit aspectual operators to be controlled by the verb's inflectional class, which accounts for their peculiar distribution.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Kordoni, Valia. „Between shifts and alternations: Ditransitive constructions“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 25.10.2004. http://dx.doi.org/10.21248/hpsg.2004.9.

Der volle Inhalt der Quelle

Annotation:

In this paper I present two classes of double object constructions in Modern Greek, i.e., the genitive, as well as the double accusative, ditransitive constructions. I show that these two classes differ from one another in that not both of them permit derivational processes such as the formation of adjectival passives. I also look at the case properties associated with the verbs which head Modern Greek genitive and double accusative ditransitive constructions. Finally, the analysis I propose for these constructions in Modern Greek are formalized using the Minimal Recursion Semantics (MRS) framework of Copestake et al. (2001) and Copestake et al. (2003).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Taelman, Ruben, Joachim Van Herwegen, Miel Vander Sande und Ruben Verborgh. „Components.js: Semantic dependency injection“. Semantic Web, 21.01.2022, 1–19. http://dx.doi.org/10.3233/sw-222945.

Der volle Inhalt der Quelle

Annotation:

A common practice within object-oriented software is using composition to realize complex object behavior in a reusable way. Such compositions can be managed by Dependency Injection (DI), a popular technique in which components only depend on minimal interfaces and have their concrete dependencies passed into them. Instead of requiring program code, this separation enables describing the desired instantiations in declarative configuration files, such that objects can be wired together automatically at runtime. Configurations for existing DI frameworks typically only have local semantics, which limits their usage in other contexts. Yet some cases require configurations outside of their local scope, such as for the reproducibility of experiments, static program analysis, and semantic workflows. As such, there is a need for globally interoperable, addressable, and discoverable configurations, which can be achieved by leveraging Linked Data. We created Components.js as an open-source semantic DI framework for TypeScript and JavaScript applications, providing global semantics via Linked Data-based configuration files. In this article, we report on the Components.js framework by explaining its architecture and configuration, and discuss its impact by mentioning where and how applications use it. We show that Components.js is a stable framework that has seen significant uptake during the last couple of years. We recommend it for software projects that require high flexibility, configuration without code changes, sharing configurations with others, or applying these configurations in other contexts such as experimentation or static program analysis. We anticipate that Components.js will continue driving concrete research and development projects that require high degrees of customization to facilitate experimentation and testing, including the Comunica query engine and the Community Solid Server for decentralized data publication.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Crysmann, Berthold. „Underspecification of intersective modifier attachment: Some arguments from German“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 01.10.2004. http://dx.doi.org/10.21248/hpsg.2004.21.

Der volle Inhalt der Quelle

Annotation:

In this paper, I shall discuss the semantic attachment of intersective modifiers in German coherent constructions. I shall show that a purely syntactic solution to the observable attachment ambiguity is undesirable for reasons of processing e ciency and/or massive spurious ambiguity. Instead, I shall follow Egg and Lebeth (1995) and propose an extension to Minimal Recursion Semantics, permitting the expression of underspecified semantic attachment. This rather trivial move, as we shall see, will not only be preferable for processing reasons, but it will also be more in line with the spirit of underspecified semantics, e ectively providing a compact representation of purely semantic distinctions, instead of unfolding these distinctions into a rain forest of tree representations and derivations. I will present an implementation of the underspecification approach integrated into the German HPSG developed at DFKI and compare its e ciency to an alternative implementation where semantic attachment is unfolded by means of retrieval rules.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

BRANDT, JÖRGEN, WOLFGANG REISIG und ULF LESER. „Computation semantics of the functional scientific workflow language Cuneiform“. Journal of Functional Programming 27 (2017). http://dx.doi.org/10.1017/s0956796817000119.

Der volle Inhalt der Quelle

Annotation:

AbstractCuneiform is a minimal functional programming language for large-scale scientific data analysis. Implementing a strict black-box view on external operators and data, it allows the direct embedding of code in a variety of external languages like Python or R, provides data-parallel higher order operators for processing large partitioned data sets, allows conditionals and general recursion, and has a naturally parallelizable evaluation strategy suitable for multi-core servers and distributed execution environments like Hadoop, HTCondor, or distributed Erlang. Cuneiform has been applied in several data-intensive research areas including remote sensing, machine learning, and bioinformatics, all of which critically depend on the flexible assembly of pre-existing tools and libraries written in different languages into complex pipelines. This paper introduces the computation semantics for Cuneiform. It presents Cuneiform's abstract syntax, a simple type system, and the semantics of evaluation. Providing an unambiguous specification of the behavior of Cuneiform eases the implementation of interpreters which we showcase by providing a concise reference implementation in Erlang. The similarity of Cuneiform's syntax to the simply typed lambda calculus puts Cuneiform in perspective and allows a straightforward discussion of its design in the context of functional programming. Moreover, the simple type system allows the deduction of the language's safety up to black-box operators. Last, the formulation of the semantics also permits the verification of compilers to and from other workflow languages.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Ørsnes, Bjarne. „Preposed negation in Danish“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 13.10.2009. http://dx.doi.org/10.21248/hpsg.2009.13.

Der volle Inhalt der Quelle

Annotation:

In Danish the base position of the negation and negated quantifier phrases is between the subject and the finite verb in embedded clauses. However, in embedded clauses introduced by a non-veridical complementizer such as hvis (ˋif') or om (ˋwhether') the negation and negated quantifier phrases can also appear between the complementizer and the subject. This phenomenon is referred to as preposed negation. The paper investigates the structure and semantics of this construction. It is argued that preposed negation is no adjunction structure, but a special construction where the negation element is a sister of the complementizer and the filler of a filler-gap-structure. It is further argued that preposed negation is associated with negated verum-focus of a clause lacking an (aboutness-) topic. The negation of a verum predicate explains why preposed negation fails to license strong negative polarity items and to rule out positive ones. The lack of a topic explains why preposed negation is preferred with non-referential subjects and with weak readings of indefinite subjects and why preposed negation is incompatible with topic-binding particles.The final section presents an HPSG-analysis of preposed negation using Minimal Recursion Semantics (MRS).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Lee, Juwon. „The direct evidential -te in Korean: Its interaction with person and experiencer predicates“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 18.10.2012. http://dx.doi.org/10.21248/hpsg.2012.15.

Der volle Inhalt der Quelle

Annotation:

This paper discusses the complex relations among the direct evidential -te, person, and experiencer predicates in Korean. The questions of the paper are: (i) how the three components are related with each other in the evidential sentences, and (ii) how the interactions of the three components can be formally analyzed to correctly license only the well-formed evidential sentences. I show that in direct evidential construction with a non-private predicate (e.g. pwutulep- ‘soft’), the asserter/epistemic authority (i.e. the speaker na ‘I’ in declarative or the addressee ne ‘you’ in question) must be the experiencer of the predicate, but there is no such constraint in direct evidential construction with a private predicate (e.g. aphu- ‘sick’). I also show that the direct evidential construction with a non-private predicate is an instance of self-ascription. Then I propose an analysis of the experiencer predicates and associated lexical rules in the Minimal Recursion Semantics (MRS) (Copestake, et al., 2005) of Head-driven Phrase Structure Grammar (HPSG) (Pollard and Sag, 1994; Sag, et al., 2003).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Flouraki, Maria. „Constraining aspectual composition“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 12.10.2006. http://dx.doi.org/10.21248/hpsg.2006.8.

Der volle Inhalt der Quelle

Annotation:

In Modern Greek there is a rich aspectual system, which involves both morphologically expressed grammatical aspect and eventuality types, carried primarily by the meaning of the verbal predicate. Particular emphasis is paid to the interaction between grammatical aspect and eventuality types, since it is due to this interaction that the verbal predicate acquires distinct meanings. In order to explain potential changes in the meaning of the eventualities caused by the interaction with grammatical aspect, I propose a formal analysis within HPSG, using Minimal Recursion Semantics (MRS) for the semantic representations. Following the MRS architecture, I introduce a number of relations, which represent both grammatical aspect and eventuality types. The close interaction between grammatical aspect and eventuality types triggers special meanings which traditionally can be explained by inserting contextual information into the representations. In this paper, I argue against such an analysis, providing an alternative which is based on the introduction of subeventual templates formulated by Michaelis (2003) and Pustejovsky (1995). In this context, grammatical aspect combines with eventuality types and selects eventualities or subeventualities appropriate to its selection restrictions, using information that is already there in the denotation of the eventualities.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Sukhada, Sukhada, Sirisipalli Veera Hymavathi und Soma Paul. „Generation of MRS Abstract Predicates from Paninian USR“. Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 15.10.2023. http://dx.doi.org/10.21248/hpsg.2023.7.

Der volle Inhalt der Quelle

Annotation:

Semantic Representations become useful resources for various multilingual NLP applications such as Machine Translation, Multilingual Generation, cross Lingual QA, to name a few. No Semantic Representation, to our knowledge, adopts vivakṣā (Speaker’s intention) as a guiding principle for the representation. This motivates us to develop a new Semantic Representation system – Universal Semantic Representation (USR) – following Indian Grammatical Tradition (IGT) and Paninian grammar. Since USR is designed to be language-independent, we have currently taken up the task of generating English, Hindi, Tamil and Bangla from the USR. For English generation, the USR is mapped to ERG meaning representation (Flickinger, D. 1999) which is couched in Minimal Recursion Semantics (MRS). We use an off-the-shelf ACE generator that uses ERG as a resource-grammar for generating English. While designing the transfer module from USR to ERG-based MRS, we came across various Abstract Predicates (APs) in MRS representation as described in ErgSemantics_Basic (Flickinger et al., 2014). These APs are used to represent the semantic contribution of grammatical constructions or more specialized lexical entries such as compounding or the comparative use of more and so on. This paper presents the strategy for postulating the APs from the information given in USR and then reports the implementation of the transfer module keeping the focus on the postulation of APs. We get around 95% accuracy in postulating APs from USR.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zeitschriftenartikel zum Thema „Dependency Minimal Recursion Semantics“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an