Sciweavers

252 search results - page 20 / 51
» Automata for Data Words and Data Trees
Sort
View
NIPS
2008
13 years 9 months ago
Syntactic Topic Models
We develop the syntactic topic model (STM), a nonparametric Bayesian model of parsed documents. The STM generates words that are both thematically and syntactically constrained, w...
Jordan L. Boyd-Graber, David M. Blei
NIPS
2008
13 years 9 months ago
A Scalable Hierarchical Distributed Language Model
Neural probabilistic language models (NPLMs) have been shown to be competitive with and occasionally superior to the widely-used n-gram language models. The main drawback of NPLMs...
Andriy Mnih, Geoffrey E. Hinton
IBERAMIA
2010
Springer
13 years 6 months ago
Text-to-Text Surface Realisation Using Dependency-Tree Replacement
Surface realisation - the task of producing word strings from non-linguistic input data - has been the focus of a great deal of research in the field of data-to-text Natural Langu...
Eder Miranda de Novais, Thiago Dias Tadeu, Ivandr&...
IPMU
2010
Springer
13 years 6 months ago
Attribute Value Selection Considering the Minimum Description Length Approach and Feature Granularity
Abstract. In this paper we introduce a new approach to automatic attribute and granularity selection for building optimum regression trees. The method is based on the minimum descr...
Kemal Ince, Frank Klawonn
ACL
2009
13 years 5 months ago
Non-Projective Dependency Parsing in Expected Linear Time
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
Joakim Nivre