Textio analyzes language patterns in writing. Given a text string and an integer k, return the k most frequent repeated phrases, where each phrase contains at least two words.
A phrase is a contiguous sequence of words within one sentence. Matching is case-insensitive, and punctuation separates sentences when it is ., !, or ?. Ignore other punctuation when identifying words. A shorter phrase is redundant when it appears inside a longer phrase with the same frequency. Do not return redundant phrases. This preserves the longest repeated wording rather than separately reporting all of its subphrases.
Return objects containing phrase and count. Sort results by decreasing frequency, then decreasing word count, then lexicographic phrase order. Return fewer than k results when fewer qualifying phrases exist.
Implement top_phrases(text, k), where text is a string and k is a positive integer. Return a list of dictionaries in the form {"phrase": string, "count": integer}. Only phrases occurring at least twice qualify.
def top_phrases(text, k):