2014
DOI: 10.15439/2014f323
|View full text |Cite
|
Sign up to set email alerts
|

LELA - A natural language processing system for Romanian tourism

Abstract: Abstract-This paper presents a commercial semantic-based system for the Romanian tourism. The Lela system exploits both open linked data from Romanian and international sources, and also proprietary databases in the tourism domain. We present the process of creating the linked data set, based on: i) engineering the LELA Romanian tourism ontology, and ii) populating the ontology by linking open data. The system also provides a natural language interface for the Romanian language. The queries are automatically t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…The query method described here is simple-a typical Boolean search is used. Thus, a more robust and efficient query could be achieved by implementing other query and search methods such as the ranking algorithm (Tran et al 2009;Zhiguo & Zhengjie 2010) and natural language query processing (Damljanovic et al 2010;Paredes-Valverde et al 2015;Tablan et al 2008;Varga et al 2014;Wang et al 2007). It is vital for users to query the system without being attached to a fixed one and to select pre-defined parameters.…”
Section: Discussionmentioning
confidence: 99%
“…The query method described here is simple-a typical Boolean search is used. Thus, a more robust and efficient query could be achieved by implementing other query and search methods such as the ranking algorithm (Tran et al 2009;Zhiguo & Zhengjie 2010) and natural language query processing (Damljanovic et al 2010;Paredes-Valverde et al 2015;Tablan et al 2008;Varga et al 2014;Wang et al 2007). It is vital for users to query the system without being attached to a fixed one and to select pre-defined parameters.…”
Section: Discussionmentioning
confidence: 99%
“…The query method described here is simple—a typical Boolean search is used. Thus, a more robust and efficient query could be achieved by implementing other query and search methods such as the ranking algorithm ( Tran, Tsuji & Masuda, 2009 ; Zhiguo & Zhengjie, 2010 ) and natural language query processing ( Damljanovic, Agatonovic & Cunningham, 2010 ; Paredes-Valverde et al, 2015 ; Tablan, Damljanovic & Bontcheva, 2008 ; Varga et al, 2014 ; Wang et al, 2007 ). It is vital for users to query the system without being attached to a fixed one and to select pre-defined parameters.…”
Section: Discussionmentioning
confidence: 99%