On the public citation graph

Categorial grammars determined from linguistic data by unification

0 signed · 88 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot

Foundations of Logic Programming

inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot

Foundations of Logic Programming

inferredcites →https://doi.org/10.1007/978-94-009-3673-7_11openalex-snapshot

The Logic of Types

inferredcites →https://doi.org/10.1007/978-94-009-4540-1openalex-snapshot

Essays in Logical Semantics

inferredcites →https://doi.org/10.1007/978-94-009-6404-4openalex-snapshot

Boolean Semantics for Natural Language

inferredcites →https://doi.org/10.1007/978-94-015-6878-4openalex-snapshot

Categorial Grammars and Natural Language Structures

inferredcites →https://doi.org/10.1007/978-94-015-6878-4_13openalex-snapshot

Multi-Dimensional Compositional Functions as a Basis for Grammatical Analysis

inferredcites →https://doi.org/10.1080/00029890.1958.11989160openalex-snapshot

The Mathematics of Sentence Structure

inferredcites →https://doi.org/10.1515/9783112329580openalex-snapshot

Categorial Investigations

inferredcites →https://doi.org/10.2307/415178openalex-snapshot

Boolean semantics for natural language . By Edward L. Keenan and Leonard M. Faltz (Synthese language library, 23.) Dordrecht & Boston: Reidel, 1985. Pp. xii, 387. f 145.00

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11422532_13openalex-snapshot

Learnable Classes of General Combinatory Grammars

inferred← citeshttps://doi.org/10.1007/11422532_20openalex-snapshot

When Categorial Grammars Meet Regular Grammatical Inference

inferred← citeshttps://doi.org/10.1007/3-540-40006-0_7openalex-snapshot

An Abductive Mechanism for Natural Language Processing Based on Lambek Calculus

inferred← citeshttps://doi.org/10.1007/3-540-44411-4_11openalex-snapshot

Towards High Speed Grammar Induction on Large Text Corpora

inferred← citeshttps://doi.org/10.1007/3-540-45790-9_5openalex-snapshot

Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard

inferred← citeshttps://doi.org/10.1007/3-540-48199-0_1openalex-snapshot

Structural Equations in Language Learning

inferred← citeshttps://doi.org/10.1007/3-540-48199-0_10openalex-snapshot

On Mixing Deduction and Substitution in Lambek Categorial Grammars

inferred← citeshttps://doi.org/10.1007/3-540-48199-0_8openalex-snapshot

Consistent Identification in the Limit of Any of the Classes k-Valued Is NP-hard

inferred← citeshttps://doi.org/10.1007/978-3-030-30077-7_6openalex-snapshot

On Categorial Grammatical Inference and Logical Information Systems

inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_19openalex-snapshot

Partial Learning Using Link Grammars Data

inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_7openalex-snapshot

Learnability of Pregroup Grammars

inferred← citeshttps://doi.org/10.1007/978-3-540-39432-7_56openalex-snapshot

The Learning and Emergence of Mildly Context Sensitive Languages

inferred← citeshttps://doi.org/10.1007/978-3-540-39985-8_19openalex-snapshot

Learning reversible categorial grammars from structures

inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_8openalex-snapshot

On the Complexity of Consistent Identification of Some Classes of Structure Languages

inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_16openalex-snapshot

How to Split Recursive Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_17openalex-snapshot

Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach

inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_30openalex-snapshot

Tarski’s Principle, Categorial Grammars and Learnability

inferred← citeshttps://doi.org/10.1007/978-3-642-21490-5_6openalex-snapshot

Good Types Are Useful for Learning

inferred← citeshttps://doi.org/10.1007/978-3-642-22221-4_16openalex-snapshot

Using Tree Transducers for Grammatical Inference

inferred← citeshttps://doi.org/10.1007/978-3-642-22221-4_6openalex-snapshot

On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types

inferred← citeshttps://doi.org/10.1007/978-3-642-31262-5_1openalex-snapshot

