2019 Haystack - How The New York Times Tackles Relevance - Jeremiah Via

•

0 likes•166 views

The New York Times has had search for a long time but 2018 was the year in which the company engaged with relevance in a deep way. The aim of this talk is to share what we've learned as we've increased our search sophistication and some of the challenges we still face. Some of the techniques we've adopted in this past year include offline metrics testing, reflective testing, and user engagement metrics. We now have a process in place to quickly get mappings changes out to production. As a team we now also have a vocabulary for talking about relevance and can use it to discuss trade-offs and goals in conjunction with our metrics. We hope this talk is of use to those who've put off working on search relevance due to fear, uncertainty, or ambivalence. We will talk about how we went from working on everything but search relevance to finally pulling back the curtain on the search system. We hope what we've learned can help others get started.

Data & Analytics

How The New York Times
Tackles Relevance
Jeremiah Via
or how to find "bruce lambert hot
dogs"

Background
• Surface all Times content
• ~18 million assets
• Powers a lot of systems at The Times

Background
Ingest API
Elasticsearch
Data Processing
Mappings
Query Building

$Query String Query { "query_string" : { "query" : "french toast", "fields": ["headline", "body", "byline"] "operator": "AND", "minimum_should_match": "75%" } }$

Decay Function
Now -100d
publication_date

The Final Straw
(headline:bruce OR body:bruce OR byline:bruce)
AND
(headline:lambert OR body:lambert OR byline:lambert)
AND
(headline:hot OR body:hot OR byline:hot)
AND
(headline:dogs OR body:dogs OR byline:dogs)

The Final Straw
Museum and Gallery Listings
An autumnal landscape called "Straw Dogs" exudes a stirring
romance, part Sam Peckinpah, part Thomas Hardy.
The lines dividing art, music and film were blurry enough to allow
Laurie Anderson, Bruce Nauman and Yoko Ono, among others, to shi
from object making to performance and back again.
Yvon Lambert, 550 West 21st Street, Chelsea.
The work is tightly installed, text-intensive and hot with
information.

Document Scoresuseconomy
The March Job Numbers Tell Us the Economy Is (Still) Doing Fin
What Booming Markets Are Telling Us About the Global Econom
The Terrible, Wonderful, Inscrutable Economy
36.2
32.7
31.8

Search Architecture
Ingest API
Elasticsearch

Search Corpora
1851

-

1859
1860

-

1865
1866

-

1959
1981

-

2004
2006

-

2019
AbstractXML
Full Text XML
1960

-

1980
2004

-

2006
Web Archive
CMS 
JSON
Civil War XML
Abstract XML
60s-70s  
XML

Danny O'Leary
Danny O'Connor
Danny O'Brien
Patronymic Last Names

Noun Phrases
bret stephens first amendment

Noun Phrases
first amendment
1st_amendment

Offline Metrics
Apple Loses $900,000 To Fake iPhone Swaps
appleiphone
2019-04-06
It’s Your iPhone. Why Can’t You Fix It Yourself?
2019-04-06
Photo of iPhone is a fake, but buyers seem real
2006-09-12
An Apple Pie That Lasts for Days
2017-10-20
5
5
2
1

OCR
A rEw I.ITEnAttYV181TOR: Zi'elteartllatbir. $gRT , the well- , is to make a
tour in this . Mr. Smith, .has been eminently successful also as a
lecturer; .treat us to descriptions of his recent travels in ~'. In England orer.
ing houses."

22 millionunique tokens
The Elasticsearch index contained

Mapping Changes
The New York Times Index
https://www.flickr.com/photos/jichikawa

The New York Times Index
{
"subjects": [{
"uri": "nyt://subject/f12ea1c9-22f9-5034-9426-efd8039a80e1",
"displayName": "Animal Abuse, Rights and Welfare",
"vernacular": "Animal Abuse"
}],
"organizations": [{
"uri": "nyt://organization/84eb681b-64ef-5457-a600-b0679b8f9e87",
"displayName": "Beyond Meat Inc",
"vernacular": "Beyond Meat"
}],
"persons": [{
"uri": "nyt://person/c6755685-5568-56ba-b3da-2eca4bbe68a0",
"displayName": "Friedrich, Bruce (1969- )",
"vernacular": "Bruce Friedrich"
}]
}

