1423 search results - page 107 / 285 » Languages of Nested Trees |
110
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
Naive parallel implementation of nondeterministic systems (such as a theorem proving system) and languages (such as a logic, constraint, or a concurrent constraint language)can re...
177
click to vote
ICDT
2010
ACM
15 years 6 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
114
Voted
AI
2007
Springer
15 years 3 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
125
Voted
ICML
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
142
Voted
JQL
2008
15 years 3 months ago
2008
A wide range of evidence points to a preference for syntactic structures in which dependencies are short. Here we examine the question: what kinds of dependency configurations min...