The Mathematics of Language 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 - Livro de bolso

EAN (ISBN-13): 9783642143212
ISBN (ISBN-10): 3642143210
Livro de capa dura
Livro de bolso
Ano de publicação: 2010
Editor/Editora: Christian Ebert
296 Páginas
Peso: 0,470 kg
Língua: eng/Englisch

Livro na base de dados desde 2009-08-23T12:56:24-03:00 (Sao Paulo)
Página de detalhes modificada pela última vez em 2024-03-22T15:58:43-03:00 (Sao Paulo)
Número ISBN/EAN: 9783642143212

Número ISBN - Ortografia alternativa:
3-642-14321-0, 978-3-642-14321-2
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: ebert jens, jäger gerhard, jens christian, von michaelis, michael jäger, christ, christian kracht, michaëlis, marcus kracht
Título do livro: mathematics, how get all you want when germany, los angeles then and now, looking los angeles, august, bielefeld, los angeles above, usa, michael jäger, artificial intelligence language

---

Dados da editora

Autor: Christian Ebert; Gerhard Jäger; Jens Michaelis
Título: Lecture Notes in Computer Science; Lecture Notes in Artificial Intelligence; The Mathematics of Language - 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
Editora: Springer; Springer Berlin
297 Páginas
Ano de publicação: 2010-07-30
Berlin; Heidelberg; DE
Língua: Inglês
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
VIII, 297 p. 55 illus.

BC; Hardcover, Softcover / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Informatik; Mathematik; algorithms; bare grammars; categorial grammars; complexity; grammars; lambec calculus; logic; natural language; parsing; polynomial time; proof theory; second-order logic; selection; syllogistic logic; tree grammars; Compilers and Interpreters; Programming Techniques; Theory of Computation; Formal Languages and Automata Theory; Symbolic and Algebraic Manipulation; Discrete Mathematics in Computer Science; Computerprogrammierung und Softwareentwicklung; Theoretische Informatik; Mathematik für Informatiker; Diskrete Mathematik; EA

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.
Unique visibility State-of-the-art research Fast-track conference proceedings