The Mathematics of Language [electronic resource] : 10th and 11th Biennial Conference, MOL 10, Los Angeles, CA, USA, July 28-30, 2007 and MOL 11, Bielefeld, Germany, August 20-21, 2009, Revised Selected Papers /
Material type: TextSeries: Lecture Notes in Artificial Intelligence ; 6149Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010Edition: 1st ed. 2010Description: VIII, 297 p. 55 illus. online resourceContent type:- text
- computer
- online resource
- 9783642143229
- Compilers (Computer programs)
- Computer programming
- Computer science
- Machine theory
- Computer science -- Mathematics
- Discrete mathematics
- Compilers and Interpreters
- Programming Techniques
- Theory of Computation
- Formal Languages and Automata Theory
- Symbolic and Algebraic Manipulation
- Discrete Mathematics in Computer Science
- 005.45 23
- QA76.76.C65
Dependency Structures Derived from Minimalist Grammars -- Deforesting Logical Form -- On the Probability Distribution of Typological Frequencies -- A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus -- LC Graphs for the Lambek Calculus with Product -- Proof-Theoretic Semantics for a Natural Language Fragment -- Some Interdefinability Results for Syntactic Constraint Classes -- Sortal Equivalence of Bare Grammars -- Deriving Syntactic Properties of Arguments and Adjuncts from Neo-Davidsonian Semantics -- On Monadic Second-Order Theories of Multidominance Structures -- The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars -- A Formal Foundation for A and A-bar Movement -- Without Remnant Movement, MGs Are Context-Free -- The Algebra of Lexical Semantics -- Phonological Interpretation into Preordered Algebras -- Relational Semantics for the Lambek-Grishin Calculus -- Intersecting Adjectives in Syllogistic Logic -- Creation Myths of GenerativeGrammar and the Mathematics of Syntactic Structures -- On Languages Piecewise Testable in the Strict Sense -- A Note on the Complexity of Abstract Categorial Grammars -- Almost All Complex Quantifiers Are Simple -- Constituent Structure Sets I.
There are no comments on this title.