3270 search results - page 158 / 654 » Approximate String Processing |
114
click to vote
EACL
1993
ACL Anthology
15 years 3 months ago
1993
ACL Anthology
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...
119
click to vote
TSD
2010
Springer
15 years 11 days ago
2010
Springer
In this paper we present our study on expressive gibberish speech synthesis as a means for affective communication between computing devices, such as a robot or an avatar, and thei...
141
Voted
EMNLP
2009
15 years 9 days ago
2009
Current methods of using lexical features in machine translation have difficulty in scaling up to realistic MT tasks due to a prohibitively large number of parameters involved. In...
161
Voted
FSMNLP
2009
Springer
15 years 8 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...
133
click to vote
KR
1992
Springer
15 years 6 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...