Role of constrained computational systems in natural language processing

DOI10.1016/S0004-3702(98)00065-4MaRDI QIDQ1274756zbMATH OpenOpenAlexWikidataFDO

Authors Aravind K. Joshi

Publication date 12 January 1999

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0004-3702(98)00065-4

zbMATH Keywords

abstract character of adjoiningadjoiningalmost parsecenter of an utterancecenteringcomplexity of inferenceconstrained formal systemscontrol of inferencefinite state transducerslexicalized grammarslexicalized tree-adjoining grammarslocal computations on complex structureslocal statistical computationslocality of structureslocally monadic structuremonadic predicatesubstitutionsupertaggingsupertagsuniversal and stipulative constraints

Mathematics Subject Classification ID

Artificial intelligence (68T99)

Recommendations

• Natural language processing and knowledge representation. Language for knowledge and knowledge for language
• COMPUTATIONAL COMPLEXITY THEORY AND NATURAL LANGUAGE: A PARADOX RESOLVED
• Natural language processing versus logic. Pros and cons on the dispute whether logic is useful in the computational interpretation of language
• scientific article; zbMATH DE number 1808285

Cited in

(3)

• Toward an enlargement of the role of natural languages in information processing, decision and control
• A Sequential Linear Constraint Programming Algorithm for NLP
• Language and intelligence, artificial vs. natural or what can and what cannot AI do with NL?

This page was built for publication: Role of constrained computational systems in natural language processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274756)