|
|
|
|
LEADER |
03212nam a22005055i 4500 |
001 |
978-3-319-47241-6 |
003 |
DE-He213 |
005 |
20161018120331.0 |
007 |
cr nn 008mamaa |
008 |
161018s2017 gw | s |||| 0|eng d |
020 |
|
|
|a 9783319472416
|9 978-3-319-47241-6
|
024 |
7 |
|
|a 10.1007/978-3-319-47241-6
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a Q342
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
082 |
0 |
4 |
|a 006.3
|2 23
|
100 |
1 |
|
|a Derczynski, Leon R.A.
|e author.
|
245 |
1 |
0 |
|a Automatically Ordering Events and Times in Text
|h [electronic resource] /
|c by Leon R.A. Derczynski.
|
264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2017.
|
300 |
|
|
|a XXI, 205 p. 25 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Studies in Computational Intelligence,
|x 1860-949X ;
|v 677
|
505 |
0 |
|
|a Introduction -- Events and Times -- Temporal Relations -- Relation Labelling Analysis -- Using Temporal Signals -- Using a Framework of Tense and Aspect -- Conclusion.
|
520 |
|
|
|a 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.
|
650 |
|
0 |
|a Engineering.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Text processing (Computer science).
|
650 |
|
0 |
|a Computational linguistics.
|
650 |
|
0 |
|a Computational intelligence.
|
650 |
1 |
4 |
|a Engineering.
|
650 |
2 |
4 |
|a Computational Intelligence.
|
650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
650 |
2 |
4 |
|a Document Preparation and Text Processing.
|
650 |
2 |
4 |
|a Computational Linguistics.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319472409
|
830 |
|
0 |
|a Studies in Computational Intelligence,
|x 1860-949X ;
|v 677
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-319-47241-6
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-ENG
|
950 |
|
|
|a Engineering (Springer-11647)
|