We examine how computer system problems can be derived from real application problems, with a particular focus on the relevance of some assumptions, especially those related to co...
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
Jean Berstel, Luc Boasson, Olivier Carton, Bruno P...
The problem of automatic text segmentation is subcategorized into two different problems: thematic segmentation into rather large topically selfcontained sections and splitting int...
Collocational knowledge is necessary for language generation. The problem is that collocations come in a large variety of forms. They can involve two, three or more words, these w...
Given a probability distribution over a set of n words to be transmitted, the Huffman Coding problem is to find a minimal-cost prefix free code for transmitting those words. The b...