Готові списки джерел за темами / Minimal Recursion Semantic

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Добірка наукової літератури з теми "Minimal Recursion Semantic"

Автор: Grafiati

Опубліковано: 30 травня 2022

Оновлено: 31 травня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Minimal Recursion Semantic".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Minimal Recursion Semantic"

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

Повний текст джерела

Анотація:

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 та ін.

Manshadi, Mehdi, Daniel Gildea, and James F. Allen. "A Notion of Semantic Coherence for Underspecified Semantic Representation." Computational Linguistics 44, no. 1 (March 2018): 39–83. http://dx.doi.org/10.1162/coli_a_00307.

Повний текст джерела

Анотація:

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 та ін.

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

Повний текст джерела

Анотація:

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 та ін.

Yao, Xuchen, Gosse Bouma, and Yi Zhang. "Semantics-based Question Generation and Implementation." Dialogue & Discourse 3, no. 2 (March 16, 2012): 11–42. http://dx.doi.org/10.5087/dad.2012.202.

Повний текст джерела

Анотація:

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 та ін.

Xu, Yang, Emmy Liu, and Terry Regier. "Numeral Systems Across Languages Support Efficient Communication: From Approximate Numerosity to Recursion." Open Mind 4 (August 2020): 57–70. http://dx.doi.org/10.1162/opmi_a_00034.

Повний текст джерела

Анотація:

Languages differ qualitatively in their numeral systems. At one extreme, some languages have a small set of number terms, which denote approximate or inexact numerosities; at the other extreme, many languages have forms for exact numerosities over a very large range, through a recursively defined counting system. Why do numeral systems vary as they do? Here, we use computational analyses to explore the numeral systems of 30 languages that span this spectrum. We find that these numeral systems all reflect a functional need for efficient communication, mirroring existing arguments in other semantic domains such as color, kinship, and space. Our findings suggest that cross-language variation in numeral systems may be understood in terms of a shared functional need to communicate precisely while using minimal cognitive resources.

Стилі APA, Harvard, Vancouver, ISO та ін.

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

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Egg, M. "Wh-questions in underspecified minimal recursion semantics." Journal of Semantics 15, no. 1 (February 1, 1998): 37–82. http://dx.doi.org/10.1093/jos/15.1.37.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

TSUIKI, HIDEKI. "A computationally adequate model for overloading via domain-valued functors." Mathematical Structures in Computer Science 8, no. 4 (August 1998): 321–49. http://dx.doi.org/10.1017/s0960129598002539.

Повний текст джерела

Анотація:

We give a denotational semantics to a calculus λ[otimes ] with overloading and subtyping. In λ[otimes ], the interaction between overloading and subtyping causes self application, and non-normalizing terms exist for each type. Moreover, the semantics of a type depends not on that type alone, but also on infinitely many others. Thus, we need to consider infinitely many domains, which are related by an infinite number of mutually recursive equations. We solve this by considering a functor category from the poset of types modulo equivalence to a category in which each type is interpreted. We introduce a categorical constructor corresponding to overloading, and formalize the equations as a single equation in the functor category. A semantics of λ[otimes ] is then expressed in terms of the minimal solution of this equation. We prove the adequacy theorem for λ[otimes ] following the construction in Pitts (1994) and use it to derive some syntactic properties.

Стилі APA, Harvard, Vancouver, ISO та ін.

CROLE, ROY L., and ANDREW D. GORDON. "Relating operational and denotational semantics for input/output effects." Mathematical Structures in Computer Science 9, no. 2 (April 1999): 125–58. http://dx.doi.org/10.1017/s0960129598002709.

Повний текст джерела

Анотація:

We study the longstanding problem of semantics for input/output (I/O) expressed using side-effects. Our vehicle is a small higher-order imperative language, with operations for interactive character I/O and based on ML syntax. Unlike previous theories, we present both operational and denotational semantics for I/O effects. We use a novel labelled transition system that uniformly expresses both applicative and imperative computation. We make a standard definition of bisimilarity and prove bisimilarity is a congruence using Howe's method.Next, we define a metalanguage [Mscr ] in which we may give a denotational semantics to [Oscr ]. [Mscr ] generalises Crole and Pitts' FIX-logic by adding in a parameterised recursive datatype, which is used to model I/O. [Mscr ] comes equipped both with an operational semantics and a domain-theoretic semantics in the category [Cscr ][Pscr ][Pscr ][Oscr ] of cppos (bottom-pointed posets with joins of ω-chains) and Scott continuous functions. We use the [Cscr ][Pscr ][Pscr ][Oscr ] semantics to prove that [Mscr ] is computationally adequate for the operational semantics using formal approximation relations. The existence of such relations is based on recent work of Pitts (Pitts 1994b) for untyped languages, and uses the idea of minimal invariant objects due to Freyd.A monadic-style textual translation into [Mscr ] induces a denotational semantics on [Oscr ]. Our final result validates the denotational semantics: if the denotations of two [Oscr ] programs are equal, then the [Oscr ] programs are in fact operationally equivalent.

