- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
This paper presents the acquisition and annotation of Slovenian Lombard Speech Database, the recording of which started in the year 2008. The database1 was recorded at the Univers...
We investigate Arabic Context Free Grammar parsing with dependency annotation comparing lexicalised and unlexicalised parsers. We study how morphosyntactic as well as function tag...
Most question-answering systems contain a classifier module which determines a question category, based on which each question is assigned an answer type. However, setting up synt...
Danica Damljanovic, Milan Agatonovic, Hamish Cunni...
Today's natural language processing systems are growing more complex with the need to incorporate a wider range of language resources and more sophisticated statistical metho...