Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Hadda Cherroun"'
Autor:
Younes Guellouma, Hadda Cherroun
Publikováno v:
Journal of Computing and Information Technology, Vol 24, Iss 4, Pp 311-322 (2016)
We address the problem of deterministic finite tree automata (DFTA) minimization. We describe a new alternative to implement both standard and incremental tree automata minimization using a well-defined graph representing the automaton to be minimize
Externí odkaz:
https://doaj.org/article/d834d45a585c42eb8d4185a77f4dbfe1
Publikováno v:
Journal of King Saud University: Computer and Information Sciences, Vol 28, Iss 2, Pp 157-169 (2016)
In this paper, we address the problems of Arabic Text Classification and root extraction using transducers and rational kernels. We introduce a new root extraction approach on the basis of the use of Arabic patterns (Pattern Based Stemmer). Transduce
Externí odkaz:
https://doaj.org/article/99db138db2374572a79e19d7e0b9dba5
Publikováno v:
Journal of Computer Languages. 74:101174
Autor:
Hadda Cherroun, Younes Guellouma
Publikováno v:
International Journal of Foundations of Computer Science. 29:1045-1062
We propose a construction of rational tree expression from finite tree automata. First, we define rational expression equation systems and we propose a substitution based method to find the unique solution. Furthermore, we discuss the case of recursi
Publikováno v:
Cybernetics and Information Technologies. 18:124-138
Measuring the amount of shared information between two documents is a key to address a number of Natural Language Processing (NLP) challenges such as Information Retrieval (IR), Semantic Textual Similarity (STS), Sentiment Analysis (SA) and Plagiaris
Publikováno v:
Kybernetika, 54(2), 221-242. Academy of Sciences of the Czech Republic
In this work we deal with tree pattern matching over ranked trees, where the pattern set to be matched against is defined by a regular tree expression. We present a new method that uses a tree automaton constructed inductively from a regular tree exp
Publikováno v:
Procedia Computer Science. 128:9-17
Dialect is the most common way of communication in every day life. Automatically identifying a dialect is a challenging task, especially when we deal with close dialects within the same country. In this paper, we address the problem of Spoken Algeria
Publikováno v:
Theory of Computing Systems. 62:1203-1222
In this paper, we propose a reduction of the minimization problem for a bottom-up deterministic tree automaton (DFTA), making the latter a minimization of a string deterministic finite automaton (DFA). To achieve this purpose, we proceed first by the
Publikováno v:
Knowledge and Information Systems. 53:439-477
Over the last two decades, a great deal of work has been devoted to the algorithmic aspects of the frequent itemset (FI) mining problem, leading to a phenomenal number of algorithms and associated implementations, each of which claims supremacy. Mean
Publikováno v:
ACLING
Crowdsourcing is an emerging collaborative approach that can be used for effective annotations of linguistic resources. There are many crowdsourcing genres: paid-for, games with a purpose, or altruistic (volunteer-based) approaches. In this paper, we