Стилі APA, Harvard, Vancouver, ISO та ін.

Prokopaki-Kostopoulou, Nefeli, and Stasinos Konstantopoulos. "Optimizing within-distance queries by approximating shapes with maximal bounded boxes." Open Research Europe 2 (May 9, 2022): 57. http://dx.doi.org/10.12688/openreseurope.14321.1.

Повний текст джерела

Анотація:

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 та ін.

Більше джерел

Дисертації з теми "Minimal Recursion Semantic"

Kanishcheva, O. V. "Using of Minimal Recursion Semantic representation for linguistic information." Thesis, Сумський державний університет, 2013. http://essuir.sumdu.edu.ua/handle/123456789/31777.

Повний текст джерела

Анотація:

In this article will discuss current approaches to the representation of linguistic information. Particular attention is paid Minimal Recursion Semantic (MRS) and the Robust Minimal Recursion Semantic (RMRS) as one of the most promising directions. Shows the use of Minimal Recursion Semantic (MRS) for the Russian language. When you are citing the document, use the following link http://essuir.sumdu.edu.ua/handle/123456789/31777

Стилі APA, Harvard, Vancouver, ISO та ін.

Канищева, Ольга Валерьевна. "Модели представления лингвистических данных". Thesis, НТУ "ХПИ", 2012. http://repository.kpi.kharkov.ua/handle/KhPI-Press/3423.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Emerson, Guy Edward Toh. "Functional distributional semantics : learning linguistically informed representations from a precisely annotated corpus." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/284882.

Повний текст джерела

Анотація:

The aim of distributional semantics is to design computational techniques that can automatically learn the meanings of words from a body of text. The twin challenges are: how do we represent meaning, and how do we learn these representations? The current state of the art is to represent meanings as vectors - but vectors do not correspond to any traditional notion of meaning. In particular, there is no way to talk about 'truth', a crucial concept in logic and formal semantics. In this thesis, I develop a framework for distributional semantics which answers this challenge. The meaning of a word is not represented as a vector, but as a 'function', mapping entities (objects in the world) to probabilities of truth (the probability that the word is true of the entity). Such a function can be interpreted both in the machine learning sense of a classifier, and in the formal semantic sense of a truth-conditional function. This simultaneously allows both the use of machine learning techniques to exploit large datasets, and also the use of formal semantic techniques to manipulate the learnt representations. I define a probabilistic graphical model, which incorporates a probabilistic generalisation of model theory (allowing a strong connection with formal semantics), and which generates semantic dependency graphs (allowing it to be trained on a corpus). This graphical model provides a natural way to model logical inference, semantic composition, and context-dependent meanings, where Bayesian inference plays a crucial role. I demonstrate the feasibility of this approach by training a model on WikiWoods, a parsed version of the English Wikipedia, and evaluating it on three tasks. The results indicate that the model can learn information not captured by vector space models.

Стилі APA, Harvard, Vancouver, ISO та ін.

Stymne, Sara. "Swedish-English Verb Frame Divergences in a Bilingual Head-driven Phrase Structure Grammar for Machine Translation." Thesis, Linköping University, Department of Computer and Information Science, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-6708.

Повний текст джерела

Анотація:

In this thesis I have investigated verb frame divergences in a bilingual Head-driven Phrase Structure Grammar for machine translation. The purpose was threefold: (1) to describe and classify verb frame divergences (VFDs) between Swedish and English, (2) to practically implement a bilingual grammar that covered many of the identified VFDs and (3) to find out what cases of VFDs could be solved and implemented using a common semantic representation, or interlingua, for Swedish and English.

The implemented grammar, BiTSE, is a Head-driven Phrase Structure Grammar based on the LinGO Grammar Matrix, a language independent grammar base. BiTSE is a bilingual grammar containing both Swedish and English. The semantic representation used is Minimal Recursion Semantics (MRS). It is language independent, so generating from it gives all equivalent sentences in both Swedish and English. Both the core of the languages and a subset of the identified VFDs are successfully implemented in BiTSE. For other VFDs tentative solutions are discussed.

MRS have previously been proposed as suitable for semantic transfer machine translation. I have shown that VFDs can naturally be handled by an interlingual design in many cases, minimizing the need of transfer.

