MOL - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 83 from 83

2021

German Verb Particle Constructions in CCGPablo Lopez Alonso. mol 2021: 14-22 [doi]

Proceedings of the 17th Meeting on the Mathematics of Language, MOL 2021, Umeå, Sweden, December 13, 2021Henrik Björklund, Frank Drewes, editors, Association for Computational Linguistics, 2021. [doi]

More Efficiently Identifying the Tiers of Strictly 2-Local Tier-Based FunctionsPhillip Burness, Kevin McMullin. mol 2021: 38-49 [doi]

Strong Learning of some Probabilistic Multiple Context-Free GrammarsAlexander Clark. mol 2021: 23-37 [doi]

Embedding Intentional Semantic into Inquisitive SemanticsPhilippe de Groote, Valentin D. Richard. mol 2021: 64-74 [doi]

Tier-Based Modeling of Gradience and Distance-Based Decay in Phonological ProcessesKevin McMullin, Phillip Burness. mol 2021: 50-63 [doi]

A Generative Process for Lambek Categorial Proof NetsJinman Zhao, Gerald Penn. mol 2021: 1-13 [doi]

2017

Introducing Structure into Neural Network-Based Semantic ModelsStephen Clark. mol 2017: 127 [doi]

Latent-Variable PCFGs: Background and ApplicationsShay B. Cohen. mol 2017: 47-58 [doi]

DAG Automata for Meaning RepresentationFrank Drewes. mol 2017: 88-99 [doi]

A Proof-Theoretic Semantics for Transitive Verbs with an Implicit ObjectNissim Francez. mol 2017: 59-67 [doi]

(Re)introducing Regular Graph LanguagesSorcha Gilroy, Adam Lopez, Sebastian Maneth, Pijus Simonaitis. mol 2017: 100-113 [doi]

Graph Transductions and Typological Gaps in Morphological ParadigmsThomas Graf. mol 2017: 114-126 [doi]

How Many Stemmata with Root Degree k?Armin Hoenen, Steffen Eger, Ralf Gehrke. mol 2017: 11-21 [doi]

A Monotonicity Calculus and Its CompletenessThomas Icard, Lawrence S. Moss, William Tune. mol 2017: 75-87 [doi]

On the Logical Complexity of Autosegmental RepresentationsAdam Jardine. mol 2017: 22-35 [doi]

Proceedings of the 15th Meeting on the Mathematics of Language, MOL 2017, London, UK, July 13-14, 2017Makoto Kanazawa, Philippe de Groote, Mehrnoosh Sadrzadeh, editors, ACL, 2017. [doi]

Count-Invariance Including ExponentialsStepan Kuznetsov, Glyn Morrill, Oriol Valentín. mol 2017: 128-139 [doi]

Conjunctive Categorial GrammarsStepan Kuznetsov, Alexander Okhotin. mol 2017: 140-151 [doi]

Why We SpeakRohit Parikh. mol 2017: 68-74 [doi]

Extracting Forbidden Factors from Regular StringsetsJames Rogers, Dakotah Lambert. mol 2017: 36-46 [doi]

BE Is Not the Unique Homomorphism That Makes the Partee Triangle CommuteJunri Shimada. mol 2017: 1-10 [doi]

2015

Output Strictly Local FunctionsJane Chandlee, Rémi Eyraud, Jeffrey Heinz. mol 2015: 112-125 [doi]

Canonical Context-Free Grammars and Strong Learning: Two ApproachesAlexander Clark. mol 2015: 99-111 [doi]

Abstract Categorial Parsing as Linear Logic ProgrammingPhilippe de Groote. mol 2015: 15-25 [doi]

Topology of Language ClassesSean A. Fulop, David Kephart. mol 2015: 26-38 [doi]

A Refined Notion of Memory Usage for Minimalist ParsingThomas Graf, Brigitta Fodor, James Monette, Gianpaul Rachiele, Aunika Warren, Chong Zhang. mol 2015: 1-14 [doi]

A Concatenation Operation to Derive Autosegmental GraphsAdam Jardine, Jeffrey Heinz. mol 2015: 139-151 [doi]

