77 search results - page 12 / 16 » Evaluation of Dependency Parsers on Unbounded Dependencies |
EMNLP
2010
14 years 7 months ago
2010
Syntactic consistency is the preference to reuse a syntactic construction shortly after its appearance in a discourse. We present an analysis of the WSJ portion of the Penn Treeba...
EMNLP
2009
14 years 7 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...
COLING
2010
14 years 4 months ago
2010
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
BIRTHDAY
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
NLPRS
2001
Springer
15 years 1 months ago
2001
Springer
In this paper, we present CaptionEye/KE, a Korean to English machine translation system that is applied to a practical TV caption translation. And its experimental evaluation is p...