So much tagging
1.4m
Persons
72K
Locations
207K
Creative Works
148K
Subjects

Summary
• Understand search: You have to build a deep understanding of how search works and what all
these systems are doing when you issue a query.
• Make it possible to iterate: Improving search is about making lots of little improvements. You want
to remove as much friction in this process as possible and get the infrastructure out of your way.
• Know where you're going: You have to know whether your changes will improve things. There is
where offline metrics like precision, NDCG, and ERR can help.
• Learn about your users: Know how your users are using search. Without this, you can never really
know what to focus on.
• Leverage your company: You have colleagues with deep domain expertise. Engage them so you
don't have to reinvent everything.

Similar to 2019 Haystack - How The New York Times Tackles Relevance - Jeremiah Via

Need 4 speed

alikonweb

Event stream processing using Kafka streams

Fredrik Vraalsen

YQL: Select * from Internet

drgath

YQL:: Select * from Internet

drgath

Making sense out of things on the web

Pradeep Varadaraja Banavara

Crawling and Scraping tutorial at the Digital Methods Summer School 2013

Digital Methods Initiative

Big data

Mohammad Reza Gerami

Linked open data sandwich

Thimo Thoeye

OLAP Cube is about pre-aggregations, it reduces the query latency by spending more time and resources on data preparation. But for real-time analytics, data preparation and visibility latency are critical. What happens when OLAP cube meets real-time use cases? Can we pre-build the cubes in real-time with a quick and more cost effective way? This is hard but still doable. In eBay，we built our own real-time OLAP solution based on Apache Kylin & Apache Kafka. We read unbounded events from Kafka cluster then divide the streaming data into 3 stages, In-Memory Stage (Continuously In-Memory Aggregations) , On Disk Stage (Flush to disk, columnar based storage and indexes) and Full Cubing Stage (with MR or Spark, save to HBase). Data are aggregated to different layers in different stage, but all query able. Data will be transformed from 1 stage to another stage automatically and transparent to user. This solution is built to support quite a few realtime analytics use cases in eBay, we will share some use cases like site speed monitoring and eBay site deal performance in this session as well. Speaker: Qiaoneng Qian, Senior Product Manager, eBay

When OLAP Meets Real-Time, What Happens in eBay?

DataWorks Summit

Future of Engineering and NFMT

Transcendent

Similar to 2019 Haystack - How The New York Times Tackles Relevance - Jeremiah Via (10)

Need 4 speed

Event stream processing using Kafka streams

YQL: Select * from Internet

YQL:: Select * from Internet

Making sense out of things on the web

Crawling and Scraping tutorial at the Digital Methods Summer School 2013

Big data

Linked open data sandwich

When OLAP Meets Real-Time, What Happens in eBay?

Future of Engineering and NFMT

More from OpenSource Connections

Encores

OpenSource Connections

Test driven relevancy

OpenSource Connections

Smarter search drives value to your business. Delivering search that matches users to the right content is what you care about. But organizations often get stuck getting there. It turns out that you need quite a number of very different ingredients to deliver tremendous search. It can make your head spin! To help you think through where your team is on its road to smarter search, Pugh introduces the maturity model used by OpenSource Connections and walks you through a very concrete method to inventory needed skills and translate that into search roles for your team. He shows how to measure your capabilities in key areas of search to drive better ROI from search.

How To Structure Your Search Team for Success

OpenSource Connections

The right path to making search relevant - Taxonomy Bootcamp London 2019

OpenSource Connections

Payloads and OCR with Solr

OpenSource Connections

Haystack 2019 Lightning Talk - The Future of Quepid - Charlie Hull

OpenSource Connections

Haystack 2019 Lightning Talk - State of Apache Tika - Tim Allison

OpenSource Connections

Haystack 2019 Lightning Talk - Relevance on 17 million full text documents - ...

OpenSource Connections

Haystack 2019 Lightning Talk - Solr Cloud on Kubernetes - Manoj Bharadwaj

OpenSource Connections

Haystack 2019 Lightning Talk - Quaerite a Search relevance evaluation toolkit...

OpenSource Connections

Over the past year, the POLITICO team has developed a recommendation system for our users, which recommends not only news content to read but also news topics to subscribe to. This talk will discuss our development path, including dead-ends and performance trade-offs. In the end, the team produced a system based on search technology (in our case, Elasticsearch) and refined by machine learning techniques to achieve a balance between personalization and serendipity.

