5 search results - page 1 / 1 » On the weight of universal insertion grammars |
TCS
2008
15 years 9 days ago
2008
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
93
Voted
EMNLP
2007
15 years 1 months ago
2007
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
103
click to vote
LREC
2010
15 years 1 months ago
2010
The paper presents an approach for constructing a weighted bilingual dictionary of inflectional forms using as input data a traditional bilingual dictionary, and not parallel corp...
123
click to vote
SWAT
1992
Springer
15 years 4 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
96
Voted
BTW
2003
Springer
15 years 5 months ago
2003
Springer
: XML is the upcoming standard for internet data. Java is the most important programming language for internet applications. Nevertheless, in today’s languages and tools there is...