Combining Lexical and Syntactic Features for Supervised Word Sense Disambiguation

1. Combining Lexical and Syntactic Features for Supervised Word Sense Disambiguation Masters Thesis : Saif Mohammad Advisor : Dr.Ted Pedersen University of Minnesota, Duluth

2. Path Map • Introduction • Background • Data • Experiments • Conclusions

3. Word Sense Disambiguation Harry cast a bewitching spell • Humans immediately understand spellto mean a charmor incantation. • readingout letter by letter or a period of time ? • Words with multiple senses – polysemy, ambiguity! • Utilize background knowledge and context. • Machines lack background knowledge. • Automatically identifying the intended sense of a word in written text, based on its context, remains a hard problem. • Best accuracies in recent international event, around 65%.

4. Why do we need WSD ! • Information Retrieval • Query: cricket bat • Documents pertaining to the insect and the mammal, irrelevant. • Machine Translation • Consider English to Hindi translation. • head to sar (upper part of the body) or adhyaksh (leader)? • Machine-human interaction • Instructions to machines. • Interactive home system: turn on the lights • Domestic Android: get the door Applications are widespread and will affect our way of life.

5. Terminology Harry cast a bewitching spell • Target word – the word whose intended sense is to be identified. • spell • Context – the sentence housing the target word and possibly, 1 or 2 sentences around it. • Harry cast a bewitching spell • Instance – target word along with its context. WSD is a classification problem wherein the occurrence of the target word is assigned to one of its many possible senses.

6. Corpus-Based Supervised Machine Learning A computer program is said to learn from experience … if its performance at tasks … improves with experience. - Mitchell • Task : Word Sense Disambiguation of given test instances. • Performance : Ratio of instances correctly disambiguated to the total test instances – accuracy. • Experience : Manually created instances such that target words are marked with intended sense – training instances. Harry cast a bewitching spell / incantation

7. Path Map • Introduction • Background • Data • Experiments • Conclusions

8. Decision Trees • A kind of classifier. • Assigns a class by asking a series of questions. • Questions correspond to features of the instance. • Question asked depends on answer to previous question. • Inverted tree structure. • Interconnected nodes. • Top most node is called the root. • Each node corresponds to a question / feature. • Each possible value of feature has corresponding branch. • Leaves terminate every path from root. • Each leaf is associated with a class.

9. Automating Toy Selection for Max Moving Parts ? ROOT NODES Yes No Car ? Color ? No Yes Blue Other Red Size ? HATE Car ? LOVE HATE Small Big No Yes SO SO LOVE SO SO Size ? Small Big LEAVES HATE LOVE

10. WSD Tree Feature 1 ? 1 0 Feature 2 ? Feature 4? 0 1 0 1 Feature 4 ? SENSE 3 Feature 2 ? SENSE 1 0 1 0 1 SENSE 1 SENSE 4 SENSE 3 Feature 3 ? 0 1 SENSE 2 SENSE 3

11. Choice of Learning Algorithm • Why use decision trees for WSD ? • It has drawbacks –training data fragmentation • What about other learning algorithms such as neural networks? • Context is a rich source of discrete features. • The learned model likely meaningful. • May provide insight into the interaction of features. Pedersen[2001]*: Choosing the right features is of greater significance than the learning algorithm itself * “A Decision Tree of Bigrams is an Accurate Predictor of Word Sense”, T. Pedersen, In the Proceedings of the Second Meeting of the North American Chapter of the Association for Computational Linguistics (NAACL-01), June 2-7, 2001, Pittsburgh, PA.

12. Lexical Features • Surface form • A word we observe in text. • Case(n) • 1. Object of investigation 2. frame or covering 3. A weird person • Surface forms : case, cases, casing • An occurrence of casing suggests sense 2. • Unigrams and Bigrams • One word and two word sequences in text. The interest rate is low • Unigrams: the, interest, rate, is, low • Bigrams: the interest, interest rate, rate is, is low

13. Part of Speech Tagging • Pre-requisite for many natural language tasks. • Parsing, WSD, Anaphora resolution • Brill Tagger* – most widely used tool. • Accuracy around 95%. • Source code available. • Easily understood rules. Harry/NNP cast/VBD a/DT bewitching/JJspell/NN NNP proper noun, VBD verb past, DT determiner, NN noun * http://www.cs.jhu.edu/~brill/RBT1_14.tar.Z