Logical Grammars, Logical Theories

inferred← citeshttps://doi.org/10.1007/978-3-642-31555-8_1openalex-snapshot

Classical Categorial Grammars: AB Grammars

inferred← citeshttps://doi.org/10.1007/978-3-642-32024-8_2openalex-snapshot

Two Models of Learning Iterated Dependencies

inferred← citeshttps://doi.org/10.1007/978-3-642-39787-5_38openalex-snapshot

Learning to Map Chinese Sentences to Logical Forms

inferred← citeshttps://doi.org/10.1007/978-3-642-54789-8_7openalex-snapshot

Learning Lambek Grammars from Proof Frames

inferred← citeshttps://doi.org/10.1007/978-94-011-5108-5_20openalex-snapshot

The Ajdukiewicz Calculus, Polish Notation and Hilbert-Style Proofs

inferred← citeshttps://doi.org/10.1007/978-94-017-3598-8_12openalex-snapshot

Type Logics in Grammar

inferred← citeshttps://doi.org/10.1007/bf00173697openalex-snapshot

Identification in the limit of categorial grammars

inferred← citeshttps://doi.org/10.1007/bfb0052163openalex-snapshot

Connected sets of types and categorial consequence

inferred← citeshttps://doi.org/10.1007/bfb0054061openalex-snapshot

Meaning helps learning syntax

inferred← citeshttps://doi.org/10.1007/s10849-004-4509-0openalex-snapshot

Semantic bootstrapping of type-logical grammar

inferred← citeshttps://doi.org/10.1007/s10849-005-4509-8openalex-snapshot

Semantic Bootstrapping of Type-Logical Grammar

inferred← citeshttps://doi.org/10.1007/s10849-006-9027-9openalex-snapshot

Book Review

inferred← citeshttps://doi.org/10.1007/s10849-009-9108-7openalex-snapshot

Grammar Induction by Unification of Type-logical Lexicons

inferred← citeshttps://doi.org/10.1007/s10849-025-09445-9openalex-snapshot

On the expressive power of categorial grammars with unique category assignment

inferred← citeshttps://doi.org/10.1007/s10994-021-05947-2openalex-snapshot

Incremental learning of iterated dependencies

inferred← citeshttps://doi.org/10.1007/s11168-007-9026-2openalex-snapshot

Learnability of Type-logical Grammars

inferred← citeshttps://doi.org/10.1007/s11168-007-9034-2openalex-snapshot

A Chronicle of Type Logical Grammar: 1935–1994

inferred← citeshttps://doi.org/10.1007/s11225-007-9036-yopenalex-snapshot

On Learnability of Restricted Classes of Categorial Grammars

inferred← citeshttps://doi.org/10.1007/s11225-007-9085-2openalex-snapshot

Learnability of Pregroup Grammars

inferred← citeshttps://doi.org/10.1016/b978-0-444-53726-3.00002-5openalex-snapshot

Categorial Type Logics

inferred← citeshttps://doi.org/10.1016/b978-044481714-3/50005-9openalex-snapshot

Categorial Type Logics

inferred← citeshttps://doi.org/10.1016/b978-044481714-3/50016-3openalex-snapshot

Mathematical Linguistics and Proof Theory

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.006openalex-snapshot

k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.05.016openalex-snapshot

On families of categorial grammars of bounded value, their learnability and related complexity questions

inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70676-7openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00266-1openalex-snapshot

Algebraic structures in categorial grammar

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80844-2openalex-snapshot

k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82577-0openalex-snapshot

Learnability of type-logical grammars

inferred← citeshttps://doi.org/10.1017/cbo9781139013574openalex-snapshot

Unification Grammars

inferred← citeshttps://doi.org/10.1017/cbo9781139032636openalex-snapshot

Lambda Calculus with Types

inferred← citeshttps://doi.org/10.1023/a:1004926032425openalex-snapshot

Infinite Set Unification with Application to Categorial Grammar