Haystack 2019 - Search-based recommendations at Politico - Ryan Kohl

OpenSource Connections

With the advent of deep learning and algorithms like word2vec and doc2vec, vectors-based representations are increasingly being used in search to represent anything from documents to images and products. However, search engines work with documents made of tokens, and not vectors, and are typically not designed for fast vector matching out of the box. In this talk, I will give an overview of how vectors can be derived from documents to produce a semantic representation of a document that can be used to implement semantic / conceptual search without hurting performance. I will then describe a few different techniques for efficiently searching vector-based representations in an inverted index, including LSH, vector quantization and k-means tree, and compare their performance in terms of speed and relevancy. Finally, I will describe how each technique can be implemented efficiently in a lucene-based search engine such as Solr or Elastic Search.

Haystack 2019 - Search with Vectors - Simon Hughes

OpenSource Connections

To optimally interpret most natural language queries, it is necessary to understand the phrases, entities, commands, and relationships represented or implied within the search. Knowledge graphs serve as useful instantiations of ontologies which can help represent this kind of knowledge within a domain. In this talk, we'll walk through techniques to build knowledge graphs automatically from your own domain-specific content, how you can update and edit the nodes and relationships, and how you can seamlessly integrate them into your search solution for enhanced query interpretation and semantic search. We'll have some fun with some of the more search-centric use cased of knowledge graphs, such as entity extraction, query expansion, disambiguation, and pattern identification within our queries: for example, transforming the query "bbq near haystack" into { filter:["doc_type":"restaurant"], "query": { "boost": { "b": "recip(geodist(38.034780,-78.486790),1,1000,1000)", "query": "bbq OR barbeque OR barbecue" } } } We'll also specifically cover use of the Semantic Knowledge Graph, a particularly interesting knowledge graph implementation available within Apache Solr that can be auto-generated from your own domain-specific content and which provides highly-nuanced, contextual interpretation of all of the terms, phrases and entities within your domain. We'll see a live demo with real world data demonstrating how you can build and apply your own knowledge graphs to power much more relevant query understanding within your search engine.

Haystack 2019 - Natural Language Search with Knowledge Graphs - Trey Grainger

OpenSource Connections

For e-commerce applications, matching users with the items they want is the name of the game. If they can't find what they want then how can they buy anything?! Typically this functionality is provided through search and browse experience. Search allows users to type in text and match against the text of the items in the inventory. Browse allows users to select filters and slice-and-dice the inventory down to the subset they are interested in. But with the shift toward mobile devices, no one wants to type anymore - thus browse is becoming dominant in the e-commerce experience. But there's a problem! What if your inventory is not categorized? Perhaps your inventory is user generated or generated by external providers who don't tag and categorize the inventory. No categories and no tags means no browse experience and missed sales. You could hire an army of taxonomists and curators to tag items - but training and curation will be expensive. You can demand that your providers tag their items and adhere to your taxonomy - but providers will buck this new requirement unless they see obvious and immediate benefit. Worse, providers might use tags to game the system - artificially placing themselves in the wrong category to drive more sales. Worst of all, creating the right taxonomy is hard. You have to structure a taxonomy to realistically represent how your customers think about the inventory. Eventbrite is investigating a tantalizing alternative: using a combination of customer interactions and machine learning to automatically tag and categorize our inventory. As customers interact with our platform - as they search for events and click on and purchase events that interest them - we implicitly gather information about how our users think about our inventory. Search text effectively acts like a tag and a click on an event card is a vote for that clicked event is representative of that tag. We are able to use this stream of information as training data for a machine learning classification model; and as we receive new inventory, we can automatically tag it with the text that customers will likely use when searching for it. This makes it possible to better understand our inventory, our supply and demand, and most importantly this allows us to build the browse experience that customers demand. In this talk I will explain in depth the problem space and Eventbrite's approach in solving the problem. I will describe how we gathered training data from our search and click logs, and how we built and refined the model. I will present the output of the model and discuss both the positive results of our work as well as the work left to be done. Those attending this talk will leave with some new ideas to take back to their own business.

Haystack 2019 - Search Logs + Machine Learning = Auto-Tagging Inventory - Joh...

OpenSource Connections

