NLP (five) speech tagging and grammar

• Built-speech tagger NLTK
  function speech tagging using nltk.pos_tag ()

import nltk
nltk.download('averaged_perceptron_tagger')

simpleSentence = 'Bangalore is the capital of Karnataka.'

# 分词
wordsInSentence = nltk.word_tokenize(simpleSentence)
print(wordsInSentence)

# 词性标注
partsOfSpeechTags = nltk.pos_tag(wordsInSentence)
print(partsOfSpeechTags)

Output:

['Bangalore', 'is', 'the', 'capital', 'of', 'Karnataka', '.']
[('Bangalore', 'NNP'), ('is', 'VBZ'), ('the', 'DT'), ('capital', 'NN'), ('of', 'IN'), ('Karnataka', 'NNP'), ('.', '.')]

• His speech tagger

import nltk

# 默认：不认识的都标成NN
def learnDefaultTagger(simpleSentence):
    wordsInSentence = nltk.word_tokenize(simpleSentence)
    tagger = nltk.DefaultTagger('NN')
    posEnabledTags = tagger.tag(wordsInSentence)
    print(posEnabledTags)

# 正则表达式标注
def learnRETagger(simpleSentence):
    # 元组列表，r不能省哦
    customPatterns =[
        (r'.*ing$','ADJECTIVE'),
        (r'.*ly$','ADVERB'),
        (r'.*ion$','NOUN'),
        (r'(.*ate|.*en|is)$','VERB'),
        (r'^an$','INDEFINITE-ARTICLE'),
        (r'^(with|on|at)$','PREPOSITION'),
        (r'^[0-9]*$','NUMBER'),
        (r'.*$',None),
    ]
    tagger = nltk.RegexpTagger(customPatterns)
    wordsInSentencs = nltk.word_tokenize(simpleSentence)
    posEnabledTags =tagger.tag(wordsInSentencs)
    print(posEnabledTags)

# 字典标注
def learnLookupTagger(simpleSentence):
    mapping = {
        '.':'.','place':'NN','on':'IN','earth':'NN','Mysore':'NNP',
        'is':'VBZ','an':'DT','amazing':'JJ',
    }
    tagger = nltk.UnigramTagger(model=mapping)
    wordsInSentencs = nltk.word_tokenize(simpleSentence)
    posEnabledTags = tagger.tag(wordsInSentencs)
    print(posEnabledTags)

if __name__ == "__main__":
    testSentence = 'Mysore is an amazing place on earth. I have visited Mysore 10 times.'
    learnDefaultTagger(testSentence)
    learnRETagger(testSentence)
    learnLookupTagger(testSentence)

Output:

[('Mysore', 'NN'), ('is', 'NN'), ('an', 'NN'), ('amazing', 'NN'), ('place', 'NN'), ('on', 'NN'), ('earth', 'NN'), ('.', 'NN'), ('I', 'NN'), ('have', 'NN'), ('visited', 'NN'), ('Mysore', 'NN'), ('10', 'NN'), ('times', 'NN'), ('.', 'NN')]
[('Mysore', None), ('is', 'VERB'), ('an', 'INDEFINITE-ARTICLE'), ('amazing', 'ADJECTIVE'), ('place', None), ('on', 'PREPOSITION'), ('earth', None), ('.', None), ('I', None), ('have', None), ('visited', None), ('Mysore', None), ('10', 'NUMBER'), ('times', None), ('.', None)]
[('Mysore', 'NNP'), ('is', 'VBZ'), ('an', 'DT'), ('amazing', 'JJ'), ('place', 'NN'), ('on', 'IN'), ('earth', 'NN'), ('.', '.'), ('I', None), ('have', None), ('visited', None), ('Mysore', 'NNP'), ('10', None), ('times', None), ('.', '.')]

• Train yourself part of speech tagger

import nltk
import pickle

# 训练集
def sampleData():
    return [
        'Bangalore is the capital of Karnataka.',
        'Steve Jobs was the CEO of Apple.',
        'iPhone was Invented by Apple.',
        'Books can be purchased in Market.',
    ]

# 逐句分词，得到词性，将训练集的词和词性放到字典里
def buildDictionary():
    dictionary = {}
    for sent in sampleData():
        partsOfSpeechTags = nltk.pos_tag(nltk.word_tokenize(sent))
        for tag in partsOfSpeechTags:
            value = tag[0]
            pos = tag[1]
            dictionary[value] = pos
    return dictionary

def saveMyTagger(tagger,fileName):
    fileHandle = open(fileName,'wb')
    pickle.dump(tagger,fileHandle) # 写入二进制
    fileHandle.close()

# 用学习的字典得到tagger
def saveMyTraining(fileName):
    tagger = nltk.UnigramTagger(model=buildDictionary())
    saveMyTagger(tagger,fileName)

# 读取自己的模型
def loadMyTagger(fileName):
    return pickle.load(open(fileName,'rb'))

sentence = 'IPhone is purchased by Steve Jobs in Bangalore Market.'
fileName = 'myTagger.pickle'

saveMyTraining(fileName)

myTagger = loadMyTagger(fileName)

print(myTagger.tag(nltk.word_tokenize(sentence)))

Output:

[('IPhone', None), ('is', 'VBZ'), ('purchased', 'VBN'), ('by', 'IN'), ('Steve', 'NNP'), ('Jobs', 'NNP'), ('in', 'IN'), ('Bangalore', 'NNP'), ('Market', 'NNP'), ('.', '.')]

