<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Toward Conversational Query Reformulation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Johannes Kiesel</string-name>
          <email>johannes.kiesel@uni-weimar.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Xiaoni Cai</string-name>
          <email>xiaonicaiweimar@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roxanne El Baf</string-name>
          <email>roxanne.elbaf@dlr.de</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Benno Stein</string-name>
          <email>benno.stein@uni-weimar.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Matthias Hagen</string-name>
          <email>matthias.hagen@informatik.uni-halle.de</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Bauhaus-Universität Weimar</institution>
          ,
          <addr-line>Bauhausstraße 11, 99423 Weimar</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>German Aerospace Center (DLR) Oberpfafenhofen</institution>
          ,
          <addr-line>Münchener Str. 20, 82234 Weßling</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In traditional web search interfaces, information seekers reformulate their queries by editing the terms in the search box in order to guide the retrieval process. Such kind of editing is at odds with the natural language interaction paradigm in conversational interfaces, and for purely voice-based interfaces it is impossible. Conversational search studies reveal that participants instead describe their changes to a query; however, the principles of such “editing conversations” have not been analyzed in depth. The paper in hand formalizes the problem of conversational query reformulation. We cast reformulations as meta-queries that imply operations on the original query and categorize the operations following the standard CRUD terminology (create, read, update, delete). Based on this formalization we crowdsource a dataset with 2694 human reformulations across four search domains. Our analysis of the meta-queries reveals a large variety in word usage and indicates ambiguous reformulations as an important research topic of its own.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Conversational search</kwd>
        <kwd>Crowdsourcing</kwd>
        <kwd>CRUD</kwd>
        <kwd>Information seeking</kwd>
        <kwd>Query refinement</kwd>
        <kwd>Query reformulation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>During web search, information seekers frequently find a
search engine’s results either too specific, too generic, or
containing results relevant only to an unintended
interpretation of their query. In such cases seekers may want
to reformulate their queries [1, 2]. In a traditional search
interface, the seeker would directly edit the previous
query in the search field, creating, updating, or deleting
terms. Such reformulations account for about half of
all queries [3, Sec. 6.3]. However, conversational search
interfaces—be they chat-like or voice-based—usually do
not allow modifying the previous query. Though some
chat interfaces not used for search allow to edit previous
messages, such a functionality breaks temporal
continuity, making the interaction significantly less
conversational. Still, reformulations are also frequent in
conversational search lab studies [4] and can be seen as one
user-facing service of the search interface’s
conversational layer, as illustrated in Figure 1 (a).</p>
      <p>As the example in Figure 1 (b) illustrates,
reformulations allow to specify information in small steps. As the
main advantage of incremental formulation, seekers do
“Show me news about COVID-19.”
COVID-19</p>
      <p>Search engine
Conversation</p>
      <p>layer
Laconic layer</p>
      <p>TCP/IP layer
“OK, here is the latest news on COVID-19.” + &lt;serp&gt;</p>
      <p>{”hits”: {”total”: 142, ... }, ...}
“Ah. Please no articles about vaccination this time.”
COVID-19 ∧ (¬ vaccination)
“Sure, I remove articles on vaccination.” + &lt;serp&gt;</p>
      <p>{”hits”: {”total”: 89, ... }, ...}
time
...</p>
      <p>...
not have to formulate the complete query in advance, ask for information connected to information just
resubstantially reducing the required mental efort. 1 More- trieved. However, whereas query reformulations change
over, incremental formulation might simplify and thus the criteria that identify relevant information, follow-up
increase the use of search operators for seekers, like the questions request a completely new answer. This
difexclusion in Figure 1 (b), allowing seekers to formulate ference in intent causes linguistic diferences between
even complex needs more intuitively.2 query reformulations and follow-up questions that
war</p>
      <p>Though the seeker may not consciously ask to create, rant separate investigations. Moreover, conversational
update, or delete query terms, conversational reformu- query reformulation relates to much of the available
relations are essentially such meta-queries that request search on queries.
changes to the previous query. While these operations
are not implemented in standard retrieval engines, one 2.1. Queries in Conversational Search
can imagine a “conversation” layer on top of such engines
(Figure 1 (a)) that—among others—resolves reformula- A central promise of the conversational search paradigm
tions similar to co-reference resolution in conversational is to bring search closer to real-world assistance of a
question answering systems (e.g., [6]). reference librarian [8]. In this regard, conversational</p>
      <p>
        However, critical issues for conversational systems reformulations are one piece for allowing the seeker to
concerning reformulations have barely been analyzed specify their need on a more natural level [9]. Still, unlike
in the literature, especially the reformulations’ inherent “query by babbling” [
        <xref ref-type="bibr" rid="ref19 ref22 ref28">10</xref>
        ], reformulations require some