Syntactic Polygraphs. A Formalism Extending Both Constituency and DependencySylvain Kahane, Nicolas Mazziotta. mol 2015: 152-164 [doi]

Lexical Semantics and Model Theory: Together at Last?András Kornai, Marcus Kracht. mol 2015: 51-61 [doi]

Proceedings of the 14th Meeting on the Mathematics of Language, MoL 2015, Chicago, IL, USA, July 25-26, 2015Marco Kuhlmann, Makoto Kanazawa, Gregory M. Kobele, editors, ACL, 2015. [doi]

How to Choose Successful Losers in Error-Driven Phonotactic LearningGiorgio Magri, René Kager. mol 2015: 126-138 [doi]

A Synopsis of Morphoid Type TheoryDavid McAllester. mol 2015: 75-86 [doi]

General Perspective on Distributionally Learnable ClassesRyo Yoshinaka. mol 2015: 87-98 [doi]

2013

On the Parameterized Complexity of Linear Context-Free Rewriting SystemsMartin Berglund, Henrik Björklund, Frank Drewes. mol 2013: 21-29 [doi]

The Frobenius Anatomy of Relative PronounsStephen Clark, Bob Coecke, Mehrnoosh Sadrzadeh. mol 2013: 41-51 [doi]

Why Letter Substitution Puzzles are Not Hard to Solve: A Case Study in Entropy and Probabilistic Search-ComplexityEric Corlett, Gerald Penn. mol 2013: 83-92 [doi]

Segmenting Temporal Intervals for Tense and AspectTim Fernando. mol 2013: 30-40 [doi]

Order and Optionality: Minimalist Grammars with AdjunctionMeaghan Fowlie. mol 2013: 12-20 [doi]

Learning Subregular Classes of Languages with Factored Deterministic AutomataJeffrey Heinz, James Rogers. mol 2013: 64-71 [doi]

Vowel Harmony and SubsequentialityJeffrey Heinz, Regine Lai. mol 2013: 52-63 [doi]

Distributions on Minimalist Grammar DerivationsTim Hunter, Chris Dyer. mol 2013: 1-11 [doi]

Grammars and Topic ModelsMark Johnson. mol 2013: 102-103 [doi]

Proceedings of the 13th Meeting on the Mathematics of Language, MoL 2013, Sofia, Bulgaria, August 9, 2013András Kornai, Marco Kuhlmann, editors, ACL, 2013. [doi]

Structure Learning in Weighted LanguagesAndrás Kornai, Attila Zséder, Gábor Recski. mol 2013: 72-82 [doi]

Investigating Connectivity and Consistency Criteria for Phrase Pair Extraction in Statistical Machine TranslationSpyros Martzoukos, Christophe Costa Florêncio, Christof Monz. mol 2013: 93-101 [doi]

2011

A Datalog Recognizer for Almost Affine λ-CFGsPierre Bourreau, Sylvain Salvati. mol 2011: 21-38 [doi]

A Language Theoretic Approach to Syntactic StructureAlexander Clark. mol 2011: 39-56 [doi]

The Generative Power of Probabilistic and Weighted Context-Free GrammarsTimothy A. D. Fowler. mol 2011: 57-71 [doi]

Invariance Properties of Quantifiers and Multiagent Information ExchangeNina Gierasimczuk, Jakub Szymanik. mol 2011: 72-89 [doi]

Insertion Minimalist Grammars: Eliminating Redundancies between Merge and MoveTim Hunter. mol 2011: 90-107 [doi]

On Type Coercion in Compositional and Lexical SemanticsPer Anker Jensen, Carl Vikner. mol 2011: 108-125 [doi]

The Mathematics of Language - 12th Biennial Conference, MOL 12, Nara, Japan, September 6-8, 2011. ProceedingsMakoto Kanazawa, András Kornai, Marcus Kracht, Hiroyuki Seki, editors, Volume 6878 of Lecture Notes in Computer Science, Springer, 2011. [doi]

