The anaphora problem

DOI10.1006/INCO.1993.1042zbMath0776.68099OpenAlexW2072168443MaRDI QIDQ1260651

Eric Sven Ristad

Publication date: 30 August 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1993.1042

zbMATH Keywords

NP-completecomputational complexity of human language

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Natural language processing (68T50)

Related Items (3)

Capacity, complexity, construction ⋮ A simple logic of concepts ⋮ An analytic tableaux model for Deductive Mastermind empirically tested with a massively used online learning system

This page was built for publication: The anaphora problem