Automatically Ordering Events and Times in Text (Record no. 79895)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 03506nam a22005655i 4500 |
001 - CONTROL NUMBER | |
control field | 978-3-319-47241-6 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20220801221639.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 161018s2017 sz | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9783319472416 |
-- | 978-3-319-47241-6 |
082 04 - CLASSIFICATION NUMBER | |
Call Number | 006.3 |
100 1# - AUTHOR NAME | |
Author | Derczynski, Leon R.A. |
245 10 - TITLE STATEMENT | |
Title | Automatically Ordering Events and Times in Text |
250 ## - EDITION STATEMENT | |
Edition statement | 1st ed. 2017. |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | XXI, 205 p. 25 illus. |
490 1# - SERIES STATEMENT | |
Series statement | Studies in Computational Intelligence, |
505 0# - FORMATTED CONTENTS NOTE | |
Remark 2 | Introduction -- Events and Times -- Temporal Relations -- Relation Labelling Analysis -- Using Temporal Signals -- Using a Framework of Tense and Aspect -- Conclusion. |
520 ## - SUMMARY, ETC. | |
Summary, etc | The book offers a detailed guide to temporal ordering, exploring open problems in the field and providing solutions and extensive analysis. It addresses the challenge of automatically ordering events and times in text. Aided by TimeML, it also describes and presents concepts relating to time in easy-to-compute terms. Working out the order that events and times happen has proven difficult for computers, since the language used to discuss time can be vague and complex. Mapping out these concepts for a computational system, which does not have its own inherent idea of time, is, unsurprisingly, tough. Solving this problem enables powerful systems that can plan, reason about events, and construct stories of their own accord, as well as understand the complex narratives that humans express and comprehend so naturally. This book presents a theory and data-driven analysis of temporal ordering, leading to the identification of exactly what is difficult about the task. It then proposes and evaluates machine-learning solutions for the major difficulties. It is a valuable resource for those working in machine learning for natural language processing as well as anyone studying time in language, or involved in annotating the structure of time in documents. |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | https://doi.org/10.1007/978-3-319-47241-6 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | eBooks |
264 #1 - | |
-- | Cham : |
-- | Springer International Publishing : |
-- | Imprint: Springer, |
-- | 2017. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computational intelligence. |
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 | |
-- | Computational Intelligence. |
650 24 - 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 | |
-- | 1860-9503 ; |
912 ## - | |
-- | ZDB-2-ENG |
912 ## - | |
-- | ZDB-2-SXE |
No items available.