Theoretical Issues in Natural Language Processing

Regular price €65.99
Quantity:
Delivery/Collection within 10-20 working days
Shipping & Delivery
advanced natural language theory research
artificial intelligence
Augmented Transition Networks
Category=UYQL
cognitive modeling
computational linguistics
Computational Root
Context Free Grammar
Definite Noun Phrases
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
formal semantics
Functional Unification Grammar
grammatical formalisms
Illocutionary Acts
Indefinite Noun Phrases
Knowledge Acquisition Phase
Machine Readable Dictionaries
metaphor analysis
Model Theoretic Semantics
Natural Language Generation Systems
Natural Language Processing
Natural Language Processing System
NLP Research
Noun Phrases
Phrase Structure Grammar
Predicate Argument Structure
Real Semantics
reference resolution
Referring Act
Semantic Information
Speaker's Description
Third Tinlap Workshop
Tree Adjoining Grammar
Unification Formalism
Unification Grammar
Vice Versa

Product details

  • ISBN 9780805801842
  • Weight: 490g
  • Dimensions: 152 x 229mm
  • Publication Date: 01 Dec 1989
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Product Form: Paperback
Secure checkout Fast Shipping Easy returns

Accompanying continued industrial production and sales of artificial intelligence and expert systems is the risk that difficult and resistant theoretical problems and issues will be ignored. The participants at the Third Tinlap Workshop, whose contributions are contained in Theoretical Issues in Natural Language Processing, remove that risk. They discuss and promote theoretical research on natural language processing, examinations of solutions to current problems, development of new theories, and representations of published literature on the subject. Discussions among these theoreticians in artificial intelligence, logic, psychology, philosophy, and linguistics draw a comprehensive, up-to-date picture of the natural language processing field.