Logical Aspects of Computational Linguistics 4th International Conference, LACL 2001 Le Croisic, France, June 27–29, 2001 Proceedings / [electronic resource] :
edited by Philippe Groote, Glyn Morrill, Christian Retoré.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2001.
- VIII, 311 pp. online resource.
- Lecture Notes in Computer Science, 2099 0302-9743 ; .
- Lecture Notes in Computer Science, 2099 .
Invited Talks -- Structural Equations in Language Learning -- On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks -- Contributed Papers -- A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique -- An Algebraic Approach to French Sentence Structure -- Deductive Parsing of Visual Languages -- Lambek Grammars Based on Pregroups -- An Algebraic Analysis of Clitic Pronouns in Italian -- Consistent Identification in the Limit of Any of the Classes k-Valued Is NP-hard -- Polarized Non-projective Dependency Grammars -- On Mixing Deduction and Substitution in Lambek Categorial Grammars -- A Framework for the Hyperintensional Semantics of Natural Language with Two Implementations -- A Characterization of Minimalist Languages -- of Speech Tagging from a Logical Point of View -- Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars -- Recognizing Head Movement -- Combinators for Paraconsistent Attitudes -- Combining Syntax and Pragmatic Knowledge for the Understanding of Spontaneous Spoken Sentences -- Atomicity of Some Categorially Polyvalent Modifiers.
9783540481997
10.1007/3-540-48199-0 doi
Computer science.
Artificial intelligence.
Computer Science.
Artificial Intelligence (incl. Robotics).
Mathematical Logic and Formal Languages.
Q334-342 TJ210.2-211.495
006.3
Invited Talks -- Structural Equations in Language Learning -- On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks -- Contributed Papers -- A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique -- An Algebraic Approach to French Sentence Structure -- Deductive Parsing of Visual Languages -- Lambek Grammars Based on Pregroups -- An Algebraic Analysis of Clitic Pronouns in Italian -- Consistent Identification in the Limit of Any of the Classes k-Valued Is NP-hard -- Polarized Non-projective Dependency Grammars -- On Mixing Deduction and Substitution in Lambek Categorial Grammars -- A Framework for the Hyperintensional Semantics of Natural Language with Two Implementations -- A Characterization of Minimalist Languages -- of Speech Tagging from a Logical Point of View -- Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars -- Recognizing Head Movement -- Combinators for Paraconsistent Attitudes -- Combining Syntax and Pragmatic Knowledge for the Understanding of Spontaneous Spoken Sentences -- Atomicity of Some Categorially Polyvalent Modifiers.
9783540481997
10.1007/3-540-48199-0 doi
Computer science.
Artificial intelligence.
Computer Science.
Artificial Intelligence (incl. Robotics).
Mathematical Logic and Formal Languages.
Q334-342 TJ210.2-211.495
006.3