使用Python获取词频中排名第二的词汇

f('Both of these issues are fixed by postponing the evaluation of annotations. Instead of compiling code which executes expressions in annotations at their definition time, the compiler stores the annotation in a string form equivalent to the AST of the expression in question. If needed, annotations can be resolved at runtime using typing.get_type_hints(). In the common case where this is not required, the annotations are cheaper to store (since short strings are interned by the interpreter) and make startup time faster.')

from collections import Counter

c = Counter('lost lost an apple apple '.split())

c.most_common(2).pop()[0]

from collections import Counter
ss = 'Both of these issues are fixed by postponing the evaluation of annotations. Instead of compiling code which executes expressions in annotations at their definition time, the compiler stores the annotation in a string form equivalent to the AST of the expression in question. If needed, annotations can be resolved at runtime using typing.get_type_hints(). In the common case where this is not required, the annotations are cheaper to store (since short strings are interned by the interpreter) and make startup time faster.'
data = Counter(ss.split())
print(data)
result = data.most_common(2)[1][0]
print(result)

def f(s):
    d = {}
    for i in s.split():
        if i in d:
            d[i] += 1
        else:
            d[i] = 1
    # print(d)
    return d


result = f('Both of these issues are fixed by postponing the evaluation of annotations. Instead of compiling code which executes expressions in annotations at their definition time, the compiler stores the annotation in a string form equivalent to the AST of the expression in question. If needed, annotations can be resolved at runtime using typing.get_type_hints(). In the common case where this is not required, the annotations are cheaper to store (since short strings are interned by the interpreter) and make startup time faster.')

print(sorted(zip(result.values(), result.keys()), reverse=True)[1])
for data in sorted(zip(result.values(), result.keys()), reverse=True):
    print(data)

def f(s):
    d = {}
    for i in s.split():
        if i in d:
            d[i] += 1
        else:
            d[i] = 1

    d = {v: k for k, v in d.items()}
    print(d.items())
    d = sorted(d.items())
    print(d)
    print(d[-2])


f(
    'Both of these issues are fixed by postponing the evaluation of annotations. Instead of compiling code which executes expressions in annotations at their definition time, the compiler stores the annotation in a string form equivalent to the AST of the expression in question. If needed, annotations can be resolved at runtime using typing.get_type_hints(). In the common case where this is not required, the annotations are cheaper to store (since short strings are interned by the interpreter) and make startup time faster.')