Une approche universelle pour l'abstraction automatique d'alternances morphophonologiques (A universal algorithm for the automatical abstraction of morphophonological alternations).
Sacha BeniaminePublished in: TALN (2) (2017)
Keyphrases
- times faster
- optimal solution
- optimization algorithm
- cost function
- improved algorithm
- learning algorithm
- worst case
- high accuracy
- computational cost
- experimental evaluation
- dynamic programming
- linear programming
- preprocessing
- computational complexity
- objective function
- detection algorithm
- selection algorithm
- theoretical analysis
- computationally efficient
- clustering method
- neural network
- np hard
- data structure
- high level
- probabilistic model
- simulated annealing
- k means
- search space
- multiscale
- similarity measure
- ant colony optimization
- memory requirements
- convergence rate
- genetic algorithm
- data sets
- sequence prediction
- kolmogorov complexity