627 search results - page 68 / 126 » Contextual Grammars as Generative Models of Natural Language... |
CICLING
2005
Springer
14 years 2 months ago
2005
Springer
In this paper a computational model of the Spanish clitic system is presented. In this model clitic pronouns receive a dual analysis in which enclitics are considered inflexions wh...
EMNLP
2010
13 years 6 months ago
2010
We present three novel methods of compactly storing very large n-gram language models. These methods use substantially less space than all known approaches and allow n-gram probab...
SBMF
2010
Springer
13 years 3 months ago
2010
Springer
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
ALT
2003
Springer
14 years 5 months ago
2003
Springer
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...