Literatura científica selecionada sobre o tema "Dependency Minimal Recursion Semantics"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Dependency Minimal Recursion Semantics".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Dependency Minimal Recursion Semantics"
Copestake, Ann, Dan Flickinger, Carl Pollard e Ivan A. Sag. "Minimal Recursion Semantics: An Introduction". Research on Language and Computation 3, n.º 2-3 (julho de 2005): 281–332. http://dx.doi.org/10.1007/s11168-006-6327-9.
Texto completo da fonteEgg, M. "Wh-questions in underspecified minimal recursion semantics". Journal of Semantics 15, n.º 1 (1 de fevereiro de 1998): 37–82. http://dx.doi.org/10.1093/jos/15.1.37.
Texto completo da fonteJørgensen, Fredrik, e Jan Tore Lønning. "A Minimal Recursion Semantic Analysis of Locatives". Computational Linguistics 35, n.º 2 (junho de 2009): 229–70. http://dx.doi.org/10.1162/coli.06-69-prep5.
Texto completo da fonteManshadi, Mehdi, Daniel Gildea e James F. Allen. "A Notion of Semantic Coherence for Underspecified Semantic Representation". Computational Linguistics 44, n.º 1 (março de 2018): 39–83. http://dx.doi.org/10.1162/coli_a_00307.
Texto completo da fonteYao, Xuchen, Gosse Bouma e Yi Zhang. "Semantics-based Question Generation and Implementation". Dialogue & Discourse 3, n.º 2 (16 de março de 2012): 11–42. http://dx.doi.org/10.5087/dad.2012.202.
Texto completo da fonteAbo Khamis, Mahmoud, Hung Q. Ngo, Reinhard Pichler, Dan Suciu e Yisu Remy Wang. "Convergence of Datalog over (Pre-) Semirings". ACM SIGMOD Record 52, n.º 1 (7 de junho de 2023): 75–82. http://dx.doi.org/10.1145/3604437.3604454.
Texto completo da fonteSimov, Kiril, e Petya Osenova. "Special Thematic Section on Semantic Models for Natural Language Processing (Preface)". Cybernetics and Information Technologies 18, n.º 1 (1 de março de 2018): 93–94. http://dx.doi.org/10.2478/cait-2018-0008.
Texto completo da fonteVOLIOTIS, C., N. M. SGOUROS e G. PAPAKONSTANTINOU. "ATTRIBUTE GRAMMAR BASED MODELING OF CONCURRENT CONSTRAINT LOGIC PROGRAMMING". International Journal on Artificial Intelligence Tools 04, n.º 03 (setembro de 1995): 383–411. http://dx.doi.org/10.1142/s021821309500019x.
Texto completo da fonteProkopaki-Kostopoulou, Nefeli, e Stasinos Konstantopoulos. "Optimizing within-distance queries by approximating shapes with maximal bounded boxes". Open Research Europe 2 (9 de maio de 2022): 57. http://dx.doi.org/10.12688/openreseurope.14321.1.
Texto completo da fonteFrank, Anette, Kathrin Spreyer, Witold Drożdżyński, Hans-Ulrich Krieger e Ulrich Schäfer. "Constraint-based RMRS construction from shallow grammars". Proceedings of the International Conference on Head-Driven Phrase Structure Grammar, 1 de outubro de 2004. http://dx.doi.org/10.21248/hpsg.2004.22.
Texto completo da fonteTeses / dissertações sobre o assunto "Dependency Minimal Recursion Semantics"
Hijazi, Rita. "Simplification syntaxique de textes à base de représentations sémantiques exprimées avec le formalisme Dependency Minimal Recursion Semantics (DMRS)". Electronic Thesis or Diss., Aix-Marseille, 2022. http://theses.univ-amu.fr.lama.univ-amu.fr/221214_HIJAZI_602vzfxdu139bxtesm225byk629aeqyvw_TH.pdf.
Texto completo da fonteText simplification is the task of making a text easier to read and understand and more accessible to a target audience. This goal can be reached by reducing the linguistic complexity of the text while preserving the original meaning as much as possible. This thesis focuses on the syntactic simplification of texts in English, a task for which these automatic systems have certain limitations. To overcome them, we first propose a new method of syntactic simplification exploiting semantic dependencies expressed in DMRS (Dependency Minimal Recursion Semantics), a deep semantic representation in the form of graphs combining semantics and syntax. Syntactic simplification enables to represent the complex sentence in a DMRS graph, transforming this graph according to specific strategies into other DMRS graphs, which will generate simpler sentences. This method allows the syntactic simplification of complex constructions, in particular division operations such as subordinate clauses, appositive clauses, coordination and also the transformation of passive forms into active forms. The results obtained by this system of syntactic simplification surpass those of the existing systems of the same type in the production of simple, grammatical sentences and preserving the meaning, thus demonstrating all the interest of our approach to syntactic simplification based on semantic representations in DMRS
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.
Texto completo da fonteStymne, 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.
Texto completo da fonteIn 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.
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.
Texto completo da fonteLivros sobre o assunto "Dependency Minimal Recursion Semantics"
Thater, Stefan. Minimal recursion semantics as dominance constraints: Graph-theoretic foundation and application to grammar engineering. Saarbrücken: Universität des Saarlandes, 2007.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Dependency Minimal Recursion Semantics"
Su, Chao, Heyan Huang, Shumin Shi e 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.
Texto completo da fontePaquet, Hugo. "Bayesian strategies: probabilistic programs as generalised graphical models". In Programming Languages and Systems, 519–47. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_19.
Texto completo da fonteBozzano, Marco, Alessandro Cimatti, Anthony Fernandes Pires, Alberto Griggio, Martin Jonáš e Greg Kimberly. "Efficient SMT-Based Analysis of Failure Propagation". In Computer Aided Verification, 209–30. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_10.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Dependency Minimal Recursion Semantics"
Hijazi, Rita, Bernard Espinasse e Núria Gala. "GRASS: A Syntactic Text Simplification System based on Semantic Representations". In 3rd International Conference on Data Science and Machine Learning (DSML 2022). Academy and Industry Research Collaboration Center (AIRCC), 2022. http://dx.doi.org/10.5121/csit.2022.121518.
Texto completo da fonteFuchss, Ruth, Alexander Koller, Joachim Niehren e 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.
Texto completo da fonte"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.
Texto completo da fonteCopestake, 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.
Texto completo da fonteLien, 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.
Texto completo da fonteLien, Elisabeth, e 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.
Texto completo da fonteDridan, Rebecca, e 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.
Texto completo da fonte