10493 search results - page 52 / 2099 » Dynamic Word Problems |
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
NLDB
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Automated Text Categorization has reached the levels of accuracy of human experts. Provided that enough training data is available, it is possible to learn accurate autom...
FCT
1991
Springer
13 years 11 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
CICLING
2008
Springer
13 years 9 months ago
2008
Springer
An N-gram language model aims at capturing statistical word order dependency information from corpora. Although the concept of language models has been applied extensively to handl...
ACL
1993
13 years 9 months ago
1993
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...