14. Pre-Tagging • Pre-tagging is the act of manually assigning tags to selected words in a text prior to tagging. Mona will sit in the pretty chair//NN this time • chair is the pre-tagged word, NN is its pre-tag. • Reliable anchors or seeds around which tagging is done. • Brill Tagger facilitates pre-tagging. • Pre-tag not always respected! Mona/NNP will/MD sit/VB in/IN the/DT pretty/RB chair//VB this/DT time/NN

15. Contextual Rules • Initial state tagger – assigns most frequent tag for a type based on entries in a Lexicon (pre-tag respected). • Final state tagger – may modify tag of word based on context (pre-tag not given special treatment). Relevant Lexicon Entries Type Most frequent tag Other possible tags chairNN(noun)VB(verb) prettyRB(adverb)JJ(adjective) Relevant Contextual Rules Current Tag New Tag When NN VB NEXTTAG DT RB JJ NEXTTAG NN

16. Guaranteed Pre-Tagging • A patch to the tagger provided – BrillPatch. • Application of contextual rules to the pre-tagged words bypassed. • Application of contextual rules to non pre-tagged words unchanged. Mona/NNP will/MD sit/VB in/IN the/DT pretty/JJ chair//NN this/DT time/NN • Tag of chairretained asNN. • Contextual rule to change tag of chair from NN to VB not applied. • Tag of pretty transformed. • Contextual rule to change tag of pretty from RB to JJ applied. * ”Guaranteed Pre-Tagging for the Brill Tagger”, Mohammad, S. and Pedersen, T., In Proceedings of Fourth International Conference of Intelligent Systems and Text Processing, February 2003, Mexico.

17. Part of Speech Features • A word used in different senses is likely to have different sets of pos tags around it. Why did jack turn/VB against/IN his/PRP$ team/NN Why did jack turn/VB left/NN at/IN the/DT crossing • Features used • Individual word POS: P-2, P-1, P0, P1, P2 • P1 = JJ implies that the word to the right of the target word is an adjective. • A combination of the above.

18. Parse Features • Collins Parser* used to parse the data. • Source code available. • Uses part of speech tagged data as input. • Head word of a phrase. • the hardwork, the hard surface • Phrase itself : noun phrase, verb phrase and so on. • Parent : Head word of the parent phrase. • fasten the line, cross the line • Parent phrase. * http://www.ai.mit.edu/people/mcollins

19. Sample Parse Tree SENTENCE NOUN PHRASE VERB PHRASE Harry cast NOUN PHRASE NNP VBD bewitching spell a NN JJ DT

20. Path Map • Introduction • Background • Data • Experiments • Conclusions

21. Sense-Tagged Data • Senseval-2 data • 4328 instances of test data and 8611 instances of training data ranging over 73 different noun, verb and adjectives. • Senseval-1 data • 8512 test instances and 13,276 training instances, ranging over 35 nouns, verbs and adjectives. • line, hard, interest, serve data • 4,149, 4,337, 4378 and 2476 sense-tagged instances with line, hard, serve and interest as the head words. Around 50,000 sense-tagged instances in all!

22. Data Processing • Packages to convert line hard, serve and interest data to Senseval-1 and Senseval-2 data formats. • refine preprocesses data in Senseval-2 data format to make it suitable for tagging. • Restore one sentence per line and one line per sentence, pre-tag the target words, split long sentences. • posSenseval part of speech tags any data in Senseval-2 data format. • Brill tagger along with Guaranteed Pre-tagging utilized. • parseSenseval parses data in a format as output by the Brill Tagger. • Restores xml tags, creating a parsed file in Senseval-2 data format. • Uses the Collins Parser.

23. Sample line data instance Original instance: art} aphb 01301041: " There's none there . " He hurried outside to see if there were any dry ones on the line . Senseval-2 data format: <instance id="line-n.art} aphb 01301041:"> <answer instance="line-n.art} aphb 01301041:" senseid="cord"/> <context> <s> " There's none there . " </s> <s> He hurried outside to seeif there were any dry ones on the <head>line</head> . </s> </context> </instance>

24. Sample Output from parseSenseval <instance id=“harry"> <answer instance=“harry" senseid=“incantation"/> <context> Harry cast a bewitching <head>spell</head> </context> </instance> <instance id=“harry"> <answer instance=“harry" senseid=“incantation"/> <context> <P=“TOP~cast~1~1”> <P=“S~cast~2~2”> <P=“NPB~Potter~2~2”> Harry <p=“NNP”/> <P=“VP~cast~2~1”> cast <p=“VB”/> <P=“NPB~spell~3~3”> a <p=“DT”/> bewitching <p=“JJ”/> spell <p=“NN”/> </P> </P> </P> </P> </context> </instance>

