No article text was recorded for this version.
spurious ambiguity
Version 2 of 234 papers35 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Polynomial Time Parsing of Combinatory Categorial Grammars
- Blog: Semantic Exploration with Adaptive Gating for Efficient Problem Solving with Language Models
- Blog: Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
- Blog: Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures
- Blog: Dealing with Spurious Ambiguity in Learning ITG-based Word Alignment
- Blog: Efficient Processing of Flexible Categorial Grammar
- Blog: LCGbank: A Corpus of Syntactic Analyses Based on Proof Nets
- Blog: Shallow Semantic Trees for SMT
- Blog: Shift-Reduce CCG Parsing with a Dependency Model
- Blog: A distributed inflection model for translating into morphologically rich languages
- Blog: Normal-form parsing for Combinatory Categorial Grammars with generalized composition and type-raising
- Blog: The Treatment of Movement-Rules in a LFG-Parser
- Blog: LSTM Shift-Reduce CCG Parsing
- Blog: Efficient Incremental Processing with Categorial Grammar
- Blog: Dependency Hashing for n-best CCG Parsing
- Blog: An Optimal Tabular Parsing Algorithm
- Blog: Using an Annotated Language Corpus as a Virtual Stochastic Grammar
- Blog: Efficient Parsing for French
- Blog: A Tabular Method for Island-Driven Context-Free Grammar Parsing
- Blog: Lattice-Based Word Identification in CLARE
- Blog: Log-Linear Models for Wide-Coverage CCG Parsing
- Blog: Parsing the WSJ Using CCG and Log-Linear Models
- Blog: On the Interaction of Syntax and Semantics in a Syntactically Guided Caseframe Parser
- Blog: A Definite Clause Version of Categorial Grammar
- Blog: Parsing as Natural Deduction
- Blog: A Lazy way to Chart-Parse with Categorial Grammars
- Blog: A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms
- Blog: Maximal Incrementality in Linear Categorial Deduction
- Blog: Efficient Normal-Form Parsing for Combinatory Categorial Grammar
- Blog: Two Improvements to Left-to-Right Decoding for Hierarchical Phrase-based Machine Translation
- Blog: A Psycholinguistically Motivated Parser for CCG
- Blog: Predictive Combinators: a Method for Efficient Processing of Combinatory Categorial Grammars
- Blog: Bottom-Up Parsing Extending Context-Freeness in a Process Grammar Processor
- Blog: Normal Form Theorem Proving for the Lambek Calculus
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_spurious_ambiguity_e8317897,
title = {spurious ambiguity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/spurious-ambiguity/rdr_e8317897c3d34db5899b1f710c0c2681},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 2, frozen text):
@misc{lacuna_spurious_ambiguity_e8317897_v2,
title = {spurious ambiguity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/spurious-ambiguity/rdr_e8317897c3d34db5899b1f710c0c2681/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-22},
}