179 search results - page 34 / 36 » Lambek Grammars Are Context Free |
100
Voted
EMNLP
2011
13 years 11 months ago
2011
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
93
Voted
TCS
2010
14 years 10 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
245
click to vote
BMCBI
2011
14 years 6 months ago
2011
Background: The OMIM database is a tool used daily by geneticists. Syndrome pages include a Clinical Synopsis section containing a list of known phenotypes comprising a clinical s...
106
Voted
CAV
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Many automatic testing, analysis, and verification techniques for programs can effectively be reduced to a constraint-generation phase followed by a constraint-solving ...
HPCC
2007
Springer
15 years 5 months ago
2007
Springer
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...