• Write their own grammar
  context-free grammar:
  1. Start symbol / mark
  2. End symbol set
  3. nonterminal set
  4. The starting symbol definitions and rules (production)
  5. language is English, az is the symbols / numerals / letters
  6. when the language is a digital, symbol 0-9 / numerals / letters
  production is Bacchus - Naur ( the BNF write) Paradigm

import nltk
import string
from nltk.parse.generate import generate
import sys

# 定义一个起始符号为ROOT的文法
productions = [
    'ROOT -> WORD',
    'WORD -> \' \'',
    'WORD -> NUMBER LETTER',
    'WORD -> LETTER NUMBER',
]

# 添加新的生成方式 'NUMBER -> 0|1|2|3'
digits = list(string.digits) # str格式的数字
for digit in digits[:4]:
    productions.append('NUMBER -> \'{w}\''.format(w=digit))

# 添加新的生成方式 'LETTER -> a|b|c|d'
letters ="' | '".join(list(string.ascii_lowercase)[:4])
productions.append('LETTER -> \'{w}\''.format(w=letters))

# 将文法分行存于grammarString
grammarString = '\n'.join(productions)

# 创建文法对象，并查看之
grammar = nltk.CFG.fromstring(grammarString)
print(grammar)

# 读取语法树 最多个数：5 最多层数：4
for sentence in generate(grammar,n=5,depth=4):
    palindrome = ''.join(sentence).replace(' ','')
    print('Generated Word: {} , Size : {}'.format(palindrome,len(palindrome)))

• Export

Grammar with 12 productions (start state = ROOT)
    ROOT -> WORD
    WORD -> ' '
    WORD -> NUMBER LETTER
    WORD -> LETTER NUMBER
    NUMBER -> '0'
    NUMBER -> '1'
    NUMBER -> '2'
    NUMBER -> '3'
    LETTER -> 'a'
    LETTER -> 'b'
    LETTER -> 'c'
    LETTER -> 'd'
Generated Word:   , Size : 0
Generated Word: 0a , Size : 2
Generated Word: 0b , Size : 2
Generated Word: 0c , Size : 2
Generated Word: 0d , Size : 2

• Probabilistic context-free grammar-based
  all nonterminal (left side) is equal to a sum of the probabilities

description	content
Start Symbol	ROOT
Nonterminal	WORD,P1,P2,P3,P4
Terminal symbols	'A','B','C','D','E','F','G','H'

import nltk
from nltk.parse.generate import generate

productions = [
    "ROOT -> WORD [1.0]",
    "WORD -> P1 [0.25]",
    "WORD -> P1 P2 [0.25]",
    "WORD -> P1 P2 P3 [0.25]",
    "WORD -> P1 P2 P3 P4 [0.25]",
    "P1 -> 'A' [1.0]",
    "P2 -> 'B' [0.5]",
    "P2 -> 'C' [0.5]",
    "P3 -> 'D' [0.3]",
    "P3 -> 'E' [0.3]",
    "P3 -> 'F' [0.4]",
    "P4 -> 'G' [0.9]",
    "P4 -> 'H' [0.1]",
]
grammarString = '\n'.join(productions)

# 创建grammar对象
grammar = nltk.PCFG.fromstring(grammarString)
print(grammar)

for sentence in generate(grammar,n=5,depth=4):
    palindrome = ''.join(sentence).replace(' ','')
    print('String : {} , Size : {}'.format(palindrome,len(palindrome)))

Output:

Grammar with 13 productions (start state = ROOT)
    ROOT -> WORD [1.0]
    WORD -> P1 [0.25]
    WORD -> P1 P2 [0.25]
    WORD -> P1 P2 P3 [0.25]
    WORD -> P1 P2 P3 P4 [0.25]
    P1 -> 'A' [1.0]
    P2 -> 'B' [0.5]
    P2 -> 'C' [0.5]
    P3 -> 'D' [0.3]
    P3 -> 'E' [0.3]
    P3 -> 'F' [0.4]
    P4 -> 'G' [0.9]
    P4 -> 'H' [0.1]
String : A , Size : 1
String : AB , Size : 2
String : AC , Size : 2
String : ABD , Size : 3
String : ABE , Size : 3

• Write a recursive context-free grammar
  to recursive method to generate a palindrome, for example, palindromes: for example, 01,001,001 and other language systems

# 生成偶数回文数字
import nltk
import string
from nltk.parse.generate import generate

productions = [
    'ROOT -> WORD',
    "WORD -> ' '",
]

alphabets = list(string.digits)

for alphabet in alphabets:
    productions.append("WORD -> '{w}' WORD '{w}'".format(w=alphabet))

grammarString = '\n'.join(productions)

grammar = nltk.CFG.fromstring(grammarString)
print(grammar)

for sentence in generate(grammar,n=5,depth=5):
    palindrome = ''.join(sentence).replace(' ','')
    print('Palindrome : {} , Size : {}'.format(palindrome,len(palindrome)))

Output:

Grammar with 12 productions (start state = ROOT)
    ROOT -> WORD
    WORD -> ' '
    WORD -> '0' WORD '0'
    WORD -> '1' WORD '1'
    WORD -> '2' WORD '2'
    WORD -> '3' WORD '3'
    WORD -> '4' WORD '4'
    WORD -> '5' WORD '5'
    WORD -> '6' WORD '6'
    WORD -> '7' WORD '7'
    WORD -> '8' WORD '8'
    WORD -> '9' WORD '9'
Palindrome :  , Size : 0
Palindrome : 00 , Size : 2
Palindrome : 0000 , Size : 4
Palindrome : 0110 , Size : 4
Palindrome : 0220 , Size : 4