如何用awk统计含连续元音的单词？求入门资源与解题思路

Hey there! Let’s work through this together—first I’ll share some approachable AWK resources to get you grounded, then break down exactly how to solve your homework problem so you understand every step.

易懂的AWK入门资源 #

These resources focus on practical, beginner-friendly explanations instead of dense jargon:

• GNU AWK官方入门章节: The "Getting Started with awk" and "Regular Expressions" sections are perfect for beginners. They walk through core concepts (like pattern-action pairs, fields, and variables) with simple, runnable examples—exactly what you need to tackle regex-based problems like yours.
• 精简版《The AWK Programming Language》笔记: You don’t need to read the entire classic book. Look for community-curated quick start guides that distill the book’s core idea: AWK reads text line by line, splits lines into words (fields), and runs actions when a pattern matches. These guides make the "why" behind AWK’s logic click.
• Small, guided AWK exercises: Start with basic tasks like "count total words in a file" or "print lines containing a specific word," then move to regex-focused exercises (like matching words with vowels). Many free practice sets include explanations, so you learn as you go.

作业解题思路与代码示例 #

Let’s break down your requirement: count words that have two consecutive vowels (a/e/i/o/u), then output only the total count.

Step 1: Understand AWK’s default behavior #

AWK automatically splits each line of input into "fields" (words) using whitespace (spaces/tabs) as the separator. NF is a built-in variable that tells you how many fields (words) are in the current line.

Step 2: Write the regex for consecutive vowels #

We need a regex that matches any two vowels in a row. That’s simple: /[aeiou]{2}/ (or /[aeiou][aeiou]/—both work). If you need to match uppercase vowels too (like "LOOK"), add IGNORECASE = 1 to make the regex case-insensitive.

Step 3: Build the counting logic #

• Initialize a counter variable (we’ll use count) starting at 0.
• Loop through every word (field) in each line.
• For each word, check if it matches the consecutive vowel regex. If yes, increment the counter.
• After processing all lines, print the final counter value using AWK’s END block (which runs once all input is processed).

Final Code #

# Optional: Uncomment below to make regex case-insensitive
# BEGIN { IGNORECASE = 1 }

{
    # Loop through every word in the current line
    for (i = 1; i <= NF; i++) {
        # Check if the word has two consecutive vowels
        if ($i ~ /[aeiou]{2}/) {
            count++
        }
    }
}

# Print the total count after processing all lines
END { print count }

How to test this #

Save the code to a file (like vowel_count.awk), then run it with your input file:

awk -f vowel_count.awk your_input_file.txt

For example, if your input file has:

look good mama hello test apple

The script will output 4 (since look, good, hello, apple all have consecutive vowels).

Extra tip: Handling punctuation #

If your input has words with trailing punctuation (like "look!"), add a line to clean the word first:

{
    for (i = 1; i <= NF; i++) {
        # Remove non-letter characters from the word
        cleaned_word = $i
        gsub(/[^a-zA-Z]/, "", cleaned_word)
        if (cleaned_word ~ /[aeiou]{2}/) {
            count++
        }
    }
}
END { print count }

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