40 search results - page 1 / 8 » On n-power prefix languages |
EMNLP
2010
13 years 2 months ago
2010
In many applications, replacing a complex word form by its stem can reduce sparsity, revealing connections in the data that would not otherwise be apparent. In this paper, we focu...
LREC
2008
13 years 6 months ago
2008
This paper deals with the treatment of constructed neologisms in a machine translation system. It focuses on a particular issue in Romance languages: relational adjectives and the...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
Abstract A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix. The techniq...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
INFORMATICALT
2000
13 years 4 months ago
2000
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...