Efficient Processing with Constraint-Logic Grammars Using Grammar

 
 
Centre for the Study of Language & Information (Verlag)
  • 1. Auflage
  • |
  • erschienen am 17. April 2001
 
  • Buch
  • |
  • Hardcover
  • |
  • 255 Seiten
978-1-57586-305-4 (ISBN)
 
The ascendance of communication technologies such as the internet has accentuated the need to improve access, manipulation and translation of written language. One of the main goals of researchers in the field of computational linguistics is to create programs that put to use knowledge of human language in pursuit of technology that can overcome the many obstacles in the interaction between human and computer. In this endeavor, finding automated techniques to parse the complexities of human grammar is a premier problem tackled by human-interface researchers. The intricacy of human grammar poses problems not only of accuracy, but also of efficiency. This book investigates programs for automatic analysis and production of written human language. These specialized programs use knowledge about the structure and meaning of human language in the form of grammars. Various techniques are proposed which focus on solutions for practical problems in processing of constraint-logic grammars. The solutions are all based on the automatic adaptation or compilation of a grammar rather than a modification of the processing algorithm used. As such they allow the grammar writer to abstract over details of grammar processing and in many cases enable more efficient processing.
New.
  • Englisch
  • Stanford
  • |
  • USA
  • Für höhere Schule und Studium
  • |
  • Für Beruf und Forschung
Ill.
  • Höhe: 236 mm
  • |
  • Breite: 157 mm
  • |
  • Dicke: 20 mm
  • 467 gr
978-1-57586-305-4 (9781575863054)
1575863057 (1575863057)

Versand in 10-20 Tagen

59,76 €
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