forambiguity. For example, consider the seeker asking “OK, malized description in the seeker’s mind. Instead,
converhow about vaccinations?” after getting the results for sational query reformulations are one instance of “user
“Show me news about COVID-19” in Figure 1 (b). Is the revealment” [11] where the seeker incrementally
specintent to create a “vaccination” term or to replace the ifies their need. The advantages of small steps, as in
query entirely? If aware of the ambiguities, a system orienteering [12], are that seekers have to specify less
could ask for clarification or use heuristics to resolve and obtain context information on the way. A
complethe ambiguity. It could also stress and thereby teach mentary approach to help seekers refine their query is to
unambiguous language in its replies (“I reduced the list ask them clarification questions in case the search engine
to those on vaccinations.”). detects them struggeling or being ambiguous [13].
      </p>
      <p>To foster research on conversational query reformula- In their history of IR research, Sanderson and Croft
tions, we contribute the following: (1) a conceptualization [14] divided interactions against some first text-based
that casts conversational reformulations as meta-queries conversational search systems into natural language or
following CRUD terminology (cf. Section 3); (2) the first keyword-based and into non-querying and querying.
dataset on conversational query reformulations,3 contain- In a later fine-grained study of conversational seeker
ing 2694 messages and associated meta-queries, crowd- messages for passage retrieval, Lin et al. [15] categorize
sourced from 284 study participants from 5 countries query ambiguity, though they focus on ambiguity
regardin 4 diferent search domains (cf. Section 4); and (3) an ing (not) referenced entities, whereas the paper at hand
in-depth analysis of the reformulations’ word patterns, focuses on ambiguity regarding the desired operation.
emphasizing ambiguous word patterns as important re- Trippas et al. [4] present a model for spoken
conversasearch direction and suggesting the general feasibility of tional search that also covers information requests
bea domain-independent rewriting system (cf. Section 5). yond queries, for example, within a result document. In
their lab study, they observe that both seekers
conversationally reformulate queries (“query embellishments”)
2. Related Work and that participants in the system’s role
conversationally ofer reformulations based on what they see.</p>
      <p>Though conversational search is an active research area,
conversational query reformulation has attracted little
attention so far. In contrast, several recent publications
target co-reference resolution for follow-up questions
in conversational question answering [7].
Reformulations and follow-up questions are similar in that both</p>
      <p>1This efect likely also holds for more instruction-like (but still
conversational) interactions, like in Adobe’s “phonic filters” image
search demo,
https://blog.adobe.com/en/2019/05/29/preview-technology-givesyour-voice-the-power-of-a-creative-director.html.</p>
      <p>2Some years ago, only about 1% of web search queries
contained operators [5].</p>
      <p>3Publicly available at https://doi.org/10.5281/zenodo.5031960</p>
      <sec id="sec-1-1">
        <title>2.2. Query Reformulation</title>
        <p>Query reformulations are queries based on the previous
one with a similar information need [1]. Boldi et al. [1]
classified query reformulations on two axes from
generalization to specification and from being the same query to
starting a new search mission. Sanderson and Croft [14]
proposed a categorization based on the latter axis. Jiang
et al. [16] analyzed voice query repeats after voice input
errors. They found that seekers tended to stress words
that the system misunderstood—a way of conversational
reformulation that is specific to voice queries but outside
the scope of the paper at hand.</p>
        <p>Though studies took note of conversational query
reformulations (e.g., [17]), they have rarely been analyzed.
As an exception, Sa and Yuan [18] asked 32 participants
in a Wizard of Oz study to perform one generalization
and one specialization of a displayed query, speaking
to the system like to a human. The participants
preferred conversational query reformulations (which Sa an
Yuan call “partial query modification”) over repeating
the query with changes (“complete query modification”),
even though several participants reported employing the
latter for being used to it. We build upon this work,
asking for more complex reformulations in longer query
sessions and focusing on analyzing the language employed
and ambiguities therein.</p>
      </sec>
      <sec id="sec-1-2">
        <title>2.3. Query Rewriting</title>
        <sec id="sec-1-2-1">
          <title>In contrast to query reformulation, query rewriting refers</title>
          <p>to processing the query before the retrieval. This task
currently attracts much attention in conversational
question answering, mostly concerning co-reference
resolution. Available datasets for this task include CSQA [19],
CoQA [20], QReCC [6], QuAC [21], and TREC CAsT [22].
The availability of datasets has already led to several
approaches, often employing sequence-to-sequence
learning [23, 24, 20] and previous interactions [25, 26, 27].</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>3. Conceptualizing</title>
    </sec>
    <sec id="sec-3">
      <title>Conversational Reformulations</title>
      <sec id="sec-3-1">
        <title>2.4. Natural Language Queries</title>
        <sec id="sec-3-1-1">
          <title>Conversational reformulations are query reformulations</title>
          <p>using natural language. While query reformulations
in web search usually are stand-alone queries that can
directly be submitted to retrieve results, formulating
queries from conversational reformulations requires an
additional step that “adds” the conversational context.</p>
          <p>This section discusses the implications on three levels:
(1) a model of conversational reformulations as
metaqueries; (2) the problem of algorithmically
understanding reformulations; and (3) the process of creating the
“laconic” queries from the reformulations.</p>
          <p>Several studies analyzed natural language queries even
