Dependency Parsing as a Classification Problem - Linking Adjacent Words
160 likes | 263 Vues
Learn how to classify adjacent words in dependency parsing. Sample decision lists for German are provided. Achieve high accuracy in linking adjacent words through this method.
Dependency Parsing as a Classification Problem - Linking Adjacent Words
E N D
Presentation Transcript
Dependency Parsing as a Classification Problem Deniz Yuret Koç University İstanbul
Linking Adjacent Words kick the red ball ? ? ?
Linking Adjacent Words kick the red ball
Linking Adjacent Words kick the red ball ? ?
Linking Adjacent Words kick the red ball ? ? ?
Linking Adjacent Words kick the red ball
Linking Adjacent Words kick the red ball ? ? ? ?
Linking Adjacent Words kick the red ball ? ? ?
Linking Adjacent Words kick the red ball ? ?
Linking Adjacent Words kick the red ball
Sample decision list for German • If XL1:postag=APPR Then NONE • If X:postag=ART, Y:postag=NN Then L:NK • If X:postag=APPR Then R:NK • If TRUE Then NONE
Sample decision list for German • If XL1:postag=APPR Then NONE • If X:postag=ART, Y:postag=NN Then L:NK • If X:postag=APPR Then R:NK • If TRUE Then NONE APPR-ART-NN
Contributions • Learning adjacent word dependencies using decision lists and GPA. • Accuracy on adjacent word dependencies between 85%-95% for most languages. • Greedy bottom-up parsing model did not work very well.