Computational consequences of agreement and ambiguity in natural language

DOI10.1016/0022-2496(89)90018-7zbMath0747.92034OpenAlexW2009632454MaRDI QIDQ1812775

Robert C. Berwick, Eric Sven Ristad

Publication date: 25 June 1992

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/6526

zbMATH Keywords

NP-hardambiguityagreementasymptotic complexity functionparsing natural languagessatisfiability problem of propositional logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic of natural languages (03B65) Linguistics (91F20) Mathematical psychology (91E99)

Related Items (2)

Computational structure of GPSG models ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods

Cites Work

• Optimization by Simulated Annealing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational consequences of agreement and ambiguity in natural language