25. Issues… • How is the target word identified in line, hard and serve data? • How the data is tokenized for better quality pos tagging and parsing? • How is the data pre-tagged? • How is parse output of Collins Parser interpreted? • How is the parsed output XML’ized and brought back to Senseval-2 data format? • Idiosyncrasies of line, hard, serve, interest, Senseval-1 and Senseval-2 data and how they are handled?

26. Path Map • Introduction • Background • Data • Experiments • Conclusions

27. Lexical: Senseval-1 & Senseval-2

28. Individual Word POS (Senseval-1)

29. Individual Word POS (Senseval-2)

30. Combining POS Features

31. Effect Guaranteed Pre-tagging on WSD Senseval-1 Senseval-2

32. Parse Features (Senseval-1)

33. Parse Features (Senseval-2)

34. Thoughts… • Both lexical and syntactic features perform comparably. • But do they get the same instances right ? • How much are the individual feature sets redundant. • Are there instances correctly disambiguated by one feature set and not by the other ? • How much are the individual feature sets complementary. Is the effort to combine of lexical and syntactic features justified?

35. Measures • Baseline Ensemble: accuracy of a hypothetical ensemble which predicts the sense correctly only if both individual feature sets do so. • Quantifies redundancy amongst feature sets. • Optimal Ensemble: accuracy of a hypothetical ensemble which predicts the sense correctly if either of the individual feature sets do so. • Difference with individual accuracies quantifies complementarity. We used a simple ensemble which sums up the probabilities for each sense by the individual feature sets to decide the intended sense.

36. Best Combinations

37. Path Map • Introduction • Background • Data • Experiments • Conclusions

38. Conclusions • Significant amount of complementarity across lexical and syntactic features. • Combination of the two justified. • We show that simple lexical and part of speech features can achieve state of the art results. • How best to capitalize on the complementarity still an open issue.

39. Conclusions (continued) • Part of speech of word immediately to the right of target word found most useful. • Pos of words immediately to the right of target word best for verbs and adjectives. • Nouns helped by tags on either side. • (P0, P1) found to be most potent in case of small training data per instance (Sval data). • Larger pos context size (P-2,P-1,P0, P1 , P2) shown to be beneficial when training data per instance is large (line, hard, serve and interest data) • Head word of phrase particularly useful for adjectives • Nouns helped by both head and parent.

40. Other Contributions • Converted line, hard, serve and interest data into Senseval-2 data format. • Part of speech tagged and Parsed the Senseval2, Senseval-1, line, hard, serve and interest data. • Developed the Guaranteed Pre-tagging mechanism to improve quality of pos tagging. • Showed that guaranteed pre-tagging improves WSD. The hard and serve data, part of speech tagged using Guaranteed Pre-tagging is part of NLTK data kit.

41. Code, Data & Resources • SyntaLex : A system to do WSD using lexical and syntactic features. Weka’s decision tree learning algorithm is utilized. • posSenseval : part of speech tags any data in Senseval-2 data format. Brill Tagger used. • parseSenseval : parses data in a format as output by the Brill Tagger. Output is in Senseval-2 data format with part of speech and parse information as xml tags. Uses Collins Parser. • Packages to convert line hard, serve and interest data to Senseval-1 and Senseval-2 data formats. • BrillPatch : Patch to Brill Tagger to employ Guaranteed Pre-Tagging. http://www.d.umn.edu/~tpederse/code.html http://www.d.umn.edu/~tpederse/data.html

42. Documentation • “Combining Lexical and Syntactic Features for Supervised Word Sense Disambiguation”, Mohammad, S. and Pedersen, T., To appear in the Proceedings of Eighth Conference on Natural Language Learning at HLT-NAACL, May 2004, Boston. • “Guaranteed Pre-Tagging for the Brill Tagger”, Mohammad, S. and Pedersen, T., In Proceedings of Fourth International Conference of Intelligent Systems and Text Processing, February 2003, Mexico. • “Combining Lexical and Syntactic Features for Supervised Word Sense Disambiguation”, Mohammad, S., Masters Thesis, August 2003, University of Minnesota, Duluth. http://www.d.umn.edu/~tpederse/students.html

43. Senseval-3 (Mar-1 to April 15, 2004) Around 8000 training and 4000 test instances. Results expected shortly. Thank You