如何用Python检测列表中含多词的元素是否存在于文本中

Hey there! I see the issue you're facing—your current list comprehension works for single words but fails to handle multi-word phrases correctly, leading to unexpected matches (like 'pepper' being picked up from 'White Pepper') and missing the exact matches you want. Let's fix this step by step.

Why Your Current Code Fails #

The line output=[word for word in words if word in text] checks if each item is a substring of the text, not an exact standalone phrase. That means:

• 'pepper' gets matched because it's part of 'White Pepper' in the text
• Shorter words that overlap with longer phrases will be incorrectly prioritized
• (Side note: The 'rice' in your result is likely a typo, since it doesn't appear in your sample text!)

Solution 1: Prioritize Longer Phrases + Avoid Re-Matching #

The simplest fix is to sort your list of words/phrases by length (longest first), then match and remove the matched content from a temporary copy of the text. This ensures longer phrases are detected first, and prevents shorter words from matching parts of already found phrases.

text = "what is the price of wheat and White Pepper?"
words = ['wheat','White Pepper','rice','pepper']

# Sort words by length (longest first) to prioritize multi-word phrases
sorted_words = sorted(words, key=lambda x: len(x), reverse=True)
matched_phrases = []
temp_text = text  # Use a temp copy to modify without altering original text

for phrase in sorted_words:
    if phrase in temp_text:
        matched_phrases.append(phrase)
        # Replace the matched phrase to prevent shorter words from matching it later
        temp_text = temp_text.replace(phrase, "")

print(matched_phrases)  # Output: ['White Pepper', 'wheat']

Solution 2: Exact Matching with Regular Expressions #

For more precise control (like ensuring phrases are matched as complete units, not substrings), use regular expressions with word boundaries. This is especially useful if you need to avoid partial matches (e.g., not matching 'pepper' in 'White Pepper').

import re

text = "what is the price of wheat and White Pepper?"
words = ['wheat','White Pepper','rice','pepper']

# Sort first to prioritize longer phrases
sorted_words = sorted(words, key=lambda x: len(x), reverse=True)
matched_phrases = []

for phrase in sorted_words:
    # Use re.escape to handle special characters in phrases
    # \b ensures we match the exact phrase as a standalone unit
    pattern = re.compile(r'\b' + re.escape(phrase) + r'\b')
    if pattern.search(text):
        matched_phrases.append(phrase)

print(matched_phrases)  # Output: ['White Pepper', 'wheat']

If you want case-insensitive matching (e.g., matching 'white pepper' even if the text has 'White Pepper'), add the re.IGNORECASE flag to the compile method:

pattern = re.compile(r'\b' + re.escape(phrase) + r'\b', re.IGNORECASE)

Key Takeaways #

• Always sort your phrases by length (longest first) when dealing with overlapping or nested matches
• Use substring checks for simple cases, but regex for precise, word-boundary matching
• Modify a temporary text copy to avoid re-matching parts of already found phrases

内容的提问来源于stack exchange，提问作者bhavi