Recently Elasticsearch has introduced a number of ways to improve search relevance of your documents based on numeric features. In this talk I will present the newly introduced field types of "rank_feature", "rank_features" ,"dense_field", and "sparse_vector" and discuss in what situations and how they can be used to boost scores of your documents. I will also talk about the inner workings of queries based on these fields, and related performance considerations.

Haystack 2019 - Improving Search Relevance with Numeric Features in Elasticse...

OpenSource Connections

With an increasing amount of relevancy factors, relevancy fine-tuning becomes more complex as changing the impact of factors produces increasingly more unintended side effects. In recent years, there has been a lot of discussion about how learning algorithms can replace manual relevancy fine-tuning in order to manage this complexity. However, discussions about the challenge of relevancy should additionally consider architectural aspects. Especially microservice-based architectures provide many ways to encapsulate and to separate complexities of search solutions, which facilitates optimizing the search as well as locating and fixing problems. Generally, relevancy factors can be assigned to three different groups, each handled at a different stage of the search request processing. The first group contains contextual factors that depend on certain characteristics of a query, such as query-related boosts lifting up top-sellers for queries or category-related boosts to distinguish products from their accessories. Such contextual factors can be handled as a step of the preprocessing of queries. The respective boosting information can simply be appended to the query before it is actually sent to the search engine. Ideally, the normalization of the query is done beforehand. The second group contains factors that are considered for all queries in more or less the same way, e. g. a ranking function basing on keyword occurrences, product topicality or sales in total. Factors related to this group can be handled directly by configuring the search engine. The third group contains situational factors. For instance, a certain product might be a good match for a certain query in general, but for situational circumstances it should not appear among the top five products (e. g. because it is out of stock). Such situational factors can be handled by resorting result sets, after they were returned by the search engine. The handling of the different factors within successive stages of search request processing will be discussed from an architectural perspective. Implications for applying learning algorithms and the implementation of a personalized search will be considered.

Haystack 2019 - Architectural considerations on search relevancy in the conte...

OpenSource Connections

Does your search application include a custom query syntax with various search operators such as Booleans, proximity, term or phrase frequency, capitalization, quoted text or as-is operator, and other advanced operators? Although most search applications offer a natural language-oriented search box, some advanced applications may also offer a custom query syntax for advanced users or automated tasks. The Lucene "classic" query operators that are supported by the Solr edismax query parser (Boolean, phrase with slop, wildcard, etc.) cover a good amount of use cases, but they only get you so far. In this talk, we will explore various strategies to support a custom and advanced query syntax in Solr, covering a spectrum of options from leveraging the out-of-the-box Solr query DSL, to a custom Solr query parser, and hybrid solutions in between. We will identify the options' pros and cons, discuss relevancy considerations, and illustrate the options in Java.

Haystack 2019 - Custom Solr Query Parser Design Option, and Pros & Cons - Ber...

OpenSource Connections

For a relevance engineer one of the most difficult tasks in the tuning process is to convince others in the organization that this is a joint effort. Even the brightest search guru doesn't get very far when working in isolation, so establishing cross-collaboration through the organization is essential. But how to get there? On top of that, in a large organization a relevance engineer often works on multiple seemingly unrelated search projects. The challenge is not to get drowned in building custom solutions for each project, but to design generic and re-usable strategies which solve many problems at once. In this session we'll discuss how to build a widely supported basis for search quality improvements in an organization. It is full of practical tips and examples which could help you in establishing a cross-functional culture that is optimal for relevance tuning. It also zooms in on an holistic approach of solving multiple equivalent search issues at once.

Haystack 2019 - Establishing a relevance focused culture in a large organizat...

OpenSource Connections

Haystack 2019 - Solving for Satisfaction: Introduction to Click Models - Eliz...

OpenSource Connections

Evaluation of search quality is essential for developing effective rankers. Interleaved comparison methods achieve statistical significance with less data than with traditional A/B testing, meaning tests can be run in shorter timeframes and more sensitive changes to the ranker can be evaluated. In interleaved ranking two result lists are combined in a "fair" manner, such that clicks can be interpreted as unbiased judgments about the relative quality of the two rankers. In this talk we will dive into why interleaving can be a superior online evaluation method, along with how it could be added to your own evaluation toolset.

Haystack 2019 - Addressing variance in AB tests: Interleaved evaluation of ra...

OpenSource Connections

More from OpenSource Connections (20)