Home/ Questions/Q 6655225
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-26T01:29:26+00:00

I’m trying to write an algorithm (which I’m assuming will rely on natural language

  • 0

I’m trying to write an algorithm (which I’m assuming will rely on natural language processing techniques) to ‘fill out’ a list of search terms. There is probably a name for this kind of thing which I’m unaware of. What is this kind of problem called, and what kind of algorithm will give me the following behavior?

Input:

    docs = [
    "I bought a ticket to the Dolphin Watching cruise",
    "I enjoyed the Dolphin Watching tour",
    "The Miami Dolphins lost again!",
    "It was good going to that Miami Dolphins game"
    ], 
    search_term = "Dolphin"

Output:

["Dolphin Watching", "Miami Dolphins"]

It should basically figure out that if “Dolphin” appears at all, it’s virtually always either in the bigrams “Dolphin Watching” or “Miami Dolphins”. Solutions in Python preferred.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    It should basically figure out that if “Dolphin” appears at all, it’s virtually always either in the bigrams “Dolphin Watching” or “Miami Dolphins”.

    Sounds like you want to determine the collocations that Dolphin occurs in. There are various methods for collocation finding, the most popular being to compute point-wise mutual information (PMI) between terms in your corpus, then select the terms with the highest PMI for Dolphin. You might remember PMI from the sentiment analysis algorithm that I suggested earlier.

    A Python implementation of various collocation finding methods is included in NLTK as nltk.collocations. The area is covered in some depth in Manning and Schütze’s FSNLP (1999, but still current for this topic).

    • 0