Construction of conceptual graph representation of texts

Svetlana Hensman

doi:10.3115/1614038.1614047

Construction of conceptual graph representation of texts

Svetlana Hensman

Research output: Contribution to conference › Paper › peer-review

Abstract

This paper describes a system for constructing conceptual graph representation of text by using a combination of existing linguistic resources (VerbNet and WordNet). We use a two-step approach, by firstly identifying the semantic roles in a sentence, and then using these roles, together with semi-automatically compiled domain-specific knowledge to construct the conceptual graph representation.

Original language	English
Pages	49-54
Number of pages	6
DOIs	https://doi.org/10.3115/1614038.1614047
Publication status	Published - 2004
Externally published	Yes
Event	2004 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics - Student Research Workshop, HLT-NAACL 2004 - Boston, United States Duration: 2 May 2004 → 7 May 2004

Conference

Conference	2004 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics - Student Research Workshop, HLT-NAACL 2004
Country/Territory	United States
City	Boston
Period	2/05/04 → 7/05/04

Access to Document

10.3115/1614038.1614047

Cite this

@conference{a483365af67b453ab03a489c3b7b483b,

title = "Construction of conceptual graph representation of texts",

abstract = "This paper describes a system for constructing conceptual graph representation of text by using a combination of existing linguistic resources (VerbNet and WordNet). We use a two-step approach, by firstly identifying the semantic roles in a sentence, and then using these roles, together with semi-automatically compiled domain-specific knowledge to construct the conceptual graph representation.",

author = "Svetlana Hensman",

note = "Publisher Copyright: {\textcopyright} HLT-NAACL 2004 - Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, Proceedings of the Student Research Workshop.; 2004 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics - Student Research Workshop, HLT-NAACL 2004 ; Conference date: 02-05-2004 Through 07-05-2004",

year = "2004",

doi = "10.3115/1614038.1614047",

language = "English",

pages = "49--54",

}

TY - CONF

T1 - Construction of conceptual graph representation of texts

AU - Hensman, Svetlana

N1 - Publisher Copyright: © HLT-NAACL 2004 - Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, Proceedings of the Student Research Workshop.

PY - 2004

Y1 - 2004

N2 - This paper describes a system for constructing conceptual graph representation of text by using a combination of existing linguistic resources (VerbNet and WordNet). We use a two-step approach, by firstly identifying the semantic roles in a sentence, and then using these roles, together with semi-automatically compiled domain-specific knowledge to construct the conceptual graph representation.

AB - This paper describes a system for constructing conceptual graph representation of text by using a combination of existing linguistic resources (VerbNet and WordNet). We use a two-step approach, by firstly identifying the semantic roles in a sentence, and then using these roles, together with semi-automatically compiled domain-specific knowledge to construct the conceptual graph representation.

UR - https://www.scopus.com/pages/publications/58049201651

U2 - 10.3115/1614038.1614047

DO - 10.3115/1614038.1614047

M3 - Paper

AN - SCOPUS:58049201651

SP - 49

EP - 54

T2 - 2004 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics - Student Research Workshop, HLT-NAACL 2004

Y2 - 2 May 2004 through 7 May 2004

ER -

Construction of conceptual graph representation of texts

Abstract

Conference

Access to Document

Fingerprint

Cite this