| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465515403316 |
|
|
Titolo |
Logical Aspects of Computational Linguistics [[electronic resource] ] : 6th International Conference, LACL 2011, Montpellier, France, June 29 -- July 1, 2011. Proceedings / / edited by Sylvain Pogodalla, Jean-Philippe Prost |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2011.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 283 p. 50 illus., 7 illus. in color.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Artificial Intelligence ; ; 6736 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Artificial intelligence |
Mathematical logic |
Computational linguistics |
Artificial Intelligence |
Mathematical Logic and Formal Languages |
Computational Linguistics |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
Intro -- Title -- Preface -- Organization -- Table of Contents -- Encoding Phases Using Commutativity and Non-commutativity in a Logical Framework -- Commutativity vs. Non-commutativity in Standard MCG and Phases -- Minimalist Categorial Grammars -- Partially Commutative Logic (PCL) -- Labels Encoding Word Order -- Lexicon -- Rules of MCG -- Phases -- Encoding Phases in MCG -- Derivation of a Simple Sentence -- Question -- Blocked Derivation with PIC -- Conclusion -- References -- Using Logic in the Generation of Referring Expressions -- Generating Referring Expressions -- Measuring Expressive Power -- Choosing the Appropriate Language -- Defining Sameness -- GRE via Simulator Sets -- GRE via Building Simulated Models -- Combining GRE Methods -- On the Size of Referring Expressions -- Conclusions -- References -- Polarized Classical Non-associative Lambek Calculus and Formal Semantics -- Introduction -- Classical Non-associative Lambek Calculus -- Polarized |
|
|
|
|
|
|
|
|
|
CNL -- Motivation -- Polarization and Derivational Semantics -- Lexical Semantics -- Comparing Provability in CNLpol and CNL -- Phase Spaces -- Cut Admissibility and Completeness w.r.t. CNL -- Related Topics -- Focused Proof Search -- The Lambek-Grishin Calculus -- Normalization by Evaluation -- References -- The Product-Free Lambek-Grishin Calculus Is NP-Complete -- Introduction -- Lambek-Grishin Calculus -- Preliminaries -- Derivation Length -- Additional Notations -- Derived Rules of Inference -- Type Similarity -- Reduction from SAT to LG -- Intuition -- Only-If Part -- If Part -- Conclusion -- Discussion and Future Work -- References -- Copredication, Quantification and Frames -- Introduction -- Frames and Thick Particulars -- Dynamic Generalized Quantifiers -- Treating Copredication -- Treating Lexical Innovation -- How Many Books are on the Shelf? -- Conclusion -- References. |
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types -- Introduction -- Categorial Dependency Grammars with Extended Iteration Types -- Categorial Dependency Grammars -- Dispersed and Choice Iterations -- Incremental Learning -- Incremental Learning of Dispersed Iteration -- Incremental Learning of Choice Iteration -- Conclusion -- References -- Closure Properties of Minimalist Derivation Tree Languages -- Preliminaries and Notation -- Minimalist Derivation Tree Languages -- P-Closure Properties -- Minimalist Grammars with Regular Control -- References -- Well-Nestedness Properly Subsumes Strict Derivational Minimalism -- Introduction -- Multiple Context-Free Grammars -- Separating MCFLwn from MCFL -- Separating MCFLmb from MCFLwn -- Conclusion -- References -- Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages -- Formal Preliminaries -- Minimalist Grammars -- Languages -- Closure under Intersection with Regular Sets -- Applications -- Semantics -- Complexity Filters -- Distributed Morphology -- Conclusion -- References -- Do Dialogues Have Content? -- Introduction -- The Content of a Dialogue -- The Challenge from Semantic Plasticity -- Semantic Coordination and Semantic Plasticity -- Semantic Plasticity and Inference -- Semantic Plasticity and Classical Model-Theoretic Semantics -- An Alternative: TTR -- Representing Concepts Using TTR -- A TTR Account of the ``Panda'' Example -- TTR and Semantic Plasticity -- Indeterminate Extensions -- Model-Theoretic Sensor Semantics? -- Conclusion -- References -- Contextual Analysis of Word Meanings in Type-Theoretical Semantics -- Introduction -- Type-Theoretical Semantics -- A Brief Overview -- Embedded Logic -- Dependent Types -- Coercive Subtyping -- Universes -- Sense Selection via Overloading -- Sense Enumeration. |
Simple Sense Selection via Overloading Based on Coercive Subtyping -- Representation of Contexts: Coercion Contexts and Local Coercions -- Coercion Contexts in Type Theory -- Local Coercions in Terms -- Structured Lexical Entries: Copredication and Beyond -- Copredication and Dot-Types -- Generative Lexical Entries as -types -- Implementations in Coq -- Conclusion -- References -- Logic Programming of the Displacement Calculus -- Introduction -- The Displacement Calculus -- Focusing -- Logic Programming -- Conclusion -- References -- Conditional Logic Cb and Its Tableau System -- Introduction -- Conditional Sentences in Natural Language and Classical Logic -- Modal Tableau -- Conditional Logic -- Syntax of Conditional Logic -- Semantics of Conditional Logic -- Previous Study -- C+ -- S -- C1 , C2 -- Proposal: A New Conditional Logic Cb -- Empirical Verification -- Soundness -- Completeness -- Conclusion and Future Work -- References -- Are (Linguists') Propositions (Topos) |
|
|
|
|
|
|
|
|
|
Propositions? -- Introduction -- Lambek's Categorical Semantics -- Are Propositions Propositions? -- Preboolean Algebras -- Background on Ultrafilters -- Hyperintensional Categorical Semantics -- Conclusion -- References -- Event in Compositional Dynamic Semantics -- Event Semantics -- Dynamic Semantics and Discourse Relation -- Dynamic Semantics -- A New Approach to Dynamics -- Discourse Relations and Discourse Structure -- EventinDynamicSemantics -- Event-Based Sentential Semantics -- Event-Based Discourse Semantics -- Comparison with Other Related Works -- Conclusion and Future Work -- References -- Using Tree Transducers for Grammatical Inference -- Introduction -- Learning Categorial Grammars -- Presentation of the Paris VII Corpus -- G-transducer -- Formal Definition -- Transduction Rules -- Implementation -- Corpus Corrector -- Transducer -- Evaluation. |
Conclusion and Future Work -- References -- Distributional Learning of Abstract Categorial Grammars -- Introduction -- Simply Typed Lambda Calculus -- Abstract Categorial Grammars -- Definition -- Encoding of Context-Free Formalisms in ACGs -- Distributional Learning of ACGs -- Examples of Learning Algorithms -- Substitutable ACGs -- ACGs with the Finite Kernel Property -- Discussions -- References -- Some Generalised Comparative Determiners -- Introduction -- Formal Preliminaries -- Some Unary Comparative Determiners -- Some Binary Generalised Determiners -- Conclusive Remarks -- References -- Author Index. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 6th International Conference on Logical Aspects of Computational Linguistics, LACL 2011, held in Montpellier, France, in June/July 2011. The 18 revised full papers presented were carefully reviewed and selected from 31 submissions. The papers address a wide range of logical and formal methods in computational linguistics such as type-theoretic grammars, dependency grammars, formal language theory, grammatical inference, minimalism, generation, and lexical and formal semantics. |
|
|
|
|
|
|
|
| |