The main contributions of this thesis are: an inventory of English and Swedish verb frames and verb frame divergences; the bilingual grammar BiTSE and showing that it is possible in many cases to use MRS as an interlingua in machine translation.

Стилі APA, Harvard, Vancouver, ISO та ін.

Jakob, Max. "Mapping the Prague Dependency Treebank Annotation Scheme onto Robust Minimal Recursion Semantics." Master's thesis, 2010. http://www.nusl.cz/ntk/nusl-286253.

Повний текст джерела

Анотація:

This thesis investigates the correspondence between two semantic formalisms, namely the tectogrammatical layer of the Prague Dependency Treebank 2.0 (PDT) and Robust Minimal Recursion Semantics (RMRS). It is a rst attempt to relate the dependency based annotation scheme of PDT to a compositional semantics approach like RMRS. An iterative mapping algorithm that converts PDT trees into RMRS structures is developed that associates RMRSs to each node in the dependency tree. Therefore, composition rules are formulated and the complex relation between dependency in PDT and semantic heads in RMRS is analyzed in detail. It turns out that structure and dependencies, morphological categories and some coreferences can be preserved in the target structures. Furthermore, valency and free modi cations are distinguished using the valency dictionary of PDT as an additional resource. The evaluation result of 81% recall shows that systematically correct underspeci ed target structures can be obtained by a rule-based mapping approach, which is an indicator that RMRS is capable of representing Czech data. This nding is novel as Czech, with its free word order and rich morphology, is typologically di erent from language that used RMRS thus far.

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Minimal Recursion Semantic"

Thater, Stefan. Minimal recursion semantics as dominance constraints: Graph-theoretic foundation and application to grammar engineering. Saarbrücken: Universität des Saarlandes, 2007.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Minimal Recursion Semantic"

Su, Chao, Heyan Huang, Shumin Shi, and Ping Jian. "Chinese Text Analysis Based on Minimal Recursion Semantics." In Lecture Notes in Computer Science, 421–29. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27194-1_41.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Minimal Recursion Semantic"

Copestake, Ann. "Semantic composition with (robust) minimal recursion semantics." In the Workshop. Morristown, NJ, USA: Association for Computational Linguistics, 2007. http://dx.doi.org/10.3115/1608912.1608925.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lien, Elisabeth, and Milen Kouylekov. "UIO-Lien: Entailment Recognition using Minimal Recursion Semantics." In Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval 2014). Stroudsburg, PA, USA: Association for Computational Linguistics, 2014. http://dx.doi.org/10.3115/v1/s14-2125.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fuchss, Ruth, Alexander Koller, Joachim Niehren, and Stefan Thater. "Minimal recursion semantics as dominance constraints." In the 42nd Annual Meeting. Morristown, NJ, USA: Association for Computational Linguistics, 2004. http://dx.doi.org/10.3115/1218955.1218987.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

"Minimal Recursion Semantics and the Language of Acyclic Recursion." In AI Methods for Interdisciplinary Research in Language and Biology. SciTePress - Science and and Technology Publications, 2011. http://dx.doi.org/10.5220/0003309800880097.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lien, Elisabeth. "Using Minimal Recursion Semantics for Entailment Recognition." In Proceedings of the Student Research Workshop at the 14th Conference of the European Chapter of the Association for Computational Linguistics. Stroudsburg, PA, USA: Association for Computational Linguistics, 2014. http://dx.doi.org/10.3115/v1/e14-3009.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dridan, Rebecca, and Francis Bond. "Sentence comparison using robust minimal recursion semantics and an ontology." In the Workshop. Morristown, NJ, USA: Association for Computational Linguistics, 2006. http://dx.doi.org/10.3115/1641976.1641982.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Alviano, Mario. "Answer Set Programming with Composed Predicate Names." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/5.

Повний текст джерела

Анотація:

Mainstream systems for Answer Set Programming implement intelligent grounding to eliminate object variables from the input program, often obtaining a propositional program of reasonable size. However, non-stratified negation may inhibit the simplification of some rule bodies due to the lack of knowledge on the truth of recursive atoms. Frustration is greatest when the program is clearly locally stratified, such as in case of numerical arguments in rule heads obtained by increasing some body arguments; common examples are minimal distances in graphs and time arguments in planning scenarios. This paper suggests to move some arguments in predicate names, so that the declarative semantics of Answer Set Programming is preserved, but non-stratified negation is possibly avoided thanks to symbolic rule instantiation. A proof of concept is given in terms of Jinja templates for arguments with a clear range.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!