<!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>PatentQuest: A User-Oriented Tool for Integrated Patent Search</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Manajit Chakraborty</string-name>
          <email>manajit.chakraborty@usi.ch</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>David Zimmermann</string-name>
          <email>david.zimmermann@usi.ch</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabio Crestani</string-name>
          <email>fabio.crestani@usi.ch</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Informatics, Università della Svizzera italiana</institution>
          ,
          <addr-line>Lugano</addr-line>
          ,
          <country country="CH">Switzerland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2021</year>
      </pub-date>
      <fpage>89</fpage>
      <lpage>101</lpage>
      <abstract>
        <p>Patent Search is a well-established research field. In existing Patent Search systems, a user needs to explicitly enter a set of keywords to retrieve a set of ranked results. Conventional patent search systems lack the capability to run directly from the user's text editor. Moreover, to the best of our knowledge, most practical systems do not leverage explicit user feedback and domain-specific context to enhance the quality of search results. In this paper, we describe a system that ofers a single point of access for patent information coming from diferent sources as well integrates the capability for user feedback and the ability to search from the text editor itself without the need to switch applications. To explore the viability and efectiveness of such a system, we created and deployed it as a web service plug-in for Microsoft Word®and conducted both system and user evaluation on a benchmark dataset.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Patent Search</kwd>
        <kwd>Integrated Search</kwd>
        <kwd>Relevance Feedback</kwd>
        <kwd>User Study</kwd>
        <kwd>Add-in</kwd>
        <kwd>Web Service</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>In recent times the scale of intellectual property rights, including patents, have seen an
unprecedented increment in the market globally. To keep up with this global phenomenon, patent
ofices in several countries are trying to improve patent prosecution quality while minimising
the time required to grant patent rights without compromising the robustness of the patent
evaluation structure. As such, the ownership of patents is fast becoming one of the most
important measures of individual and business as well as national competitiveness. Hence, many
companies have recently been encouraging and patenting the newest technologies in huge
quantities. Compared to the increasing number of patent documents, the number of patent
examiners and judges to handle them is not suficient enough, and allocating the excessive
workload to the limited workforce resources will inevitably deteriorate the quality of patent
examination. Therefore, it is imperative for both the applicant and the examiner to perform
the manual patent examination process both quicker and more accurate than before.</p>
      <p>The patent search tasks have the following several purposes. One of them is ‘prior art search’,
which has been required before patent filing or for the prevention of patent infringement. It
is significantly diferent for the patent search system on that the purpose and characteristics
of the existing search engines have long been endowed. While there are various public patent
search systems like PatentScope1, Espacenet2 etc. and even commercial patent search systems
such as Google Patents3. However, these systems often come with a big learning curve or are
limited by their own data collections. Moreover, since patent prior-art search involves specific
legalese, various firms ofer patent search services like PatentSight 4 for a high price quote. For
an inventor, especially a first-time patent applicant, it might seem both an overwhelming and
expensive task. To address these issues, we demonstrate the viability of a more user-oriented
system that is cost-free. This is achieved by direct integration into the user’s text editor,
allowing for search without reformulating the text into a query and working hand in hand with the
user through a user feedback loop, leveraging domain-specific context information.</p>
      <p>
        The stated goal is implemented with the construction of a functioning system prototype
