DocumentCode :
1784795
Title :
A mapping mechanism of NL sentences onto an SPN state machine for understanding purposes
Author :
Psarologou, A. ; Bourbakis, Nikolaos ; Virvou, Maria
Author_Institution :
ATR Center, Wright State Univ., Dayton, OH, USA
fYear :
2014
fDate :
7-9 July 2014
Firstpage :
321
Lastpage :
324
Abstract :
This paper presents a formal language (called GLOSSA) for the representation of natural language (NL) sentences. Specifically, GLOSSA is a context-free language devoted to describe different forms of a kernel (Agent→Action→Patient) of a NL sentence based on its components, which are agents, actions, and patients, and for different kind of connections between them. GLOSSA is also able to describe different kinds of connections between more than one kernels in the same NL sentence. The definition of this formal language is motivated by our future goal to convert NL sentences onto state machines. In order to support this transformation we propose GLOSSA, which offers a formal model for the representation of basic components of a NL sentence (agents, actions, patients). Thus, in this work we provide the formal definition of the GLOSSA language and also present some illustrative examples of its use.
Keywords :
Petri nets; context-free languages; finite state machines; natural language processing; stochastic processes; GLOSSA formal language; NL sentence mapping mechanism; SPN state Machine; actions; agents; natural language sentences; patients; stochastic Petri-nets; Commutation; context-free languages; formal language; natural language understanting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information, Intelligence, Systems and Applications, IISA 2014, The 5th International Conference on
Conference_Location :
Chania
Type :
conf
DOI :
10.1109/IISA.2014.6878780
Filename :
6878780
Link To Document :
بازگشت