Grammatical Inference for Computational Linguistics (Record no. 86157)

000 -LEADER
fixed length control field 04100nam a22005415i 4500
001 - CONTROL NUMBER
control field 978-3-031-02159-6
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730165211.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2016 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031021596
-- 978-3-031-02159-6
082 04 - CLASSIFICATION NUMBER
Call Number 006.3
100 1# - AUTHOR NAME
Author Heinz, Jeffrey.
245 10 - TITLE STATEMENT
Title Grammatical Inference for Computational Linguistics
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2016.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XXI, 139 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Human Language Technologies,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 List of Figures -- List of Tables -- Preface -- Studying Learning -- Formal Learning -- Learning Regular Languages -- Learning Non-Regular Languages -- Lessons Learned and Open Problems -- Bibliography -- Author Biographies.
520 ## - SUMMARY, ETC.
Summary, etc This book provides a thorough introduction to the subfield of theoretical computer science known as grammatical inference from a computational linguistic perspective. Grammatical inference provides principled methods for developing computationally sound algorithms that learn structure from strings of symbols. The relationship to computational linguistics is natural because many research problems in computational linguistics are learning problems on words, phrases, and sentences: What algorithm can take as input some finite amount of data (for instance a corpus, annotated or otherwise) and output a system that behaves "correctly" on specific tasks? Throughout the text, the key concepts of grammatical inference are interleaved with illustrative examples drawn from problems in computational linguistics. Special attention is paid to the notion of "learning bias." In the context of computational linguistics, such bias can be thought to reflect common (ideally universal) properties of natural languages. This bias can be incorporated either by identifying a learnable class of languages which contains the language to be learned or by using particular strategies for optimizing parameter values. Examples are drawn largely from two linguistic domains (phonology and syntax) which span major regions of the Chomsky Hierarchy (from regular to context-sensitive classes). The conclusion summarizes the major lessons and open questions that grammatical inference brings to computational linguistics. Table of Contents: List of Figures / List of Tables / Preface / Studying Learning / Formal Learning / Learning Regular Languages / Learning Non-Regular Languages / Lessons Learned and Open Problems / Bibliography / Author Biographies.
700 1# - AUTHOR 2
Author 2 Higuera, Colin de la.
700 1# - AUTHOR 2
Author 2 Zaanen, Menno van.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-02159-6
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2016.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial intelligence.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Natural language processing (Computer science).
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computational linguistics.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial Intelligence.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Natural Language Processing (NLP).
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computational Linguistics.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 1947-4059
912 ## -
-- ZDB-2-SXSC

No items available.