before conversational interfaces. Belkin et al. [28] found
that, in a text-based search interface, the average query
length increased by nearly 50% when the search box label
encouraged to write a problem description. Still, the
automatic “translation” of long queries to shorter keyword
queries later also gained attention with systems reducing
natural language queries to some key concepts more
compatible with keyword-based interfaces [29, 30]. Moreover, 3.1. Casting Conversational
also the translation of natural language to database or
knowledge graph queries attracts much attention (e.g., Reformulations as Meta-Queries
[31, 32, 33]). For smart assistants, Tanaka et al. [34] used From the information system’s perspective, the
informacrowdsourcing like us to gather implicit and highly am- tion seeker uses a meta-query language when expressing
biguous seeker requests for specific non-conversational conversational reformulations: they tell the system to
tasks, e.g., “I’m thirsty” as a request to search for a nearby perform specific operations on the previous query. On
café or “I’m having trouble getting good reception” as a a syntactic level, the basic reformulation operations in
“request” to search for a WiFi spot. As example of spoken traditional search interfaces are adding, changing, and
reformulations in a diferent setting, researchers have for removing a term. These correspond to the basic
operadecades investigated ways to edit text by voice [35, 36], tions create, update, and delete of data systems [38]. The
using commands like “Capitalize the first letter in each fourth basic operation of data systems, read, may also be
word in each title” [37]. useful if the previous query is not visible, like in some
conversational interfaces. For illustration, Table 1 shows
conversational examples for each basic operation. One
query reformulation can contain several basic operations.
3.2. Algorithmically Understanding with 80 participants to minimize the interface’s influence
Natural Language Reformulations on the participant’s choice of words. Based on insights
from the pilot studies, we formulated the tasks as bullet
In the past years, impressive advancements have been points with a sentence structure clearly diferent from the
achieved in natural language understanding. Still, when reformulations we asked for. Moreover, automatic
checka message can be interpreted as diferent meta-queries, ing routines help the participants to stick to the task (e.g.,
the problem is far from solved. For example, what if the alerts for undesired repetitions or missing terms). The
inseeker would have asked “OK, how about vaccinations?” terface resembles a WhatsApp chat to prime participants
as their second message in Figure 1 (b)? Is the intent to on chat messages [43].
specify the previous query or to start a new one? Hints After an initial “ready”-interaction to illustrate the task
on the true intent might be found in previous messages (cf. top of Figure 2), each participant completed twelve
(relation between ‘vaccination’ and the previous query) assignments from one domain as a single search session.
or previous results (maybe the seeker read something that To analyze reformulation diversity, we changed the task
caused the question). Other conversations may suggest domain and topic between participants: either finding
quite diferent interpretations. For example, if asked arguments on banning plastic bags, finding books on
(Sciafter “Can you show me articles about its treatments?”, Fi) viruses, finding news on COVID-19, or finding trips
one could interpret ‘vaccination’ as a replacement for to San Jose (a very widespread city name). However,
‘treatments.’ To resolve such ambiguities, search systems the search tasks for each participant had the same
strucmay ask the seeker for clarification [ 39, 40] or they may ture of abstract operations (e.g., create one term) with
try heuristic disambiguation. Such heuristics could, for only keywords being replaced between the domains.5 To
example, employ word or entity relationships (e.g., using ensure a variety of reformulations, we formulated the
WordNet or knowledge graphs) or query performance instructions to cover all four CRUD operations, to vary
predictors like term specificity and result coherence [ 41]. the targets from a single literal to the whole query, to
cover conjunctions and disjunctions, and to include some
3.3. Formulating Laconic Queries for special cases like a filter attribute, an unspecified literal,
Keyword-based Retrieval or a negation. Participants completed a session in about
12 minutes (observed in the pilot studies and the final
The example in Figure 1 (b) shows that conversational study) and we adjusted the payment to cover the
minreformulations (like the seeker’s second message) have imum wage of the respective country.6 Unfortunately,
to be converted to context-independent queries to sub- we had to stop our study in India and Australia after the
mit them to standard retrieval systems. This is similar to ifrst domain (news). Only 22% of the Indian participants
“query rewriting,” a process that resolves co-references provided reasonable messages for the tasks (61% in other
in conversational question answering (e.g., [6]). In fact, countries) while getting answers from 20 Australian
parsimilar methods may be efective for conversational re- ticipants alone exhausted our time constraints. In total,
formulations. In the protocol stack of Figure 1 (a), con- we accepted the work of 284 participants.
versational reformulations can thus be seen as a service To ensure the dataset’s quality and ease processing,
of the conversation layer that builds upon the retrieval we manually checked each message. Of the initially
service of the laconic layer. 3408 messages, 2917 are grammatically and semantically
meaningful in the respective context. Of these, 2694 (79%
4. Crowdsourcing Reformulations of all) can be interpreted as the respective intended
metaquery and form the final dataset of 558 messages for the
argument domain, 573 for book, 961 for news, and 602 for
trip (cf. Table 2 for other key statistics).</p>
          <p>To foster research on conversational query
