2 papers
cs.CL2023
New Linear-time Algorithm for SubTree Kernel Computation based on Root-Weighted Tree Automata
Ludovic Mignot, Faissal Ouardi, Djelloul Ziadi
Tree kernels have been proposed to be used in many areas as the automatic learning of natural language applications. In this paper, we propose a new linear time algorithm based on…
cs.FL2013
Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi
Several algorithms have been designed to convert a regular expression into an equivalent finite automaton. One of the most popular constructions, due to Glushkov and to McNaughton…