Vai al contenuto principale della pagina

Logic and Engineering of Natural Language Semantics : 20th International Conference, LENLS20, Osaka, Japan, November 18-20, 2023, Revised Selected Papers



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Autore: Bekki Daisuke Visualizza persona
Titolo: Logic and Engineering of Natural Language Semantics : 20th International Conference, LENLS20, Osaka, Japan, November 18-20, 2023, Revised Selected Papers Visualizza cluster
Pubblicazione: Cham : , : Springer, , 2024
©2024
Edizione: 1st ed.
Descrizione fisica: 1 online resource (363 pages)
Altri autori: MineshimaKoji  
McCreadyElin  
Nota di contenuto: Intro -- LENLS 20: Twenty Years of Logic and Language -- Organization -- Contents -- Putting the Argumentative Perspective Under Discussion - QUD vs. Argumentative Goals -- 1 The Argumentative Perspective on Language -- 2 QUD and Argumentative Goals -- 3 At-Issueness and Argumentation -- 4 Projective Content in Argumentation -- 5 A Revised Typology of Meaning -- References -- Perspective and the Self in Experiential Attitude Reports -- 1 Background -- 2 The Challenge from Observer Experiences -- 3 Capturing Perspectivity -- 4 De se-ness and Outside Imagining -- 5 Conclusion -- References -- Negation and Information Structure in Tree-Wrapping Grammar -- 1 Introduction -- 1.1 `Types' of Negation -- 1.2 Focus and Negation -- 2 Natural Language Negation and Pragmatic Structuring -- 3 Formal Modeling -- 3.1 Role and Reference Grammar -- 3.2 Formal Specification of the Grammar -- 3.3 Negation in Formalized RRG Using TWG -- 4 Further Phenomena -- 4.1 Denial and Correction -- 4.2 Negation and Morphosyntactic Restrictions -- 5 Conclusions -- References -- Towards a Theory of Anaphoric Binding in Event Semantics -- 1 Introduction -- 2 Polynomial Event Semantics: Brief Reminder -- 3 Polyconcepts in Context: Relative Denotations -- 4 Nominal Pronouns and Referents -- 4.1 Bound Variable Anaphora -- 5 Related Work -- 6 Conclusions and Future Work -- References -- Matrix and Relative Weak Crossover on the Level of the Individual: An Experimental Investigation -- 1 Introduction -- 2 Background -- 2.1 Dependent Type Semantics -- 2.2 The LFS Method -- 3 Design of Experiment -- 3.1 Forms of Sentences -- 3.2 X and Y for BVA(X, Y) -- 3.3 The Method of Conveying Interpretations -- 3.4 Further Details -- 4 Results -- 5 Conclusion -- References -- Additivity in Attention Semantics -- 1 Introduction -- 2 The Base Case of Obligatory Additive Marking.
3 Implicature-Based Accounts and Problematic Cases -- 4 Proposal -- 4.1 Attention Semantics and Pragmatics -- 4.2 State-Based Semantics -- 4.3 Lexical Specifications for the Attention Dimension -- 4.4 Discourse Management -- 4.5 Conversational Maxims -- 4.6 Answerability -- 5 Predictions -- 5.1 The `At Least' Case (5) -- 5.2 The Indefinite Case (6) -- 5.3 The Conjunction Case (8) -- 6 Conclusion -- References -- Extending Abstract Categorial Grammars with Feature Structures: Theory and Practice -- 1 Introduction -- 1.1 Abstract Categorial Grammar -- 1.2 Morphosyntax and Grammars -- 2 Proposed Extension -- 2.1 Modeling Feature Structures -- 2.2 Extended Abstract Categorial Grammar -- 3 Theoretical Results -- 3.1 Expressive Power -- 3.2 Parsing -- 4 Experimental Results -- 4.1 Grammar Factorization -- 4.2 Text Generation Performances -- 4.3 Conclusion -- References -- An Overt Operator Associating with Covert Focus: An Even-Like Semantics for Mandarin Gèng -- 1 Introduction -- 2 Motivating an Even-Like Analysis for Gèng's Combination with Non-gradable Predicates -- 3 Pursuing an Analysis of Even-Like Particles: Two Competing Proposals of English Even -- 3.1 The Likelihood-Based Account -- 3.2 Greenbeg's ch8Greenberg2018 Degree-Based Account -- 4 Our Proposal for Gèng's Combination with Non-gradable Predicates: An Even-Like Particle à la ch8Greenberg2018's Even -- 5 Extending Our Even-Like Proposal (19) to Gèng's Combination with Gradable Adjectives -- 5.1 Two Independently Motivated Assumptions -- 5.2 Proposal: Gèng Associating with Covert COMP -- 6 A Prediction: Superlative Force of Gèng -- 7 Gèng vs. Shènzhì: Parametric Variation -- 8 Conclusion -- References -- Internal Reading and Reciprocity -- 1 Introduction -- 2 Formal Preliminaries -- 3 Basic Formal Framework for Reciprocal Items -- 4 Further Refinements of the Framework.
4.1 Reciprocal Items in Non-Object Positions -- 4.2 Conjoined Phrases Containing Reciprocal Items -- 4.3 Downward Monotonic and Non-monotonic GQs -- 4.4 Weaker Reciprocal Meaning -- 4.5 Non-NP Triggers -- 5 Conclusion -- References -- Dot-to-Dot Semantic Representation -- 1 Introduction -- 2 Background and Examples -- 3 Steps for Deriving the Analysis -- 4 An Application: Querying the Text Based Encoding -- 5 Another Application: Assisting Old Japanese Annotation -- 6 Conclusion -- References -- Intonational Meaning at the Limits of Grammar -- 1 Overview -- 2 Prosodic Morphemes in English and Japanese -- 2.1 Final Rise/Fall in English and Japanese -- 2.2 Japanese Prosodic Morphemes and Pragmatic Particles -- 2.3 Expressive and Emotive Meaning in English Intonation -- 2.4 Compositionality of Intonation and SFPs -- 3 The Meaning of yo and yo -- 3.1 Premise and Expectation Management and yo -- 3.2 Formalism -- 3.3 Remarks on the Context Model -- 3.4 Meaning of yo -- 4 Prosodic Morphemes and Asking for Sympathy -- 4.1 Uses of yo and ``Pragmatic Reasoning'' -- 4.2 The Prosodic Morpheme in English -- References -- Comparing Degree-Based and Argumentative Analyses of Even -- 1 Introduction -- 2 Theoretical Background -- 2.1 Unlikelihood-Based Accounts of Even -- 2.2 The Degree-Based Account of Even -- 2.3 The Argumentative Account of Even -- 3 Comparing the Degree-Based and the Argumentative Analysis of Even -- 3.1 Methodology -- 3.2 Accounting for the Same Data with Even -- 3.3 Structural Similarity -- 3.4 A Final Potential Similarity: Interval-Based Instead of Points-Based Scales -- 4 Challenges and Open Questions -- 4.1 Cases with Irrelevant Alternatives -- 4.2 Cases of Mirative Even -- 5 Conclusion -- References -- Appositive Projection as Implicit Context Extension in Dependent Type Semantics -- 1 Introduction.
2 Properties of Appositive Relative Clauses -- 2.1 Discourse Properties -- 2.2 Scopal Properties -- 2.3 Anaphoric Dependencies -- 3 Framework -- 3.1 Dependent Type Theory -- 3.2 Underspecified Type -- 3.3 Type Checking and @-Elimination -- 3.4 Two-Stage Validation -- 4 Proposal -- 4.1 CI Type -- 4.2 Permutation -- 5 Predictions -- 5.1 Projection -- 5.2 Intra-sentential Anaphora -- 5.3 Inter-sentential Anaphora -- 5.4 ARC + Non-referential Quantifier -- 5.5 ARC + Referential Quantifier -- 5.6 Additional Analysis: Clause-Final ARCs -- 6 Related Work -- 6.1 DTS-Based Approach -- 6.2 Dynamic Approach -- 6.3 Orphan Approach -- 7 Conclusion -- References -- On the Semantics of Dependencies: Relative Clauses and Open Clausal Complements -- 1 Introduction -- 2 Foundational Principles of a Semantic Theory of Syntactic Dependencies -- 3 Relative Clauses and Wh-Extraction -- 4 Control Verbs and Open Clausal Complements -- 5 Taking Stock: The Question of Lexical Semantics -- 6 Bringing Everything Together -- 7 Conclusions -- References -- Semantics of Propositional Attitudes in Type-Theory of Algorithms -- 1 An Overview -- 2 Some Other Approaches to Propositional Attitudes -- 3 Syntax of Type-Theory of Algorithms -- 4 Gamma-Star Reduction Calculus of LAR -- 4.1 Extended Congruence Relation Between Terms -- 4.2 Reduction Rules of Extended LAR -- 4.3 Derived Reduction Rules -- 4.4 On the Denotational Semantics -- 5 Algorithmic Syntax-Semantics in Lar -- 6 Algorithmic Syntax-Semantics of Propositional Attitudes -- 7 Relation of the Type-Theory of Algorithms with Other Type-Theories for Semantics of Programming Languages -- 8 Conclusion: The General Algorithmic Pattern -- 9 Future Work -- References -- A Structured Witness Approach to Pair-List Answers of wh-Questions with Plural Definites -- 1 Introduction -- 2 Background.
3 Proposal: The Structured Witness Requesting Operator -- 4 Subclausal Compositionality in the Inquisitive Setting -- 5 Cardinals and Distributivity Within the wh-Restrictor -- 6 Issue-Preservation and Distributivity -- 7 Conclusion -- References -- Two Places Where We Need Plug-Negation in Update Semantics: Symmetrical Presupposition Filtering and Exclusive Disjunction -- 1 Background -- 2 Strong Kleene Trivalent Logic -- 3 Update Semantics -- 4 Proposal -- 4.1 Constraining the Plug-Negation -- 5 Discussions and a Remaining Issue -- 5.1 Discussion 1: Innocent Exclusion Does Not Avoid the Problem -- 5.2 Discussion 2: The Case of Conflicting Presuppositions and the Floating-A Theory -- 5.3 A Remaining Issue -- 6 Conclusion -- References -- Topology and Justified True Belief: A Baseless, Evidence-Free (and Pointless) Approach -- 1 Introduction -- 2 Topologies and Interior Operators -- 2.1 Definition and Basic Facts -- 2.2 Some Algebraic Remarks -- 3 The Evidence-Based Approach: A Review -- 3.1 From a Base to an Interior Operator -- 3.2 Evidence-Based Topological Semantics -- 4 Our Evidence-Free Approach: A Proposal -- 4.1 From a Monotone Map to a Topology -- 4.2 Evidence-Free Topological Semantics -- 4.3 Comparison to the Evidence-Based Approach -- 4.4 Induced Belief and Justified True Belief -- 4.5 Logic of Belief and Justified True Belief -- 5 Common Knowledge -- 6 Conclusion -- References -- Semantic-Pragmatic Account of Syntactic Structures -- 1 Introduction -- 2 Background -- 2.1 Discourse Representation Theory -- 2.2 Binding Theory of Presupposition -- 2.3 Specific Indefinites and Backgrounding -- 3 Instructional DRT -- 3.1 DRSs as Instructions -- 3.2 Syntactic Structures -- 3.3 Utterances as Programs -- 3.4 Formal Theory -- 3.5 Resolution Rules -- 4 Discussion -- 4.1 Syntactic Islands -- 4.2 Further Issues -- 5 Conclusions -- References.
Author Index.
Titolo autorizzato: Logic and Engineering of Natural Language Semantics  Visualizza cluster
ISBN: 3-031-60878-X
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996601560903316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Lecture Notes in Computer Science Series