=Paper=
{{Paper
|id=Vol-1393/paper-04
|storemode=property
|title=None
|pdfUrl=https://ceur-ws.org/Vol-1393/paper-04.pdf
|volume=Vol-1393
}}
==None==
<pdf width="1500px">https://ceur-ws.org/Vol-1393/paper-04.pdf</pdf>
<pre>
                      Good Uses for Crummy Knowledge Graphs
                                                                    Keynote Abstract
                                                                      Douglas W. Oard
                                                                     University of Maryland
                                                                       College Park, MD
                                                                              USA
                                                                       oard@umd.edu

ABSTRACT                                                                             References
In 1993, Ken Church and Ed Hovy suggested that before we                             [1] K. W. Church and E. H. Hovy. Good applications
ask how well some new technology meets the need we envi-                                 for crummy machine translation. Machine Translation,
sion for it, we should pause and first reflect on the question                           8:239–258, 1993. URL http://dx.doi.org/10.1007/
of whether – now that we know something about what can                                   BF00981759.
be built – we are envisioning the right uses for what we have.
They titled their paper “Good Applications for Crummy
Machine Translation” [1]. At about that same time, in-
formation retrieval researchers obliged them by (generally
without having read their paper) starting to work on cross-
language information retrieval; arguably the best applica-
tion for crummy machine translation ever invented. Now
we have some crummy knowledge graphs – and this time we
have read the Church and Hovy paper – so perhaps the time
is right for us to ask whether we have yet envisioned good
uses for crummy knowledge graphs. In this talk, I will seek
to seed that discussion.




Copyright c 2015 for the individual papers by the papers’ authors. Copying permit-
ted for private and academic purposes. This volume is published and copyrighted by
its editors.
SIGIR Workshop on Graph Search and Beyond ’15 Santiago, Chile
Published on CEUR-WS: http://ceur-ws.org/Vol-1393/.

</pre>