Ambiguity Resolution in Language Learning

Computational and Cognitive Models
 
 
Centre for the Study of Language & Information (Verlag)
  • erschienen am 1. Juni 1997
 
  • Buch
  • |
  • Softcover
  • |
  • 230 Seiten
978-1-57586-074-9 (ISBN)
 
This volume is concerned with how ambiguity and ambiguity resolution are learned, that is, with the acquisition of the different representations of ambiguous linguistic forms and the knowledge necessary for selecting among them in context. Schütze concentrates on how the acquisition of ambiguity is possible in principle and demonstrates that particular types of algorithms and learning architectures (such as unsupervised clustering and neural networks) can succeed at the task. Three types of lexical ambiguity are treated: ambiguity in syntactic categorisation, semantic categorisation, and verbal subcategorisation. The volume presents three different models of ambiguity acquisition: Tag Space, Word Space, and Subcat Learner, and addresses the importance of ambiguity in linguistic representation and its relevance for linguistic innateness.
  • Englisch
  • New York
  • |
  • USA
  • Für Beruf und Forschung
  • Broschur/Paperback
  • Höhe: 228 mm
  • |
  • Breite: 152 mm
  • |
  • Dicke: 19 mm
  • 365 gr
978-1-57586-074-9 (9781575860749)
1575860740 (1575860740)
Acknowledgements; 1. Introduction; 2. Syntactic categorisation; 3. Semantic categorisation; 4. Subcategorization; 5. A look back; 6. Appendix A: mathematical methods; References.
"The book is an enlightening investigation into the relationship between ambiguity resolution and language learning. It is unique in its focus on the disambiguation problem in leanrning, rather than in processing, in contrast to the main concern of much research in the NLP literature." I. Dan Melamed, Computational Linguistics

Versand in 10-20 Tagen

23,05 €
inkl. 7% MwSt.
in den Warenkorb

Abholung vor Ort? Sehr gerne!
Unsere Web-Seiten verwenden Cookies. Mit der Nutzung des WebShops erklären Sie sich damit einverstanden. Mehr Informationen finden Sie in unserem Datenschutzhinweis. Ok