Google Search Autocomplete - search suggestions as structured rows
Autocomplete is the list of completions Google offers under the search box as you type, and it is one of the most useful public signals on the web. It is drawn from what people actually search for, which makes it a direct read on demand phrasing rather than a modelled estimate of it - and unlike a keyword tool it surfaces the long tail that is too small to report a volume for. The catch is that it exists for a fraction of a second inside a dropdown. This service turns it into a table: one row per suggestion, three columns, exported as CSV, JSON or Excel, for as many seed queries as you want to submit.
The export has an unusually predictable shape, and that is its best feature. Every seed query returns exactly ten suggestions - that held on every block we measured, with no short blocks and no long ones - so the size of a job is simply your seed count times ten, known before you spend anything. The published reference accepts the query parameter as an array and batches up to a thousand queries per request, so a large seed list is a single job. Two optional parameters do the rest of the work: language, which defaults to English, and region, which the reference recommends setting for a better search experience. Autocomplete is strongly locale-dependent, so both are worth setting deliberately, and worth recording separately - none of the three output columns tells you afterwards which locale a row came from.
Two properties of the data itself are worth planning around. The first is that position is a rank within one query's dropdown rather than a row number: it runs 1 to 10 and then restarts for the next seed, so a fifty-seed file contains the number 1 fifty times, and grouping by query has to come before any sorting. The second is that the top suggestion is your own seed handed back - that happened on every block we measured. It is Google offering the literal string as the first option, and it means ten rows per query is really nine new phrasings plus one echo. Neither is a flaw, but both quietly distort a naive count, and a suggestions-per-seed figure that includes the echo is overstated by about a tenth.
One honest note about volatility, and it cuts both ways. We ran several seeds more than once. One returned a byte-identical top ten; another returned the same ten strings reordered; a third shared eight of ten with its earlier run. So the list is neither fixed nor random - it drifts. That is what makes it worth sampling repeatedly rather than once, and it is also why nothing in these three columns should be treated as a stable identifier: build a key from the query and the suggestion together, store the date of every run, and let a rank movement earn its interpretation across several samples rather than one. Start free: your first 500 rows cost nothing and need no credit card.