656 search results - page 89 / 132 » Marrying Words and Trees |
115
click to vote
DLT
2003
15 years 1 months ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
GRAPHICSINTERFACE
2003
15 years 1 months ago
2003
Ray tracing techniques need supersampling to reduce aliasing and/or noise in the final image. Since not all the pixels in the image require the same number of rays, supersampling...
PDPTA
2003
15 years 1 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
ACL
1998
15 years 1 months ago
1998
This paper describes a wide-coverage Japanese grammar based on HPSG. The aim of this work is to see the coverage and accuracy attainable using an underspecified grammar. Underspec...
TAPD
1998
15 years 1 months ago
1998
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...