NLPExplorer
Papers
Venues
Authors
Authors Timeline
Field of Study
URLs
ACL N-gram Stats
TweeNLP
API
Team
Normal Form Theorem Proving for the Lambek Calculus
Mark Hepple
|
Paper Details:
Year: 1990
Venue:
COLING |
Citations
URL
THE COMPLEXITY OF PARSING WITH EXTENDED CATEGORIAL GRAMMARS
Esther Konig
|
CHART PARSING LAMBEK GRAMMARS: MODAL EXTENSIONS AND INCREMENTALITY
Mark Hepple
|
A Compilation-Chart Method for Linear Categorial Deduction
Mark Hepple
|
PROOF FIGURES AND STRUCTURAL OPERATORS FOR CATEGORIAL GRAMMAR
Guy Barry
|
Mark Hepple
|
Neil Leslie
|
Glyn Morrill
|
Geometry of Lexico-Syntactic Interaction
Glyn Morrill
|
Incremental processing and acceptability
Glyn Morrill
|
The Combinatory Morphemic Lexicon
Cem Bozsahin
|
EFFICIENT INCREMENTAL PROCESSING WITH CATEGORIAL GRAMMAR
Mark Hepple
|
Maximal Incrementality in Linear Categorial Deduction
Mark Hepple
|
No URLs Found
Field Of Study
Linguistic Trends
Syntax
Language
English
Similar Papers
DATR: A Language for Lexical Knowledge Representation
Roger Evans
|
Gerald Gazdar
|
Generating and Interpreting Referring Expressions as Belief State Planning and Plan Recognition
Dustin Smith
|
Henry Lieberman
|
RECSA: Resource for Evaluating Cross-lingual Semantic Annotation
Achim Rettinger
|
Lei Zhang
|
Daša Berović
|
Danijela Merkler
|
Matea Srebačić
|
Marko Tadić
|
Exploiting Lexical Regularities in Designing Natural Language Systems
Boris Katz
|
Beth Levin
|
Book Reviews: Speaking: From Intention to Articulation
M. Martin Taylor
|
Insup Taylor
|