2713 search results - page 408 / 543 » Parameterized Tree Systems |
139
click to vote
EMNLP
2010
15 years 4 months ago
2010
We examine effects that empty categories have on machine translation. Empty categories are elements in parse trees that lack corresponding overt surface forms (words) such as drop...
169
click to vote
NAACL
2010
15 years 4 months ago
2010
Syntactic machine translation systems currently use word alignments to infer syntactic correspondences between the source and target languages. Instead, we propose an unsupervised...
196
click to vote
EMNLP
2009
15 years 4 months ago
2009
We present the first unsupervised approach to the problem of learning a semantic parser, using Markov logic. Our USP system transforms dependency trees into quasi-logical forms, r...
178
click to vote
FMCO
2009
Springer
15 years 4 months ago
2009
Springer
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
153
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
B-Prolog is a high-performance implementation of the standard Prolog language with several extensions including matching clauses, action rules for event handling, finite-domain c...