Standard

Semantic and Ontological Relations in AIIRE Natural Language Processor. / Dobrov, A.V.

Computational Models for Business and Engineering Domains. ITHEA – Publisher, 2014. стр. 298 стр., 147—157.

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › глава/раздел › научная

Harvard

Dobrov, AV 2014, Semantic and Ontological Relations in AIIRE Natural Language Processor. в Computational Models for Business and Engineering Domains. ITHEA – Publisher, стр. 298 стр., 147—157.

APA

Dobrov, A. V. (2014). Semantic and Ontological Relations in AIIRE Natural Language Processor. в Computational Models for Business and Engineering Domains (стр. 298 стр., 147—157). ITHEA – Publisher.

Vancouver

Dobrov AV. Semantic and Ontological Relations in AIIRE Natural Language Processor. в Computational Models for Business and Engineering Domains. ITHEA – Publisher. 2014. стр. 298 стр., 147—157

Author

Dobrov, A.V. / Semantic and Ontological Relations in AIIRE Natural Language Processor. Computational Models for Business and Engineering Domains. ITHEA – Publisher, 2014. стр. 298 стр., 147—157

BibTeX

@inbook{118cbc433cd544a8b1fead7f8411e56b,
title = "Semantic and Ontological Relations in AIIRE Natural Language Processor",
abstract = "AIIRE is a free open source natural language processor, developed by a team of researchers in Saint-Petersburg, Russia. AIIRE is an implementation of full-scale NLU process, based on the method of inter-level interaction and rule-based disambiguation. Semantic graphs that are built by AIIRE are based on the involved ontology. The rules that concern correspondence between semantic relations (used in semantic graphs by AIIRE) and conceptual relations (used in ontology) is a matter of discussion. Semantic graphs are evaluated from syntactic trees, and, in general, although word-independent syntactic constituent classes tend to denote rather abstract relations (cf. genitive construction in general), the instances of those classes (specific phrases) in theory may denote any subclasses of those relations. The developed algorithm of choosing a relation subclass in each case is also a matter of discussion.",
keywords = "ontological semantics, lexical disambiguation, NLU, conceptual relations, semantic graphs",
author = "A.V. Dobrov",
year = "2014",
language = "English",
isbn = "978-954-16-0066-5, 978-954-16-0067-2",
pages = "298 стр., 147—157",
booktitle = "Computational Models for Business and Engineering Domains",
publisher = "ITHEA – Publisher",
address = "Bulgaria",

}

RIS

TY - CHAP

T1 - Semantic and Ontological Relations in AIIRE Natural Language Processor

AU - Dobrov, A.V.

PY - 2014

Y1 - 2014

N2 - AIIRE is a free open source natural language processor, developed by a team of researchers in Saint-Petersburg, Russia. AIIRE is an implementation of full-scale NLU process, based on the method of inter-level interaction and rule-based disambiguation. Semantic graphs that are built by AIIRE are based on the involved ontology. The rules that concern correspondence between semantic relations (used in semantic graphs by AIIRE) and conceptual relations (used in ontology) is a matter of discussion. Semantic graphs are evaluated from syntactic trees, and, in general, although word-independent syntactic constituent classes tend to denote rather abstract relations (cf. genitive construction in general), the instances of those classes (specific phrases) in theory may denote any subclasses of those relations. The developed algorithm of choosing a relation subclass in each case is also a matter of discussion.

AB - AIIRE is a free open source natural language processor, developed by a team of researchers in Saint-Petersburg, Russia. AIIRE is an implementation of full-scale NLU process, based on the method of inter-level interaction and rule-based disambiguation. Semantic graphs that are built by AIIRE are based on the involved ontology. The rules that concern correspondence between semantic relations (used in semantic graphs by AIIRE) and conceptual relations (used in ontology) is a matter of discussion. Semantic graphs are evaluated from syntactic trees, and, in general, although word-independent syntactic constituent classes tend to denote rather abstract relations (cf. genitive construction in general), the instances of those classes (specific phrases) in theory may denote any subclasses of those relations. The developed algorithm of choosing a relation subclass in each case is also a matter of discussion.

KW - ontological semantics

KW - lexical disambiguation

KW - NLU

KW - conceptual relations

KW - semantic graphs

M3 - Chapter

SN - 978-954-16-0066-5, 978-954-16-0067-2

SP - 298 стр., 147—157

BT - Computational Models for Business and Engineering Domains

PB - ITHEA – Publisher

ER -

ID: 4699840