963 search results - page 3 / 193 » $M$-Solid Varieties of Languages |
AO
2005
13 years 5 months ago
2005
The paper considers the problem of defining concepts within formal ontologies. A number of distinct modes of definition are identified, which represent alternative viewpoints on t...
MFPS
1993
13 years 9 months ago
1993
All known structures involving a constructively obtainable fixed point (or iteration) operation satisfy the equational laws defining iteration theories. Hence, there seems to be...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
GFKL
2006
Springer
13 years 9 months ago
2006
Springer
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
LREC
2008
13 years 7 months ago
2008
Developing resources which can be used for Natural Language Processing is an extremely difficult task for any language, but is even more so for less privileged (or less computeriz...