COMPUTATIONAL COMPLEXITY THEORY AND NATURAL LANGUAGE: A PARADOX RESOLVED

DOI10.1515/THLI.1991.17.1-3.123zbMath0734.68078OpenAlexW2090550441MaRDI QIDQ3361909

Robert C. Berwick

Publication date: 1991

Published in: Theoretical Linguistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/thli.1991.17.1-3.123

zbMATH Keywords

computational complexity theory to natural language theories

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Natural language processing (68T50) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: COMPUTATIONAL COMPLEXITY THEORY AND NATURAL LANGUAGE: A PARADOX RESOLVED