語系:
繁體中文
English
說明(常見問題)
圖資館首頁
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Automatically ordering events and ti...
~
Derczynski, Leon R.A.
Automatically ordering events and times in text
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Automatically ordering events and times in textby Leon R.A. Derczynski.
作者:
Derczynski, Leon R.A.
出版者:
Cham :Springer International Publishing :2017.
面頁冊數:
xxi, 205 p. :ill., digital ;24 cm.
Contained By:
Springer eBooks
標題:
Computational linguistics.
電子資源:
http://dx.doi.org/10.1007/978-3-319-47241-6
ISBN:
9783319472416$q(electronic bk.)
Automatically ordering events and times in text
Derczynski, Leon R.A.
Automatically ordering events and times in text
[electronic resource] /by Leon R.A. Derczynski. - Cham :Springer International Publishing :2017. - xxi, 205 p. :ill., digital ;24 cm. - Studies in computational intelligence,v.6771860-949X ;. - Studies in computational intelligence ;v. 216..
Introduction -- Events and Times -- Temporal Relations -- Relation Labelling Analysis -- Using Temporal Signals -- Using a Framework of Tense and Aspect -- Conclusion.
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.
ISBN: 9783319472416$q(electronic bk.)
Standard No.: 10.1007/978-3-319-47241-6doiSubjects--Topical Terms:
181250
Computational linguistics.
LC Class. No.: P98
Dewey Class. No.: 006.35
Automatically ordering events and times in text
LDR
:02415nmm a2200325 a 4500
001
507954
003
DE-He213
005
20161018120331.0
006
m d
007
cr nn 008maaau
008
171031s2017 gw s 0 eng d
020
$a
9783319472416$q(electronic bk.)
020
$a
9783319472409$q(paper)
024
7
$a
10.1007/978-3-319-47241-6
$2
doi
035
$a
978-3-319-47241-6
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
P98
072
7
$a
UYQ
$2
bicssc
072
7
$a
COM004000
$2
bisacsh
082
0 4
$a
006.35
$2
23
090
$a
P98
$b
.D429 2017
100
1
$a
Derczynski, Leon R.A.
$3
770532
245
1 0
$a
Automatically ordering events and times in text
$h
[electronic resource] /
$c
by Leon R.A. Derczynski.
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2017.
300
$a
xxi, 205 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Studies in computational intelligence,
$x
1860-949X ;
$v
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
Computational linguistics.
$3
181250
650
1 4
$a
Engineering.
$3
210888
650
2 4
$a
Computational Intelligence.
$3
338479
650
2 4
$a
Artificial Intelligence (incl. Robotics)
$3
252959
650
2 4
$a
Document Preparation and Text Processing.
$3
274189
650
2 4
$a
Computational Linguistics.
$3
274669
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer eBooks
830
0
$a
Studies in computational intelligence ;
$v
v. 216.
$3
380871
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-47241-6
950
$a
Engineering (Springer-11647)
筆 0 讀者評論
全部
電子館藏
館藏
1 筆 • 頁數 1 •
1
條碼號
館藏地
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
000000136197
電子館藏
1圖書
電子書
EB P98 D429 2017
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
多媒體檔案
http://dx.doi.org/10.1007/978-3-319-47241-6
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入