called PatentQuest. The system is deployed as a simple add-in to the online web service of
Microsoft Word®. The advantage of such a system is that it incorporates the patent search
within the text editor itself, thus allowing us to harness the power of explicit user feedback
while allowing the user to access the patent text content, all without the need of switching
between applications. The prototype system was evaluated on the CLEF-IP 2011 Prior-Art
Search [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] track dataset for system performance and eficiency, while a separate user-study
was conducted to gauge the system’s usability and convenience.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Patents pose several domain-specific challenges when it comes to information retrieval [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
Further complications can arise from the fact that patents are written in diferent languages,
are semi-structured and that the input for building a query can itself be a multi-page patent
application [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. To achieve better search performance, diferent techniques for query
reformulation have been tested, and applied [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. A potential technique for query expansion is
“Pseudorelevance feedback” (PRF), in which a first search based on an initial query is run and then
features are extracted from the best scoring results to run a second run search. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] produced an
especially interesting result when they conducted their research on PRF. While they failed to
demonstrate the better performance of their PRF techniques over the baseline keyword search,
they found that the baseline performance can be doubled if just one extra document is marked
as relevant by the user, suggesting that the interaction with the user is very powerful. Another
approach to query expansion is the addition of synonyms or semantically related concepts to
the given query terms. In the patent domain, diferent sources for the addition of this
semantic information have been tested. Synonyms have been extracted from the general dictionary
WordNet5 or from the document corpus itself [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], domain-specific dictionaries have been built
based on examiners’ search queries [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and Wikipedia6 articles have been exploited for
related sentences [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. All of these systems mentioned above perform with rather mixed results.
1https://www.wipo.int/patentscope/en/
2https://www.epo.org/searching-for-patents/technical/espacenet.html
3https://patents.google.com/
4https://www.lexisnexisip.com/products/
5https://wordnet.princeton.edu/
6www.wikipedia.org
(a) Initial search screen.
(b) Term highlighting in search results.
      </p>
      <p>
        The IPC Classifications have been another source for query extension. Verma and Varma [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
built a classification vector for all patents in the data set and calculated the cosine similarity
of the documents based on these vectors, which was the best performing system in CLEF-2011
Prior Art Search track. Patents also contain citation information that can be exploited in
different ways. Mahdabi et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] extracted citations from the text of the patent application and
added those citations directly to the search results. Crestani et al. [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ] used the citations to
build citation networks and exploit information gained from that network, among others using
PageRank (see [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] for more details on PageRank).
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. PatentQuest</title>
      <p>In our literature review, we did not come across any system that ofers the flexibility of Patent
Search or Recommendation incorporated within a free-text document editor. In lieu of that, we
built a prototype for our system called PatentQuest that facilitates users or inventors to have
an integrated system at disposal that can fulfil their bibliographic needs while formulating a
patent document. The prototype is distributed as an add-in to the online version of Microsoft
Word® under Microsoft Ofice 365. Microsoft Word ofers any developer to develop a piece
of software or tool and integrate it with Word as an add-in without much hassle. This drove
us to prepare a Patent Search prototype for Word. Although we intend to built an add-in for
the desktop version of Microsoft Word in the immediate future, our goal here is to provide a
proof-of-concept of such a prototype and the advantages it brings with it. In this section, we
describe the user-interface and its characteristics.</p>
      <p>The objective of the user interface is to keep the usage of the add-in as intuitive and
selfexplanatory as possible. After installation of the add-in, the user will see an additional icon
under the “Home” tab. On clicking the icon, a side window opens for the user to interact with
the system. The advantage of such a window-based system is that it allows the user to be free
of unnecessary distraction while writing, as the window can be simply closed by re-clicking
on the add-in button on the tab. A user is provided with basic instruction on how to use the
system before starting running a search. The user is instructed to select a part of or the full
text (in the current editor window) to run the search on and to click the Search button in the
side window.
(a) Pop-up screen with patent details.
(b) Interface with user feedback information.</p>
      <p>Queries can be issued in any of the three languages English, German or French. The search
results show the English title of the patent, its document ID and an excerpt from the search,
highlighting matching terms found from the query. By default, only the ten most relevant
results are displayed with a link at the bottom of the window, which displays up to an additional
20 search results. The search results window is flexible, allowing the extended results to be
hidden with a link at the bottom. A sample screenshot of the interface with search results is
presented in Figure 1. For each search performed, the search query is preserved for reference
purposes.</p>
      <p>Clicking on the title of a patent opens up a pop-up window, displaying the content of a full
document (Figure 2a). The editing space and search results are static in the background while
the full-text of the patent is displayed in the scrollable pop-up window. This allows the user
to have a comfortable reading experience without losing the search results or the text written
so far in the editor window. In the display window, the upper section is devoted to meta-data
information i.e., the title of the patent in English, and the document ID is shown at the top
followed by the file types (whether it is an application or grant). In the lower section, the rest
of the relevant sections extracted from the patent document are displayed, like the citations,
the abstract, the claims or the description.</p>
      <p>
        Additionally, each search result comes with a button to mark it as relevant (Figure 2b). Once a
document has been marked as relevant, a panel shows up on top of the search button displaying
a list of documents (sorted by their document ID) that have been selected by the user. The
panel also allows to delete the documents again or display them in full by clicking on the ID.
The user has the option to issue a new search at any time. If given documents are marked as
relevant, they will be taken into account for the new search (see section 5.1) for an explanation
on relevance feedback). Once the user has received is satisfied with the desired search results,
the side window can be closed again by clicking on the cross button on the top right corner.
The side window can be re-opened by clicking on the add-in’s panel in the "Home" tab. As long
as the application window is not closed and reloaded, the current session’s search results and
documents marked as relevant remain intact. The option to select and mark relevant documents
from search results as relevant (explicit relevance feedback) helps user to drive their navigation
in a specific direction and has been shown to improve prior-art search previously [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. This is
particularly helpful if an inventor is looking for similar or seminal patents on a specific topic.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Implementation Details</title>
      <sec id="sec-4-1">
        <title>4.1. Dataset</title>
        <p>We used the dataset from CLEF-IP 2011 track7 for building and evaluation of our system. The
dataset consists of over 1 million patents from the European Patent Ofice 8 prior to the year
2002 and additional 400,000 patent applications published by the World Intellectual Property
Organization in XML format.9 The elements of the XML files can be roughly divided into two
categories: Text fields with the contents of the patent and fields with meta information. The text
ifelds of a patent are: Title, Abstract, Description and Claims. In the dataset, the text elements of
a patent can be in one of three languages: English, German or French. Generally, the title of the
patent is available in all three languages and other text fields in only one language. For each
patent, several documents can be published, depending on the information available at the time
of publishing. The documents are encoded with “A1”, “A2”, ... for the application phase and
with “B1”, “B2”, ... for the granting phase. The relevant information about the patents is spread
over several documents in some cases. Overall the dataset comprises of around 2.5 million files.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. System Design</title>
        <p>The system design can be broadly divided into two parts: (i) the front-end or user-inteface (ii)
the back-end handling the query processing and display of the results. In Figure 3, we present
an overview of the implementation of the system.</p>
        <sec id="sec-4-2-1">
          <title>4.2.1. User Interface</title>
          <p>PatentQuest was motivated by the lack of an integrated system within existing workflows. The
system thus built should complement the creation of documents by always suggesting relevant
7http://www.ifs.tuwien.ac.at/~clef-ip/download/2011/index.shtml
8https://www.epo.org/
9www.wipo.int
sources based on the current text written by the user. This is beneficial since it saves the user
both the time and efort required to switch between applications to gather relevant sources
to cite. An ideal system in this scenario should provide the user all the functionalities of a
standard text editor while also providing not only an integrated list of relevant search results
but one that also allows adding parts of a relevant source directly into the text. In addition,
the system should also be backwards compatible with existing documents. All of this suggests
that the best way would be to apply one of the more popular text editor currently in use by
users and experts as a user interface that ofers the possibility of customisation. In light of
this, Microsoft Word stands out as a favourable choice for this task. Microsoft ofers two ways
to create extensions to their “Ofice Suite” programs, both with their own caveats: (a) Ofice
Add-ins and (b) COM/VSTO Add-ins.</p>
          <p>As mentioned earlier, our system is built as an Ofice Add-in. This is the newer format to
create an add-in for Microsoft Ofice products. All ofice applications ofer a JavaScipt API
("Ofice JS") to access the contents of the document and ofer a browser engine that runs in
a side-window of the application to render HTML5 and CSS, as well as execute JavaScript.
This form of the add-in is cross-platform compatible, unlike the COM/VSTO add-in, which
was the main reason it was chosen for the implementation of the prototype system. It also
ofers strong security through the limited access of the JavaScript add-in on the user’s system.
At the same time, the strong security measures implemented by Microsoft induce the biggest
drawbacks of this form of the add-in. It forces the add-in to be run as a web service. The
Ofice application will only load an add-in that is served through the HTTPS protocol, making
a local standalone use of the add-in dificult. Furthermore, the distribution of the manifest file,
which contains the necessary loading information for the add-in, is built for either distribution
through an organisation with a central IT infrastructure or through the Microsoft AppSource,
which requires authorisation from Microsoft. While this limits our system by allowing us
to use only the online version of Microsoft Word through the Ofice 365 suite, it still allows
enough provision for both system and user evaluation. We aim to ofer a standalone add-in in
the near future. For our current prototype, the user needs to side-load the add-in through the
distribution of a manifesto file. The user has to simply download an XML file including the
manifesto with the required information and select it through a file manager to integrate the
add-in.</p>
        </sec>
        <sec id="sec-4-2-2">
          <title>4.2.2. The back-end</title>
          <p>There are several reasons that compelled us to deploy the system as a web service. Firstly, the
chosen form of Microsoft Ofice add-in requires a connection to a secure web service based on
the HTTPS protocol to work. Secondly, distributing the full Solr Index (explained in the next
section) to all end users would be very heavy (around 40GB) and ensuring the timeliness of
updates for the dataset becomes much easier. Finally, setting up the system becomes extremely
easy for the user. All the user has to do is load the manifest XML file into his Microsoft Word
online distribution. Flask10, a web application framework for Python, was chosen as a
foundation for the implementation of the back-end and to connect the APIs needed by the front-end to
the web. The more advanced features of the system raise the need for query generation or
reformulation and refreshing the results on-the-fly. When a search request is triggered, the user
interface sends two types of information to the Flask app in the back-end, the text selected for
query input and the patent IDs of documents marked as relevant by the user (relevance
feedback). The user input text is used as the original query, which is then expanded in two stages
using the documents marked as relevant:
• by adding the most important terms from the selected documents and then
• by adding the IPC classifications to the original query.</p>
          <p>The relative weights involved in the query expansion and reformulation have been determined
empirically (see section 5.1). The important terms are extracted using the “More Like This” MLT
feature of Apache Solr11. In the same stage, the categories/IPC classifications of the documents
are collected. This information is then used to reformulate the user request and build the final
query, which is again run against the search index.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Evaluation</title>
      <p>In this section, we describe the evaluation process and the evaluation results of the system. The
aim of the evaluation is to measure the quality of the search results as well as the usability of
the system and to gain insights into potential improvements. Hence, we conducted both system
evaluation and user evaluation to gain a fair understanding of the strengths and limitations of
our system. For the system evaluation, the CLEF-IP 2011 patent dataset is used to determine the
optimal system parameters and to compare the system’s performance with that of the systems
participating in the CLEF-IP 2011 track. This is followed by the evaluation of the system by a
test user group.</p>
      <sec id="sec-5-1">
        <title>5.1. System Evaluation</title>
        <p>In CLEF-IP 2011, the participants were provided with 3,973 topics in three languages (English,
German and French). Various textual and non-textual elements (as described in later sections)
were also employed by the winning systems of the CLEF-IP 2011 track and were the starting
point for the queries tested below. We conducted several experiments to determine the
optimal settings and weights for each parameter used in the design of the system to have the best
possible performance. Each of these empirical studies is presented below. The evaluation
metrics used in all these experiments were (i) Mean Average Precision (MAP) and (ii) Normalized
Discounted Cumulative Gain (nDCG), which were the metrics used to judge the participant
teams’ performance in the CLEF-IP 2011 Prior-Art Search track.</p>
        <sec id="sec-5-1-1">
          <title>5.1.1. Impact of combining diferent patent sections</title>
          <p>As described in Section 4.1, a patent document consists of multiple sections. The first
experiment thus compares the search result metrics for queries generated from diferent combinations
11https://lucene.apache.org/solr/guide/6_6/morelikethis.html
of sections, which in turn translates to varying query length. The query configurations are
represented by an encoding where a combination of letters describes the combination of the fields
used. The encodings can be described as t: Title, a: Abstract, c: Claims, d: Description, ta:
Title + Abstract, tc: Title + Claims, tac: Title + Abstract + Claims and tacd: Title + Abstract +
Claims + Description. Figures 4a and 4b shows the impact on retrieval performance for choice
and combinations of diferent sections from the patent.</p>
          <p>
            As can be seen for the queries “t” to “d”, there is an increase in MAP for using longer text
elements like description and claims versus title or abstract but with rapidly declining marginal
returns and at the expense of longer run times. When the titles are combined with the abstract
or the claims, the advantage of using the descriptions subsides, despite the titles only adding an
average of around nine words (the descriptions have an average length of around 5,270 words).
Combining the description with a query that already contains the titles and the abstract and/or
the claims seems to add noise rather than any useful information. This result is confirmed
by the run, which combines all the elements, having lower performance on all metrics. The
tendency for longer queries to do better in the prior art search task at the expense of query
(a) Class weight vs MAP.
(b) Class weight vs nDCG.
speed confirms the results of [
            <xref ref-type="bibr" rid="ref15">15</xref>
            ]. As can be seen from Figures 4a and 4b, two combinations
show the best search performance, while having reasonable query length. The first one is title
and abstract, and the second one is title, abstract and claims. Hence, we proceed with these
two combinations for the rest of the experimentation.
          </p>
        </sec>
        <sec id="sec-5-1-2">
          <title>5.1.2. Impact of incorporating classification codes</title>
          <p>As mentioned earlier, each patent document and the topics have their constituent
classification codes, which we used to improve the retrieval performance by adding the IPC codes to the
optimal query generated from previous step. Figure 5a and 5b show the results for diferent
boost factors (weights) for the classification codes of the two best queries from the previous
experiment (“ta” and “tac”) as well as for the title only (“t”) query. We can observe that
incorporating IPC classification within the query adds considerable information that had not been
previously captured by the text alone. Secondly, one needs to adapt the boosting in accordance
with the query length. For instance, for a query built from the title and abstract (“ta”; average
length of 114.5 words) of the patent application, the optimal weight of the classifications is
eight times the weight of the terms (“tacl_8”), while for a query consisting of title, abstract and
claims (“tac”; average query length of 1092.4), the classifications should be assigned 32 times
the weight of each term (“taccl_32”). Interestingly, after taking into account the classification
codes, terms from the claims section do no longer seem to add useful information compared to
just using title and abstract.</p>
        </sec>
        <sec id="sec-5-1-3">
          <title>5.1.3. Impact on multi-lingual search</title>
          <p>Next, we studied the efect of retrieval performance due to languages. As stated earlier, in
the dataset, we had documents from three languages, namely, English (en), German (de) and
French (fr). Table 2 present the results obtained.</p>
          <p>One can observe that the results difer significantly, depending on the input languages. We
observed that queries in English produced the best results, closely followed by German, while
system struggled the most with queries in French. However, not only are the inputs given in
three languages but also cross-language results are expected. An input given in German might
expect a result published in French and the other way round. Since the best faring query uses
only the relatively short abstract and the title, an attempt was made to use machine translation
to achieve better results. The titles themselves are usually already given in all three languages.
For each input patent, machine translations of the abstract were created for the other two
missing languages, using the Yandex translation API12. Employing a multi-lingual search, the
performance of the system improved in most cases, and the best results were achieved when
the combined query of title, abstract and classification weight of 32 (“tacl_32”) was used.</p>
        </sec>
        <sec id="sec-5-1-4">
          <title>5.1.4. Impact of Relevance Feedback</title>
          <p>
            As part of our next experiment, we wanted to determine if relevance feedback could improve
the system performance even further. For this, we employed pseudo-relevance feedback (PRF)
in two ways: (a) by selecting top-2 relevant results returned by the optimised query and
expanding it and (b) by selecting top-2 non-relevant results for query expansion. This experiment
helped us realise two objectives, (i) whether our system was indeed responsive to relevance
feedback in the first place and (ii) the optimal weight to be considered for the same. Figures 6a
and 6c, compare the MAP performance against the term weight and classification code weight
boosting, while figures 6b and 6d, compare the nDCG performance. In both cases, we can
clearly observe that positive relevance feedback can improve retrieval performance
considerably. In fact, the best-run results obtained by our system after positive relevance feedback on
tacl_32 was 0.0905 in terms of MAP and 0.205 in terms of nDCG, which were comparable with
the best performing system at CLEF-2011 PAC track (MAP=0.097 [
            <xref ref-type="bibr" rid="ref9">9</xref>
            ]). While better results have
been achieved in the meantime (e.g. by Mahdabi and Crestani [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ]), it needs to be noted that
our objective was not to provide a mechanism for best search results but to achieve a balance
between system performance and usability of the system to general users while providing a
novel integration13.
          </p>
        </sec>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. User Evaluation</title>
        <p>
          While system evaluation could provide us with a measurable impact on the system
performance, since the tool is designed for users, it was imperative that we conducted a user
evaluation as well. In the absence of expert users, we resorted to a set of four users with high
familiarity with IR systems. To evaluate the usability of the system, the “System Usability Scale” (SUS)
was employed [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. The SUS score as recorded for the four test users is presented in Table 3.
From the table, we can observe that the standard deviation of the SUS is 18.14, which implies
that there is a wide range of diferent perceptions of the system (between 50 and 92.5). When
translated to the various scales of SUS evaluation [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], the SUS of 72.5 corresponds to a grade
"C" or a qualitative description of "Good". This lies within the range of what users tend to deem
acceptable. Naturally, smaller improvements could probably yield substantial improvements in
the scoring. Along with the SUS evaluation, the test users were asked to record their responses
to an additional questionnaire. The questionnaire has two blocks of statements. The first block
contains five extra statements about usability, which were more specific to the system than the
SUS statements. The extra statements were only presented to the participants after they had
completed rating the SUS statements in order not to influence or bias the questionnaire. The
second block of extra statements consists of three statements about the subjective quality of the
search results. The summary statistics recorded against the questionnaire is presented in Table
4. At the end of the questionnaire, the test users were presented with two text fields to add
general feedback and overall suggestions for improvements to the system. From Table 4, we
can observe that on the usability statements, the system was again perceived very diferently
by diferent users. The user group’s scoring confirms that the response time and the inclusion
of the search into the natural workflow of document creation belong to the strengths of the
system. On the other hand, the aesthetics of the interface received a score below average,
indicating room for improvement, like changing the colouring or hiding the button (for relevance
feedback) after a document has been marked relevant, to have a more polished user-interface
outlook. However, the overall user study substantiated our initial goal of building a prototype
system capable of integrating patent search within the document editor freeing the user from
having to switch between workspaces. We have duly recorded the feedbacks and suggestions
The add-in is easy to install.
        </p>
        <p>The system’s response time to search requests is adequate.</p>
        <p>The user interface has an appealing look and feel.</p>
        <p>The system can enhance the workflow of creating a new patent
document.</p>
        <p>The system is responsive to the user feedback loop.</p>
        <p>All search results shown are relevant.</p>
        <p>The most relevant results show up on top.</p>
        <p>The search brings up all documents that are relevant to the search.</p>
        <p>Mean Score</p>
        <p>Std. Dev.
provided by the test users and intend to incorporate them in the next version of our system.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions and Future Work</title>
      <p>Patent Search continues to be an active research area. In this paper, we demonstrated a
prototype system that could allow integration of patent search within a popular text editor. The
prototype deployed as a Microsoft Word add-in facilitates hassle-free integration into the text
editor window freeing the user from the need to switch between applications for prior-art
search. The system also allows user to provide relevance feedback to allow for a
precisionoriented search while also providing the added advantage of handling multiple languages. We
tested and evaluated our system, using a standard benchmarking dataset, from both the
efifciency and usability perspectives. We showed that adding domain-specific information like
IPC classification code, along with machine-translated text contents for multi-lingual search,
improved the system performance. While the impact of explicit relevance feedback could not
be determined quantitatively, we showed with the help of pseudo-relevance feedback that our
system responded positively in the presence of correct relevant results. Moreover, the overall
usability of the system was received quite favourably by the test user group.</p>
      <p>While the prototype system was well-received overall, there are further potential
improvements to the design which needs to be explored. Firstly, we would like to build an add-in for
the use of a standalone local Word installation. Secondly, we aim to achieve better system
performance by incorporating the lexical and semantic features of a patent document to account
for the several unique factors of a patent, such as obfuscation. Finally, although the PageRank
experiment (not discussed in the paper, for brevity) performed poorly in our case, we would
continue to investigate and improve the integration of such network flow metrics to better
system performance. Finally, we plan to incorporate all the additional suggestions by the test
users to improve the user-interface even further to provide it with a more polished outlook.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>F.</given-names>
            <surname>Piroi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lupu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hanbury</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zenz</surname>
          </string-name>
          , Clef-ip
          <year>2011</year>
          :
          <article-title>Retrieval in the intellectual property domain</article-title>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Lupu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Mayer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tait</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Trippe</surname>
          </string-name>
          , Current Challenges in Patent Information Retrieval, volume
          <volume>37</volume>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>W.</given-names>
            <surname>Shalaby</surname>
          </string-name>
          , W. Zadrozny,
          <article-title>Patent retrieval: A literature review</article-title>
          ,
          <source>Knowledge and Information Systems</source>
          (
          <year>2019</year>
          )
          <fpage>631</fpage>
          -
          <lpage>660</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>G.</given-names>
            <surname>Cabanac</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Frommholz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mayr</surname>
          </string-name>
          ,
          <article-title>Bibliometric-enhanced information retrieval 10th anniversary workshop edition</article-title>
          ,
          <source>in: European Conference on Information Retrieval</source>
          , Springer,
          <year>2020</year>
          , pp.
          <fpage>641</fpage>
          -
          <lpage>647</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Golestan Far</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sanner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Bouadjenek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Ferraro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hawking</surname>
          </string-name>
          ,
          <article-title>On term selection techniques for patent prior art search</article-title>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>W.</given-names>
            <surname>Magdy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <article-title>A study on query expansion methods for patent retrieval</article-title>
          ,
          <source>International Conference on Information and Knowledge Management</source>
          ,
          <string-name>
            <surname>Proceedings</surname>
          </string-name>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>W.</given-names>
            <surname>Tannebaum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mahdabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rauber</surname>
          </string-name>
          ,
          <article-title>Efect of log-based query term expansion on retrieval efectiveness in patent searching, in: Experimental IR Meets Multilinguality</article-title>
          , Multimodality, and Interaction, Springer International Publishing, Cham,
          <year>2015</year>
          , pp.
          <fpage>300</fpage>
          -
          <lpage>305</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>B.</given-names>
            <surname>Al-Shboul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.-H.</given-names>
            <surname>Myaeng</surname>
          </string-name>
          ,
          <article-title>Query phrase expansion using wikipedia in patent class search</article-title>
          , in: M.
          <string-name>
            <surname>V. M. Salem</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Shaalan</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Oroumchian</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Shakery</surname>
          </string-name>
          , H. Khelalfa (Eds.),
          <source>Information Retrieval Technology</source>
          , Springer Berlin Heidelberg, Berlin, Heidelberg,
          <year>2011</year>
          , pp.
          <fpage>115</fpage>
          -
          <lpage>126</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Verma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Varma</surname>
          </string-name>
          ,
          <article-title>Exploring keyphrase extraction and ipc classification vectors for prior art search</article-title>
          ., in: CLEF (Notebook Papers/Labs/Workshop),
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>P.</given-names>
            <surname>Mahdabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Andersson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hanbury</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Crestani</surname>
          </string-name>
          ,
          <article-title>Report on the clef-ip 2011 experiments: Exploring patent summarization</article-title>
          , volume
          <volume>1177</volume>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>P.</given-names>
            <surname>Mahdabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Crestani</surname>
          </string-name>
          ,
          <article-title>The efect of citation analysis on query expansion for patent retrieval</article-title>
          ,
          <source>Information Retrieval</source>
          <volume>17</volume>
          (
          <year>2013</year>
          )
          <fpage>412</fpage>
          -
          <lpage>429</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>P.</given-names>
            <surname>Mahdabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Crestani</surname>
          </string-name>
          ,
          <article-title>Query-driven mining of citation networks for patent citation retrieval and recommendation</article-title>
          ,
          <source>CIKM 2014 - Proceedings of the 2014 ACM International Conference on Information and Knowledge Management</source>
          (
          <year>2014</year>
          )
          <fpage>1659</fpage>
          -
          <lpage>1668</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Brin</surname>
          </string-name>
          ,
          <string-name>
            <surname>L. Page,</surname>
          </string-name>
          <article-title>The anatomy of a large-scale hypertextual web search engine</article-title>
          ,
          <source>Computer Networks and ISDN Systems</source>
          <volume>30</volume>
          (
          <year>1998</year>
          )
          <fpage>107</fpage>
          -
          <lpage>117</lpage>
          .
          <source>Proceedings of the Seventh International World Wide Web Conference.</source>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bashir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rauber</surname>
          </string-name>
          ,
          <article-title>Improving retrievability of patents in prior-art search</article-title>
          ,
          <source>in: Advances in Information Retrieval</source>
          , Springer Berlin Heidelberg, Berlin, Heidelberg,
          <year>2010</year>
          , pp.
          <fpage>457</fpage>
          -
          <lpage>470</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>D.</given-names>
            <surname>Becks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Eibl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jürgens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kürsten</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wilhelm-Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Womser-Hacker</surname>
          </string-name>
          ,
          <article-title>Does patent ir profit from linguistics or maximum query length?</article-title>
          , volume
          <volume>1177</volume>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>J.</given-names>
            <surname>Brooke</surname>
          </string-name>
          ,
          <article-title>"SUS-A quick and dirty usability scale." Usability evaluation in industry</article-title>
          , CRC Press,
          <year>1996</year>
          . ISBN:
          <volume>9780748404605</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bangor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. T.</given-names>
            <surname>Kortum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <article-title>Determining what individual sus scores mean: adding an adjective rating scale</article-title>
          ,
          <source>Journal of Usability Studies archive 4</source>
          (
          <year>2009</year>
          )
          <fpage>114</fpage>
          -
          <lpage>123</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>