Disentangling Notions of Specifier Impenetrability: Late Adjunction, Islands, and Expressive PowerGregory M. Kobele, Jens Michaelis. mol 2011: 126-142 [doi]

Tree Transformations and DependenciesAndreas Maletti. mol 2011: 1-20 [doi]

Approximate Bit Vectors for Fast UnificationMatthew Skala, Gerald Penn. mol 2011: 158-173 [doi]

Event Semantics and Abstract Categorial GrammarYoad Winter, Joost Zwarts. mol 2011: 174-191 [doi]

Regular Growth Automata: Properties of a Class of Finitely Induced Infinite MachinesChristian Wurm. mol 2011: 192-208 [doi]

A Co-inductive Language and Truth DegreesShunsuke Yatabe. mol 2011: 209-226 [doi]

What Is the Basic Semantic Unit of Chinese Language? A Computational Approach Based on Topic ModelsQi Zhao, Zengchang Qin, Tao Wan. mol 2011: 143-157 [doi]

2010

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 PapersChristian Ebert, Gerhard Jäger, Jens Michaelis, editors, Volume 6149 of Lecture Notes in Computer Science, Springer, 2010. [doi]

2009

Dependency Structures Derived from Minimalist GrammarsMarisa Ferrara Boston, John T. Hale, Marco Kuhlmann. mol 2010: 1-12 [doi]

Deforesting Logical FormZhong Chen, John T. Hale. mol 2010: 13-28 [doi]

On the Probability Distribution of Typological FrequenciesMichael Cysouw. mol 2010: 29-35 [doi]

LC Graphs for the Lambek Calculus with ProductTimothy A. D. Fowler. mol 2010: 44-55 [doi]

A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek CalculusTimothy A. D. Fowler. mol 2010: 36-43 [doi]

Proof-Theoretic Semantics for a Natural Language FragmentNissim Francez, Roy Dyckhoff. mol 2010: 56-71 [doi]

Some Interdefinability Results for Syntactic Constraint ClassesThomas Graf. mol 2010: 72-87 [doi]

Sortal Equivalence of Bare GrammarsThomas Holder. mol 2010: 88-102 [doi]

Deriving Syntactic Properties of Arguments and Adjuncts from Neo-Davidsonian SemanticsTim Hunter. mol 2010: 103-116 [doi]

On Monadic Second-Order Theories of Multidominance StructuresStephan Kepser. mol 2010: 117-128 [doi]

The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree GrammarsStephan Kepser, James Rogers. mol 2010: 129-144 [doi]

Without Remnant Movement, MGs Are Context-FreeGregory M. Kobele. mol 2010: 160-173 [doi]

A Formal Foundation for A and A-bar MovementGregory M. Kobele. mol 2010: 145-159 [doi]

The Algebra of Lexical SemanticsAndrás Kornai. mol 2010: 174-199 [doi]

Phonological Interpretation into Preordered AlgebrasYusuke Kubota, Carl Pollard. mol 2010: 200-209 [doi]

Relational Semantics for the Lambek-Grishin CalculusNatasha Kurtonina, Michael Moortgat. mol 2010: 210-222 [doi]

Intersecting Adjectives in Syllogistic LogicLawrence S. Moss. mol 2010: 223-237 [doi]

Creation Myths of Generative Grammar and the Mathematics of ::::Syntactic::::::::Structures::::Geoffrey K. Pullum. mol 2010: 238-254 [doi]

On Languages Piecewise Testable in the Strict SenseJames Rogers, Jeffrey Heinz, Gil Bailey, Matt Edlefsen, Molly Visscher, David Wellcome, Sean Wibel. mol 2010: 255-265 [doi]

A Note on the Complexity of Abstract Categorial GrammarsSylvain Salvati. mol 2010: 266-271 [doi]

Almost All Complex Quantifiers Are SimpleJakub Szymanik. mol 2010: 272-280 [doi]

Constituent Structure Sets IHiroyuki Uchida, Dirk Bury. mol 2010: 281-296 [doi]

Sign in or sign up to see more results.

runs on WebDSL