reformulations, we publish a respective crowdsourced dataset4 that
accounts for diversity in seeker location (five
Englishspeaking countries) and search domain (four diferent
ones). The dataset’s goal is to allow for analyzing the
diversity and ambiguity in the language of conversational
reformulations. However, the dataset also allows to
bootstrap the natural language understanding component of
conversational systems [42].</p>
          <p>Figure 2 shows the interface used in Amazon’s
Mechanical Turk marketplace to collect “natural” reformulations.</p>
          <p>We iteratively refined the interface in eight pilot studies</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>4Publicly available at https://doi.org/10.5281/zenodo.5031960.</title>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>5. Analyzing Reformulations</title>
      <sec id="sec-4-1">
        <title>Like for all natural language systems, also developing</title>
        <p>systems that allow for conversational query
reformulations demands investigating the peculiarities of the</p>
      </sec>
      <sec id="sec-4-2">
        <title>5The keywords are contained in the README file of the dataset.</title>
        <p>The annotation interface for each domains is presented by the
respective &lt;domain&gt;-interface.html file.</p>
        <p>6https://medium.com/ai2-blog/crowdsourcing-pricing-ethics-and-bestpractices-8487fd5c9872
respective language. To this end, Section 5.1 provides a across both search domains and countries, indicating that
general overview of the messages collected in our dataset, a generic reformulation resolution system might be
feahighlighting diferences in language use between search sible. In Section 5.2, we report on our detailed analysis
domains and countries. Though the exact patterns occur of the ambiguities in the messages, showcasing both the
with diferent frequencies, they, in general, are similar ambiguities and possible ways to avoid them.</p>
        <p>To investigate on the word patterns of conversational
query reformulations and diferences between search
domains and countries, our study design employs the
same sequence of twelve abstract tasks for each
participant, only exchanging a few keywords to specify the
diferent search domains. Table 3 shows the formal tasks
and provides general characteristics of the collected
messages. The ∑︀-column shows the total number of valid
messages per task. Though this number is close to the
maximum of 284 (the number of participants) for most
tasks, it is relatively low for Tasks 4, 9, and 10, indicating
a misunderstanding of the participants. We see such
misunderstandings as an artifact of our study setup and filter
out the afected messages from our below analyses. 7</p>
        <sec id="sec-4-2-1">
          <title>5.1. Comparing Messages across Tasks,</title>
        </sec>
        <sec id="sec-4-2-2">
          <title>Domains, and Countries</title>
          <p>We have systematically analyzed the 2694 messages of
our dataset. Besides the more general analyses of
message types, we also focus on word frequencies and
patterns. Apart from a small diference in preposition
frequencies for trips (more frequent use of “to” when “about”
is used in the other domains), argument search has one
diference to the other domains in that a few participants
formulated their requests not as a query but asking for
the system’s opinion (e.g., “What do you think about
banning plastic bags?”).</p>
        </sec>
      </sec>
      <sec id="sec-4-3">
        <title>Message types For a first general overview, we manu</title>
        <p>ally annotated each message as being a command, a
question, or a statement. The left part of Table 2 shows the
message type usage per country. While participants from
Australia and India used more commands, participants
from Great Britain used more questions, and participants
from the United States used more statements on average.
Overall, we found this observation to show the main
dif</p>
      </sec>
      <sec id="sec-4-4">
        <title>7For completeness, we provide these messages in a separate file</title>
        <p>along with the dataset.
ference between countries, with no notable diference in
word choice in the relatively small amount of data.</p>
        <p>Table 3 shows the message type usage per task. The
most frequent are commands (e.g., “Please remove
arguments about banning plastic bags.” for Task 12) that
often make up at least 60% of all messages per task. The
one task where the majority of messages are questions
is Task 9, which is the only task that involves a read
operation (e.g., “Can you please remind me of my
previous commands?” and “What did I search for?”). Though
statements (e.g., “I would like to see news that are not
about COVID-19.” for Task 12) are relatively rare in
general, they are the dominant type for the two tasks that
deal with correcting a misunderstanding: Task 6 is to
tell the system that it misinterpreted an acronym (but
leaving the acronym unspecified, e.g., “I did not mean
NI as North Ireland.”), whereas Task 7 is to specify the
intended meaning (e.g., “I meant National Insurance.”).
Participants switching to statement messages might thus
be an indicator that they are pointing out problems.
References to current list As a potential signal to
identify reformulations, participants sometimes, but
unfortunately rarely, refer to the items in the (imagined)
result list when reformulating the query (e.g., “Which
of these include vaccination?”). Specifically, in the rare
cases for the respective tasks (all but Tasks 1, 6, and
7), participants use those (3%), ones (3%), these (1%), or
them (0.4%). Somewhat frequently, 16% refer to the list
and 2% to results (e.g., “only show me results that include
vaccination”). As a diference between domains, 1% of
messages in the respective tasks of the trip domain use
there (e.g., “I want to have a travel to there by ship.”).
More common than references to the current list is the
use of the domain-specific item ( argument, book, article,
trip), with the special case of the phrases ‘pros and cons’
and ‘for and against’ to specify that both sides should be
considered in argument search (e.g., “Can you give me
arguments for and against banning plastic bags please”).
However, these do not indicate reformulations.</p>
      </sec>
      <sec id="sec-4-5">
        <title>Growing and shrinking As a somewhat strong sig</title>
        <p>nal for reformulations, many participants explicitly