inferred← citeshttps://doi.org/10.1023/a:1024647725258openalex-snapshot

From Proof Trees in Lambek Calculus to Ajdukiewicz Bar-Hillel Elimination Binary Trees

inferred← citeshttps://doi.org/10.1023/a:1025425420619openalex-snapshot

Resource Logics and Minimalist Grammars

inferred← citeshttps://doi.org/10.1023/a:1025455403876openalex-snapshot

Generative Grammars in Resource Logics

inferred← citeshttps://doi.org/10.1051/ita:2007055openalex-snapshot

Learning discrete categorial grammars from structures

inferred← citeshttps://doi.org/10.1080/01445349708837283openalex-snapshot

Head or tail? de morgan on the bounds of traditional logic

inferred← citeshttps://doi.org/10.1080/11663081.1994.10510831openalex-snapshot

Learning categorial grammar by unification with negative constraints

inferred← citeshttps://doi.org/10.1093/obo/9780199772810-0244openalex-snapshot

Categorial Grammar

inferred← citeshttps://doi.org/10.1162/coli.2007.33.3.355openalex-snapshot

CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank

inferred← citeshttps://doi.org/10.1163/9789004311763_004openalex-snapshot

Syntactic Categories and Types: Ajdukiewicz and Modern Categorial Grammars

inferred← citeshttps://doi.org/10.1515/9783111566665.523openalex-snapshot

Categorial grammar: between natural language and formal logic

inferred← citeshttps://doi.org/10.1515/slgr-2015-0029openalex-snapshot

On the Learnability of Classes of Minimal Grammars With Respect to Some Linear Preordering Relations

inferred← citeshttps://doi.org/10.15398/jlm.v3i1.92openalex-snapshot

A type-logical treebank for French

inferred← citeshttps://doi.org/10.3115/1075096.1075141openalex-snapshot

k-valued non-associative Lambek categorial grammars are not learnable from strings

inferred← citeshttps://doi.org/10.3115/1603899.1603955openalex-snapshot

Syntactico-semantic learning of categorial grammars

inferred← citeshttps://doi.org/10.3166/ria.20.775-804openalex-snapshot

Learning Recursive Automata from Positive Examples

inferred← citeshttps://doi.org/10.3233/fun-2002-49403openalex-snapshot

Optimal Unification and Learning Algorithms for Categorial Grammars

inferred← citeshttps://doi.org/10.3233/fun-2004-623-407openalex-snapshot

Optimal Unification of Infinite Sets of Types

inferred← citeshttps://doi.org/10.3233/fun-2007-81406openalex-snapshot

From Unification Compactness to Learnability

inferred← citeshttps://doi.org/10.48456/tr-675openalex-snapshot

Computational models for first language acquisition

inferred← citeshttps://doi.org/10.48550/arxiv.0805.2303openalex-snapshot

Graph Algorithms for Improving Type-Logical Proof Search

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0608033openalex-snapshot

A Study on Learnability for Rigid Lambek Grammars

inferred← citeshttps://doi.org/10.53437/nhpa7366openalex-snapshot

Towards a Semantic-based Theory of Language Learning

inferred← citeshttps://doi.org/10.53437/zrgvzd20openalex-snapshot

Grammatical Inference by specialization as a state splitting strategy

inferred← citeshttps://doi.org/10.70675/0a04d0b4z81acz4310z824fzba94167b0966openalex-snapshot

Apprentissage de grammaires catégorielles : transducteurs d’arbres et clustering pour induction de grammaires catégorielles

inferred← citeshttps://doi.org/10.70675/c02cc7a9z936ez4381zba09zf0b8276feb1bopenalex-snapshot

Modeling Preferences for Ambiguous Utterance Interpretations

inferred← citeshttps://doi.org/10.7551/mitpress/8370.003.0018openalex-snapshot

Extraction of Type-Logical Supertags from the Spoken Dutch Corpus

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.