Vai al contenuto principale della pagina

Language, logic, and computation : 13th International Tbilisi Symposium, TbiLLC 2019, Batumi, Georgia, September 16-20, 2019, revised selected papers / / edited by Aybüke Özgün, Yulia Zinova



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Language, logic, and computation : 13th International Tbilisi Symposium, TbiLLC 2019, Batumi, Georgia, September 16-20, 2019, revised selected papers / / edited by Aybüke Özgün, Yulia Zinova Visualizza cluster
Pubblicazione: Cham, Switzerland : , : Springer, , [2022]
©2022
Descrizione fisica: 1 online resource (367 pages)
Disciplina: 006.35
Soggetto topico: Computational linguistics
Persona (resp. second.): ZinovaYulia
ÖzgünAybüke
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: Intro -- Preface -- Organization -- Contents -- Language and Logic -- Final-Vowel Truncation in the Forms of Address in Modern Spoken Georgian -- 1 Introduction -- 2 Vocative Marking in Georgian -- 3 Truncation in Georgian, Its Diachrony and Synchronic Variation -- 3.1 No Vocative Truncation in Old or Middle Georgian -- 3.2 Modern Georgian Dialects and Vocative Truncation -- 3.3 Tbilisi Georgian Between 1950-1980 -- 4 Contact with Russian as a Possible Source -- 4.1 Vocative Truncation in Russian -- 4.2 Comparison of Vocative Truncation in Russian vs. Georgian -- 5 Discussion -- 5.1 Borrowing from Within or Outside of the Language Family? -- 5.2 Which Type of Borrowing Is It? -- 6 Conclusion -- References -- Tutorial: Sign Language Linguistics -- 1 Introduction -- 2 Phonology -- 3 The Use of Space -- 4 Syntax -- 5 Methodological Considerations -- 6 Conclusions -- References -- Gradability in MTT-Semantics -- 1 Introduction -- 2 Modern Type Theories: A Brief Introductioin -- 2.1 Many-Sortedness, Common Nouns as Types and Subtyping -- 2.2 -types, -types, Indexed Types and Universes -- 3 Gradability in MTT-Semantics -- 3.1 Gradable Adjectives -- 3.2 Gradable Nouns -- 3.3 Multidimensional Adjectives -- 3.4 Multidimensional Nouns -- 4 Coq Implementation -- 5 Modelling Gradability with Subtype Universes -- 6 Conclusions and Future Work -- A Coq Code -- A.1 Gradable Adjectives -- A.2 Multidimensional Adjectives -- References -- Building Resources for Georgian Treebanking-Based NLP -- 1 Introduction -- 2 Background -- 2.1 Treebanks -- 2.2 Parallel Treebanks and Alignment -- 3 Creating a Georgian Treebank -- 4 Parallel Treebanking -- 4.1 Creating a Parallel Corpus -- 4.2 Word Alignment -- 4.3 Tree Alignment -- 4.4 Quantitative Evaluation -- 4.5 Qualitative Evaluation -- 5 Discussion and Future Work -- References.
Bridging the Gap Between Formal Semantics and Neurolinguistics: The Case of the N400 and the LPP -- 1 The N400 and the Late Posterior Positivity -- 2 The Functional Interpretation of the N400 and the LPP -- 2.1 Predictions and Situation Models -- 2.2 The Functional Interpretation of the N400 -- 2.3 The Functional Interpretation of the LPP -- 2.4 The Processing Model Underlying the N400 and the LPP -- 3 The Formal Framework -- 3.1 Frame Theory -- 3.2 Adapting the Framework -- 3.3 Formal Definitions of the Update Operations -- 4 Probability Distributions and Information Metrics -- 4.1 Probability Distributions on Frames -- 4.2 Information Metrics: Entropy and Entropy Reduction -- 4.3 The LPP and Exception Handling -- 5 Comparison to Three Related Models -- 6 Closing Outlook -- References -- Distributional Analysis of Polysemous Function Words -- 1 Introduction -- 2 Background: Distributional Analysis -- 3 Phenomenon: The German Reflexive Pronoun sich -- 4 Data and Annotation -- 5 Experimental Setup -- 6 Exploratory Analysis -- 7 Classification Experiments -- 7.1 Experiment 1: Classification with All Classes -- 7.2 Experiment 2: Classification Without Inherent Reflexives -- 7.3 Experiment 3: Prediction of Semantic Features -- 8 Discussion and Conclusion -- References -- It is not the Obvious Question that a Cleft Addresses -- 1 Introduction -- 2 Background -- 3 Analysis -- 4 Applying the Model -- 5 Conclusion -- References -- Extensions in Compositional Semantics -- 1 A Puzzle About Extensions -- 2 Truth and Reference -- 2.1 Extension and Reference -- 2.2 Truth and Individual Reference -- 2.3 Truth and Divided Reference -- 3 Determining Extensions -- 4 Extension and Bedeutung -- 4.1 The Arguments of extension -- 4.2 Occurrence and Bedeutung -- 5 Back to the Puzzle -- 6 Conclusion -- References -- Embedded Questions are Exhaustive Alright, but….
1 Introduction -- 2 Background: Exhaustive Force, Particles, and Q-Adverbs -- 2.1 Different EXH-Force Under Knowand Surprise:SE vs. WE -- 2.2 The Interpretive Effect of SCHON…Aber:Implicature Blocking -- 2.3 The Meaning of Teilweise'Partially': Quantifying Over Pluralities -- 3 Wissen'Know' + Wh:Data and Analysis -- 3.1 Novel Evidence on Know+ Wh:IE is Semantic, but SE is Pragmatic! -- 3.2 An Event-Semantic Analysis of WE-Readings with Wissen'Know' -- 3.3 Pragmatics: Strengthening to SE -- 3.4 Conclusion on Wissen'know' + Wh -- 4 Überraschen'Surprise' + Wh:Data and Analysis -- 4.1 Novel Evidence: WEnondist is Semantic, but WEdist is Pragmatic! -- 4.2 Towards a Non-propositional Analysis of Surprise+ Wh -- 5 Conclusions and Theoretical Implications -- References -- Logic and Computation -- Lyndon Interpolation for Modal -Calculus -- 1 Introduction -- 2 Modal -Calculus -- 2.1 Syntactic Considerations -- 2.2 Semantics -- 2.3 Annotations and Sequents -- 3 Sequent Calculi -- 3.1 A Circular Proof System -- 4 Extracting the Interpolant -- 5 On the Form of the Interpolant -- 6 Discussion -- References -- Decidable and Undecidable Problems for First-Order Definability and Modal Definability -- 1 Introduction -- 2 Preliminaries -- 2.1 Frames -- 2.2 Modal Language and Truth -- 2.3 First-Order Language and Truth -- 2.4 Modal Definability and First-Order Definability -- 3 Modal Definability: Decidable Cases -- 4 First-Order Definability: Trivial Cases -- 5 Chagrova's Theorem About Modal Definability -- 5.1 A New Proof of Chagrova's Theorem About Modal Definability -- 5.2 Proofs of New Variants of Chagrova's Theorem About Modal Definability -- 6 Conclusion -- References -- Topological Evidence Logics: Multi-agent Setting -- 1 Introduction -- 2 Single-Agent Topological Evidence Models -- 2.1 The Logic of Topological Evidence Models -- 3 Going Multi-agent.
3.1 Topological-Partitional Models -- 3.2 Other Fragments -- 4 Generic Models for Two Agents -- 5 Distributed and Common Knowledge -- 5.1 Distributed Knowledge -- 5.2 Common Knowledge -- 6 Conclusions and Future Work -- References -- Incomplete Information and Justifications -- 1 Introduction -- 2 Preliminaries -- 3 The logic ILUPJ -- 3.1 Syntax -- 3.2 Axiomatization -- 3.3 Semantics -- 4 Soundness and Completeness -- 4.1 Completeness -- 5 ILUPJ as a Generalization of the Logic PPJ -- 6 Conclusion -- References -- Unranked Nominal Unification -- 1 Introduction -- 2 Unranked Nominal Language -- 3 Unification -- 4 Terminating Fragments -- 5 Discussion -- 6 Conclusion -- References -- Lattices of Intermediate Theories via Ruitenburg's Theorem -- 1 Introduction -- 2 Preliminaries -- 3 -logics -- 4 Algebraic Semantics -- 5 Dual Isomorphism -- 6 The Lattices of -logics -- 7 Conclusion -- A Proof of Lemma 7 -- References -- Matching and Generalization Modulo Proximity and Tolerance Relations -- 1 Introduction -- 2 Preliminaries -- 3 Matching and Anti-unification: Problem Statement -- 4 Matching -- 4.1 Computing Approximation Degrees for Matching -- 5 Anti-unification -- 5.1 Computing Approximation Degrees for Anti-unification -- 6 Conclusion -- References -- From Paradox to Truth -- 1 Introduction -- 2 Formalising Paradox -- 3 Paradoxes -- 4 Models of Truth -- 5 Conclusion -- References -- Author Index.
Titolo autorizzato: Language, Logic, and Computation  Visualizza cluster
ISBN: 3-030-98479-6
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910558500203321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Lecture Notes in Computer Science