expressed whether the result list should grow or shrink.</p>
        <p>Verbal expressions for shrinking the current list (Tasks 2,
5, 12) are remove (9% of messages in these tasks), filter (5%,
e.g., “Filter list to just about vaccination.”), exclude (4%),
narrow down (3%), reduce (1%), limit (0.7%), filter out (0.5%,
e.g., “Please filter out all articles that are not about
vaccination.”) and shorten (0.5%). Note that some of these
verbs indicate which items to remove, whereas others
indicate which items to keep. Overall, 26% of the messages
in these tasks contain a verb that explicitly requests to
shrink the list. Other signals for shrinking are the use of
only (18%) and just (6%), though these percentages may Specializing a query or starting a new one When
be inflated as the task descriptions also contain these. asked to specialize the query by adding a new term</p>
        <p>Frequently used verbal expressions for growing the (Task 2), the majority of our participants (66%, cf.
Tacurrent list (Tasks 3, 4) are add (25%), add back (2%, e.g., ble 3) used a message that one could also interpret as
“add back the trips by car.”), expand (3%, e.g., “Expand the starting a new query with that one term (e.g., “Just show
list to include books about plants too.”). Other signals for me arguments about CO2 emissions”). We observe the
growing are the use of also (23%), as well (4%), too (3%, same ambiguity in other specialization tasks (Task 3, 16%
e.g., “can you also add those including treatment too?”), of messages, e.g., “Can you show me arguments that are
and as well as (1%). Interestingly, participants used the about renewable resources?”; Task 5, 52%, e.g., “May I
verb keep both to shrink the list in Task 2 (2% of messages please see the articles that have NCD, NI, or WHO in the
for Task 2, e.g., “Keep articles related to vaccination”) and headline?”) and in tasks that ask to start a new query
in a lexically indistinguishable way to partially undo such (Task 11, 48%, e.g., “Find a list of books about evolution.”).8
shrinking in Task 3 (1%, e.g., “Please keep the arguments Still, some participants directly used unambiguous
mesabout renewable resources”). sages, either by explicitly referencing the current list
(e.g., “Great can you refine that to articles with NCD, NI
Summary The observed diferences between countries or WHO in the headline?”) or indicating a new list or
and domains are relatively small. A change of the seeker search (45% of the messages for Task 11, e.g., “Find a list
from asking questions to expressing statements often of books about evolution,” “New search on evolution,” or
indicates specific unusual requests, though diferences “Disregard all previous instructions and now only find me
between countries need to be considered. Finally, many books about evolution”). Moreover, 8% of the messages
participants directly requested the growing and shrinking for Task 11 are unambiguous due to explicitly expressing
of the result list in their reformulations. a replacement, for example, “Show me trips to Santiago
instead.”</p>
        <sec id="sec-4-5-1">
          <title>5.2. Analyzing Operation Ambiguities</title>
        </sec>
      </sec>
      <sec id="sec-4-6">
        <title>A common problem for natural language interfaces is</title>
        <p>the ambiguity of natural language. For reformulations,
this means that the same message can be interpreted as
diferent operations. In our study, we found the below
three main ambiguities.</p>
        <p>Unclear precedence Though there are precise rules
for operator precedence in logics, no such rules exist for
8Taken literally, also several messages for Task 1 and 12 would
be ambiguous. However, the alternative interpretations make no
sense in the respective contexts. We ignore these strictly lexical
ambiguities in our considerations.
natural language. Indeed, 72% of the messages for Task 3
do not clearly express whether the new term should be
an alternative just to the last term (as asked for) or to
the entire query (e.g., “Could you please also include
arguments about renewable resources?”). About 11% of
the participants’ messages are unambiguous by explicitly
stating the relation (e.g., “Show me trips by ship or by car,”
where ‘ship’ is the previously added query term). Though
not asked to do so, a few of these participants also hinted
at a reason for asking for the alternative (e.g., “Show me
trips by ship, if ship trips are not available then I would
like to select trips by car.”). A few participants (1%) made
use of an explicitly stated filter term from the previous
query, which then allowed them to refer back to it (e.g.,
“Filter list for infected animals” and then “Add plants to
iflter as alternative”).</p>
        <p>Ambiguous negation Surprisingly, several messages
