Видео

How do you use Solr for search? Let us take a look in this short video.

This is a 5 minute game with no increment that I played on chess.com. My opponent is about a 100 points higher than me rated at 1620. The familiarity of positions that arise out of the opening helps me gain an edge on the clock and thus I win the game. Enjoy the game. The PGN is here: www.chess.com/analysis/game/live/5705260485

Knowing the openings would save you from getting into some dangerous attacking lines. My opponent is caught unaware as he pushes his pawn. My bad, I miss a mate in one but I was lucky to get a second chance. See how the colle opening helps me win this game. The PGN is here: www.chess.com/live/game/5700480276

String handling is a key part of several Information Retrieval (IR) problems. In this talk, I take the example of one data structure and explain how several problems can be elegantly, efficiently and beautifully solved with right data structures.

In this talk, let us understand the calculation behind the Retrieval Status Value (RSV), a bit better.

We know how to model documents and query as vectors using the Vector Space Model (VSM). In this lecture, we discuss another approach to look at documents and queries in a probabilistic manner. Probabilistic Retrieval has gained traction over the recent few years.

d3 is the ideal square for our colle bishop. However, in the position where black is positioning itself to attack on d3 with his knight, bishop and pawn, you should not put your bishop on d3. This video shows these lines.

Here is another game from the colle opening to demonstrate its attacking potential. The PGN is available here: www.chess.com/live/game/5659008036

The best thing about playing the Colle System over and over again is that several middle game positions become familiar to you. Here is one such middle game position that leads to a beautiful win through a double-bishop sacrifice. Enjoy this game between Koltanowski and Defosse. The PGN for this game is available at www.chessgames.com/perl/nph-chesspgn?text=1&gid=1080649.

In this game, Colle shows us how to use the Colle System. Specifically, when your opponent castles short and most of his pieces are stuck on the wrong side (away from the king), Colle System can become a beautiful weapon to destroy your opponent's castle. Here I show the game and explain parts of it. Enjoy!

Here is a short game where the queen gets trapped very early!

In this demo, I show how to write a simple analyzer (and tokenizer and filters). Disclaimer: Most of the code I show are not written by me. They are available on the internet. Music by bensound-buddy.

In a beautiful game, SoreMilitaryMamba from chesskid explains his thinking behind the way he applied the colle system. Note the powerful queen bishop battery he forms and earns a win very quickly. The PGN for this game is available here: www.chesskid.com/fastchess/game/29586919

During query time as well as index time, when we read a stream of text, we need to decide on a) how to split the stream into tokens, and b) which tokens to keep and which ones to discard or transform. The former task is done by tokenizer and the latter is the domain of filters. Tokenizers and Filters together make an analyzer. We use analyzers (such as the whitespace analyzer) in Solr. Enjoy th...

Colle System: Punishing Passive Play

Colle System: A game between two young minds

Colle System: Beating a 1900 rated opponent

Colle System: A simple opening trap

Colle System: A solid setup for beginners

The Law of Large Numbers

IR Course Lecture 6.1: Data Structures for Dictionaries

IR Course Lecture 15: Relevance Feedback

Challenges in Web Crawling

IR Course Tutorial 1: Using Lucene to Build a Simple Search System

IR Course Lecture 13: Efficient Scoring

IR Course Lecture 11: Ranking and Relevance with Vector Space Model

IR Course Lecture 14: Evaluation

IR Course Lecture 4: Evaluation

IR Course Lecture 1: Introduction to Information Retrieval