Skip to content
The AI Automators
  • Community & Courses
  • Contact
  • Login
  • YouTube

The Problem with Using the Perplexity API when Scraping URLs

December 16, 2024 by Alan Walsh

Using Perplexity AI for article summarization of direct URLs can lead to unreliable results, especially when dealing with non-indexed or non-existent URLs. By implementing a more robust solution using a web scraper and GPT4o, we can create accurate and dependable article summaries.

This alternative approach not only provides more reliable results but also offers greater flexibility in how we process and handle article content through web scraping techniques.

In my recent video, I demonstrate how to create a better article summarization system:

The Problem with Perplexity AI

When testing Perplexity AI with non-existent URLs, I discovered it tends to hallucinate fictitious content rather than returning an error. This can be particularly problematic when dealing with newly published content that hasn’t been indexed by search engines yet, as Perplexity seems to rely on search engine data rather than direct website access.

A Better Solution Using Make.com

Direct Web Scraping

Using Make.com’s HTTP module, we can directly scrape article content from websites. This approach provides several advantages:

  • Immediate access to content regardless of search engine indexing
  • Reliable error handling for non-existent URLs
  • Prevention of false content generation

Integration with OpenAI

After scraping the content, we can use OpenAI’s chat module to generate accurate summaries of the articles. The process involves passing the scraped content to OpenAI with specific instructions to summarize the article and highlight its most important points.

Advanced Scraping Options

For even better results, services like ScrapingBee or Scrapio can be integrated with Make.com to provide cleaner data extraction. These services offer more refined content scraping compared to the basic HTTP module, potentially reducing costs and processing time due to more efficient data handling.

The automation templates demonstrated in this solution are available through The AI Automators, providing you with ready-to-use workflows for implementing this more reliable summarization system.

Categories Make.com

Keep reading

NEW Make.com MCP Update: Connect Anything in Minutes! (No-Code)

May 11, 2025 by Alan Walsh

In my latest exploration of Make.com, I focused on its exciting new feature, the Model Context Protocol (MCP). This enables users to connect external agents, such as Claude Desktop, directly to their Make.com accounts. The beauty of this feature lies in its ability to let these agents discover, understand, and execute scenarios without requiring complex … Read more

Categories Make.com

How to Bulk Add Rows to Google Sheets with Make.com

April 30, 2025 by Alan Walsh

In this guide, I’ll show you how to efficiently bulk add rows to Google Sheets using Make.com. This method not only streamlines your workflow but also saves on operations, making it a smart choice for handling large datasets. Introduction to Bulk Adding Rows Bulk adding rows in Google Sheets can transform your data management. Instead … Read more

Categories Make.com

Understanding Bundles, Arrays & Collections in Make.com

April 28, 2025 by Alan Walsh

In this blog, I’m diving into the essential data structures of Make.com: bundles, arrays, and collections. These concepts are crucial for creating more sophisticated automation scenarios, and I aim to make them practical and easy to understand. Overview of Data Structures Understanding data structures is fundamental in automation. Within Make.com, bundles, collections, and arrays serve … Read more

Categories Make.com
Community Contact BLOG member login

© 2026 - The AI Automators® is a registered business name of LogicLabs Digital Limited | Privacy Policy

Not ready to join yet? You can still stay up to date!

Subscribe to our newsletter to get actionable guides, tips, and the latest AI news by email.

    We won't send you spam. Unsubscribe at any time.