submitted to tell the system that it misinterpreted an
acronym are lexically indistinguishable from filtering by
the acronym. While the majority of messages for Task 6
are unambiguous as expected (61%, e.g., “I’m not asking
for North Ireland”), 39% of the messages are ambiguous
and could easily be misunderstood (e.g., “Do not include
articles about North Ireland”). Indeed, only the fact that
the user had just added ‘NI’ as an acronym hints at the
intended meaning.
query. However, seekers may also want to fetch a query
they used some time ago, maybe to continue or refresh a
previous search.</p>
        <p>More search operators. We considered only the
standard logical operators (∨, ∧, ¬) and attribute-specific
iflters, but most retrieval systems support more. How
would seekers highlight phrases (words to be retrieved in
that sequence), initiate boosting (a term or attribute being
especially important), or fuzzy / strict term matching? As
hypothesized in Section 1, step-wise query formulation
might increase the use of diverse search operators.
Clarifications. We considered only messages from
the seeker, but studying possible system reactions is
equally essential to account for implicit feedback
(repeating what was understood) or asking clarification
questions. Both methods are likely helpful to explain and
resolve ambiguities, and could at the same time allow the
system to showcase unambiguous formulations in an
attempt to teach the seeker how to prevent the ambiguities
in the future.9</p>
        <sec id="sec-4-6-1">
          <title>Implications for Conversational Search</title>
          <p>We can only hypothesize how a seeker’s interactions
differed if a search system supported conversational query
reformulations. As mentioned above and in Section 1,
one possibility is that the reduced cognitive efort due
to step-wise and natural language query formulation
encourages more complex queries that contain more search
6. Conclusion operators. Extending on these considerations, we expect
that some seekers will desire to regularly use the same
We have formalized the problem of supporting reformu- query like a feed (e.g., for news, but also for professional
lations in conversational search systems. By casting re- activities like scholarly search [45]) and may see query
formulations as meta-queries that imply standard CRUD formulation as an act of personalization. Therefore, some
operations on the “actual” query, we demonstrate that systems may even aim to support reformulations like “A
such functionality could be implemented in a conversa- bit more on soccer.” At the same time, we believe that
tion layer on top of standard retrieval architectures. An supporting reformulations will be essential for having a
analysis of a new dataset of 2694 crowdsourced human conversation between seeker and search system, as
rereformulations across four search domains shows that a formulations implement a straightforward way for the
generic reformulation component is feasible when consid- seeker to ground the conversation [46], complementing
ering the peculiarities of the respective search domains. clarification questions from the system. At such stage,
However, we also find that ambiguities in the reformula- the conversations will be more natural. And the users
tions will likely be a major challenge for conversational will be “relieved” from the below laconic layer—just like
systems. Ambiguities thus merit further investigations. today’s users of the laconic layer do not need to know
any details about the underlying TCP/IP layer.</p>
        </sec>
        <sec id="sec-4-6-2">
          <title>Future Work</title>
        </sec>
      </sec>
      <sec id="sec-4-7">
        <title>We see several opportunities to extend the analysis of this paper.</title>
        <p>Other languages. We considered only English mes- This work has been partially funded by the Google
Digisages so far but expect at least some of the results to be tal News Initiative as part of the “Conversational News”
language-dependent. Further analyses will need to be project.
conducted for other languages.</p>
        <p>Generalized read operation. We considered only
the most simple read-operation: reading the current</p>
      </sec>
      <sec id="sec-4-8">
        <title>9Methods to explain ambiguities in reformulations may build</title>
        <p>upon early work on explaining ambiguities in formal query
languages [44].</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments References</title>
      <p>CoRR abs/2001.06910 (2020). URL: https://arxiv.org/
