1004 search results - page 78 / 201 » Instance-Based Natural Language Generation |
127
click to vote
EMNLP
2010
15 years 1 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...
176
click to vote
SBMF
2010
Springer
14 years 9 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...
105
click to vote
ALT
2003
Springer
16 years 1 days 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...
126
click to vote
CHI
2007
ACM
16 years 3 months ago
2007
ACM
We are developing a computer system which provides information about babies in neonatal intensive care to family members and friends. A key challenge is deciding what information ...
167
click to vote
FSMNLP
2009
Springer
15 years 26 days ago
2009
Springer
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...