110 search results - page 12 / 22 » Finite-State Registered Automata and Their Uses in Natural L... |
NLPRS
2001
Springer
13 years 12 months ago
2001
Springer
Word segmentation is the first and obligatory task for every NLP. For inflectional languages like English, French, Dutch,.. their word boundaries are simply assumed to be whitespa...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
ICALP
2010
Springer
14 years 9 days ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
NLPRS
2001
Springer
13 years 12 months ago
2001
Springer
Translating news articles frequently involves finding foreign language equivalents for proper nouns occurring for the first time in an original article, a time-consuming and labor...