abs/2001.06910.
[46] H. H. Clark, S. E. Brennan, Grounding in
communication, in: Perspectives on Socially Shared
Cognition, APA, 1991, pp. 127–149.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <year>2019</year>
          , pp.
          <fpage>5918</fpage>
          -
          <lpage>5924</lpage>
          . URL: https://www.aclweb.
          <article-title>requests and thoughtful actions</article-title>
          , in: H.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>G</given-names>
          </string-name>
          . Levow,
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          org/anthology/D19-1605. doi:
          <volume>10</volume>
          .18653/v1/D19-
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Sisman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Vandyke</surname>
          </string-name>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          1605.
          <string-name>
            <given-names>N.</given-names>
            <surname>Dethlefs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Li</surname>
          </string-name>
          (Eds.),
          <source>Proc. of SIGdial</source>
          , [24]
          <string-name>
            <given-names>S.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bennett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <surname>ACL</surname>
          </string-name>
          ,
          <year>2021</year>
          , pp.
          <fpage>77</fpage>
          -
          <lpage>88</lpage>
          . URL: https://aclanthology.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Few-shot generative conversational query org/2021</article-title>
          .sigdial-
          <volume>1</volume>
          .9.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>rewriting</surname>
          </string-name>
          ,
          <year>2020</year>
          . arXiv:
          <year>2006</year>
          .
          <volume>05009</volume>
          . [35]
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Leggett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Williams</surname>
          </string-name>
          , An empirical investiga[25]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Mathias</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Guo, tion of voice as an input modality for computer pro-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <article-title>ken language understanding system</article-title>
          ,
          <source>CoRR Studies</source>
          <volume>21</volume>
          (
          <year>1984</year>
          )
          <fpage>493</fpage>
          -
          <lpage>520</lpage>
          . doi:
          <volume>10</volume>
          .1016/S0020-
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          abs/
          <year>2002</year>
          .05607 (
          <year>2020</year>
          ). URL: https://arxiv.org/abs/ 7373(
          <issue>84</issue>
          )
          <fpage>80057</fpage>
          -
          <lpage>7</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <year>2002</year>
          .05607. arXiv:
          <year>2002</year>
          .
          <volume>05607</volume>
          . [36]
          <string-name>
            <given-names>L.</given-names>
            <surname>Rosenblatt</surname>
          </string-name>
          ,
          <string-name>
            <surname>Vocalide:</surname>
          </string-name>
          <article-title>An ide for programming [26] S.-</article-title>
          <string-name>
            <surname>C. Lin</surname>
            ,
            <given-names>J.-H.</given-names>
          </string-name>
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Lin</surname>
          </string-name>
          ,
          <article-title>Contextualized via speech recognition</article-title>
          ,
          <source>in: Proc. of SIGACCESS,</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <article-title>query embeddings for conversational search</article-title>
          ,
          <year>2021</year>
          . ASSETS'17,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA,
          <year>2017</year>
          , pp.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <source>arXiv:2104.08707</source>
          .
          <fpage>417</fpage>
          -
          <lpage>418</lpage>
          . doi:
          <volume>10</volume>
          .1145/3132525.3134824. [27]
          <string-name>
            <given-names>S.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          , C. Guo, [37]
          <string-name>
            <given-names>A. W.</given-names>
            <surname>Biermann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fineman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. F.</given-names>
            <surname>Heidlage</surname>
          </string-name>
          , A
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>ICASSP</surname>
          </string-name>
          , IEEE,
          <year>2021</year>
          , pp.
          <fpage>7997</fpage>
          -
          <lpage>8001</lpage>
          . doi:
          <volume>10</volume>
          .1109/ Machine Studies 37 (
          <year>1992</year>
          )
          <fpage>1</fpage>
          -
          <lpage>21</lpage>
          . doi:
          <volume>10</volume>
          .1016/
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>ICASSP39728.</surname>
          </string-name>
          <year>2021</year>
          .
          <volume>9413840</volume>
          .
          <fpage>0020</fpage>
          -
          <lpage>7373</lpage>
          (
          <issue>92</issue>
          )
          <fpage>90089</fpage>
          -
          <lpage>4</lpage>
          . [28]
          <string-name>
            <given-names>N. J.</given-names>
            <surname>Belkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kelly</surname>
          </string-name>
          , G. Kim,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lee</surname>
          </string-name>
          , G. Mure- [38]
          <string-name>
            <given-names>J.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <source>Managing the Data Base Environment</source>
          ,
          <fpage>1</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          san, M. M.
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Yuan</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Cool</surname>
          </string-name>
          , Query length ed.,
          <string-name>
            <surname>Prentice Hall</surname>
            <given-names>PTR</given-names>
          </string-name>
          , USA,
          <year>1983</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <article-title>in interactive information retrieval</article-title>
          , in: C. L. A. [39]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kiesel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bahrami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Anand</surname>
          </string-name>
          , M. Ha-
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Smeaton</surname>
          </string-name>
          (Eds.),
          <source>Proc. of SIGIR</source>
          , ACM,
          <year>2003</year>
          , pp.
          <fpage>205</fpage>
          -
          <string-name>
            <surname>of</surname>
            <given-names>SIGIR</given-names>
          </string-name>
          , ACM,
          <year>2018</year>
          , pp.
          <fpage>1257</fpage>
          -
          <lpage>1260</lpage>
          . doi:
          <volume>10</volume>
          .1145/
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          212. doi:
          <volume>10</volume>
          .1145/860435.860474. 3209978.3210160. [29]
          <string-name>
            <given-names>N.</given-names>
            <surname>Balasubramanian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Kumaran</surname>
          </string-name>
          , V. R. Car- [40]
          <string-name>
            <given-names>H.</given-names>
            <surname>Zamani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. T.</given-names>
            <surname>Dumais</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. N.</given-names>
            <surname>Bennett</surname>
          </string-name>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <given-names>E. N.</given-names>
            <surname>Efthimiadis</surname>
          </string-name>
          , J. Savoy (Eds.),
          <source>Proc. of</source>
          SI- M. van Steen (Eds.),
          <source>Proc. of WWW</source>
          <year>2020</year>
          , ACM /
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <surname>GIR</surname>
          </string-name>
          , ACM,
          <year>2010</year>
          , pp.
          <fpage>571</fpage>
          -
          <lpage>578</lpage>
          . URL: https://doi.org/ IW3C2,
          <year>2020</year>
          , pp.
          <fpage>418</fpage>
          -
          <lpage>428</lpage>
          . doi:
          <volume>10</volume>
          .1145/3366423.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          10.1145/1835449.1835545. doi:
          <volume>10</volume>
          .1145/1835449. 3380126.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          1835545. [41]
          <string-name>
            <given-names>J.</given-names>
            <surname>Arguello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Avula</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Diaz</surname>
          </string-name>
          , Using query perfor[30]
          <string-name>
            <given-names>M.</given-names>
            <surname>Bendersky</surname>
          </string-name>
          , W. B.
          <string-name>
            <surname>Croft</surname>
          </string-name>
          ,
          <article-title>Discovering key con- mance predictors to improve spoken queries</article-title>
          , in:
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <string-name>
            <surname>GIR</surname>
          </string-name>
          , ACM,
          <year>2008</year>
          , pp.
          <fpage>491</fpage>
          -
          <lpage>498</lpage>
          . URL: https://doi.org/ ECIR, volume
          <volume>9626</volume>
          <source>of LNCS</source>
          , Springer,
          <year>2016</year>
          , pp.
          <fpage>309</fpage>
          -
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          10.1145/1390334.1390419. doi:
          <volume>10</volume>
          .1145/1390334. 321. doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -30671-1\_
          <fpage>23</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          1390419. [42]
          <string-name>
            <given-names>C.</given-names>
            <surname>Pearl</surname>
          </string-name>
          , Designing Voice User Interfaces: Princi[31]
          <string-name>
            <given-names>F.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. V.</given-names>
            <surname>Jagadish</surname>
          </string-name>
          ,
          <article-title>Constructing an interactive ples of Conversational Experiences</article-title>
          , 1st ed.,
          <source>O'Reilly</source>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          <article-title>natural language interface for relational databases</article-title>
          , Media, Inc.,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          <source>Proc. VLDB Endowment</source>
          <volume>8</volume>
          (
          <year>2014</year>
          )
          <fpage>73</fpage>
          -
          <lpage>84</lpage>
          . doi:10. [43]
          <string-name>
            <given-names>A.</given-names>
            <surname>Papenmeier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kern</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hienert</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Sliwa,
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          <volume>14778</volume>
          /2735461.2735468. A.
          <string-name>
            <surname>Aker</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Fuhr</surname>
            , Starting conversations with search [32]
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Afolter</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Stockinger</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Bernstein</surname>
          </string-name>
          ,
          <article-title>A compar- engines - interfaces that elicit natural language</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          <article-title>for databases</article-title>
          ,
          <source>VLDB Journal 28</source>
          (
          <year>2019</year>
          )
          <fpage>793</fpage>
          -
          <lpage>819</lpage>
          . H.
          <string-name>
            <surname>Joho</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Kando</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          Smith (Eds.),
          <source>Proc. of CHIIR,</source>
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          <source>doi:10.1007/s00778-019-00567-8</source>
          . ACM,
          <year>2021</year>
          , pp.
          <fpage>261</fpage>
          -
          <lpage>265</lpage>
          . doi:
          <volume>10</volume>
          .1145/3406522. [33]
          <string-name>
            <given-names>E.</given-names>
            <surname>Kuric</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Fernández</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Drozd</surname>
          </string-name>
          , Knowledge
          <volume>3446035</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          <article-title>graph exploration: A usability evaluation of query</article-title>
          [44]
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Wald</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. G.</given-names>
            <surname>Sorenson</surname>
          </string-name>
          , Explaining ambiguity
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          <string-name>
            <surname>Mauroux</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Maleshkova</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Pellegrini</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Sack</surname>
          </string-name>
          ,
          <source>Database Systems</source>
          <volume>15</volume>
          (
          <year>1990</year>
          )
          <fpage>125</fpage>
          -
          <lpage>161</lpage>
          . doi:
          <volume>10</volume>
          .1145/
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sure-Vetter</surname>
          </string-name>
          (Eds.),
          <source>Proc. of SEMANTiCS</source>
          , volume
          <volume>78922</volume>
          .
          <fpage>78923</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          <source>11702 of LNCS</source>
          , Springer,
          <year>2019</year>
          , pp.
          <fpage>326</fpage>
          -
          <lpage>342</lpage>
          . doi:10. [45]
          <string-name>
            <given-names>K.</given-names>
            <surname>Balog</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Flekova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hagen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jones</surname>
          </string-name>
          , M. Pot-
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          <volume>1007</volume>
          /
          <fpage>978</fpage>
          -3-
          <fpage>030</fpage>
          -33220-4\_24.
          <string-name>
            <surname>thast</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Radlinski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Sanderson</surname>
            ,
            <given-names>S.</given-names>
            Vakulenko, [34] S.
          </string-name>
          <string-name>
            <surname>Tanaka</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Yoshino</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Sudoh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Nakamura</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Zamani</surname>
          </string-name>
          ,
          <string-name>
            <surname>Common Conversational</surname>
          </string-name>
          Commu-
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>