215 search results - page 10 / 43 » On Abstract Finite-State Morphology |
CICLING
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we ne...
WIA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We propose a scheme for automatically generating compressors for XML documents from Document Type Definition(DTD) specifications. Our algorithm is a lossless adaptive a...
CICLING
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
NEUROSCIENCE
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, a...
WIA
1997
Springer
14 years 21 days ago
1997
Springer
Abstract. We explore the information processing capabilities and efciency of DNA computations by giving two di erent types of implementations of nite-state machines. A ligation-bas...