The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Googleology is Bad Science
Open accessAbstract
The World Wide Web is enormous, free, immediately available, and largely linguistic.As we discover, on ever more fronts, that language analysis and generation benefit from big data, so it becomes appealing to use the Web as a data source.The question, then, is how.The low-entry-cost way to use the Web is via a commercial search engine.If the goal is to find frequencies or probabilities for some phenomenon of interest, we can use the hit count given in the search engine's hits page to make an estimate.People have been doing this for some time now.Early work using hit counts include Grefenstette (1999), who identified likely translations for compositional phrases, and Turney (2001), who found synonyms; perhaps the most cited study is Keller and Lapata (2003), who established the validity of frequencies gathered in this way using experiments with human subjects.Leading recent work includes Nakov and Hearst (2005), who build models of noun compound bracketing.The initial-entry cost for this kind of research is zero.Given a computer and an Internet connection, you input the query and get a hit count.But if the work is to proceed beyond the anecdotal, a range of issues must be addressed.First, the commercial search engines do not lemmatize or part-of-speech tag.To take a simple case: To estimate frequencies for the verb-object pair fulfil obligation, Keller and Lapata make 36 queries (to cover the whole inflectional paradigm of both verb and noun and to allow for definite and indefinite articles to come between them) to each of Google and Altavista.It would be desirable to be able to search for fulfil obligation with a single search.If the research question concerns a language with more inflection, or a construction allowing more variability, the issues compound.Secondly, the search syntax is limited.There are animated and intense discussions on the CORPORA mailing list, the chief forum for such matters, on the availability or otherwise of wild cards and 'near' operators with each of the search engines, and cries of horror when one of the companies makes changes.(From my reading of the CORPORA list, these changes seem mainly in the direction of offering less metalanguage.)Thirdly, there are constraints on numbers of queries and numbers of hits per query.Google only allows automated querying via its API, limited to 1,000 queries per user per day.If there are 36 Google queries per single 'linguistic' query, we can make just 27 linguistic queries per day.Other search engines are currently less restrictive but that may arbitrarily change (particularly as corporate mergers are played out), and also Google has (probably) the largest index-and size is what we are going to the Internet for.Fourthly, search hits are for pages, not for instances.Working with commercial search engines makes us develop workarounds.We become experts in the syntax and constraints of Google, Yahoo, Altavista, and so on.We become 'googleologists'.The argument that the commercial search engines provide
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Syntactic clustering of the Web
Broder, A. Z., Glassman, S. C., Manasse, M. S., & Zweig, G. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00031-7 · Cited by 1,343
Mining the Web for Synonyms: PMI-IR versus LSA on TOEFL
Turney, P. D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44795-4_42 · Cited by 1,285
Semantic taxonomy induction from heterogenous evidence
Snow, R., Jurafsky, D., & Ng, A. Y. (2006) · Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL - ACL '06 · doi:10.3115/1220175.1220276 · Cited by 441
Using the Web to Obtain Frequencies for Unseen Bigrams
Keller, F., & Lapata, M. (2003) · Computational Linguistics · doi:10.1162/089120103322711604 · Cited by 350
Randomized algorithms and NLP: using locality sensitive hash function for high speed noun clustering
Ravichandran, D., Pantel, P., & Hovy, E. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219917 · Cited by 208
Large linguistically-processed web corpora for multiple languages
Baroni, M., & Kilgarriff, A. (2006) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.3115/1608974.1608976 · Cited by 126
Self-citation
Cited by
Lexicon-based methods for sentiment analysis
Taboada, M., Brooke, J., Tofiloski, M., Voll, K., & Stede, M. (2011) · Computational Linguistics · doi:10.1162/coli_a_00049 · Cited by 3,301
Kilgarriff, A., Baisa, V., Bušta, J., Jakubíček, M., Kovář, V., Michelfeit, J., Rychlý, P., & Suchomel, V. (2014) · Lexicography · doi:10.1007/s40607-014-0009-9 · Cited by 2,105
Self-citationTrafilatura: A Web Scraping Library and Command-Line Tool for Text Discovery and Extraction
Barbaresi, A. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing: System Demonstrations · doi:10.18653/v1/2021.acl-demo.15 · Cited by 90
Estimating search engine index size variability: a 9-year longitudinal study
van den Bosch, A., Bogers, T., & de Kunder, M. (2016) · Scientometrics · doi:10.1007/s11192-016-1863-z · Cited by 77
Metadata
- Authors
- Kilgarriff, A.
- Venue
- Computational Linguistics
- Publisher
- MIT Press - Journals
- Published
- 2007-03
- Volume
- 33
- Issue
- 1
- Pages
- 147-151
- ISSN
- 0891-2017 (ISSN-L)
- 1530-9312
- OpenAlex
- W2133322356
- Cited by
- 286
- References
- 6
- FWCI
- 27.58
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Googleology is Bad Science. https://app.cochat.ai/papers/10.1162/coli.2007.33.1.147
- The paper
- Kilgarriff, A. (2007). Googleology is Bad Science. Computational Linguistics. https://doi.org/10.1162/coli.2007.33.1.147
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.