1 / 3

Lexical Ambiguity Resolution / Sense Disambiguation

Lexical Ambiguity Resolution / Sense Disambiguation. Supervised methods Non-supervised methods Class-based models Seed models Vector models EM Iteration Unsupervised clustering Sense induction Anaphosa Resolution. Problem with supervised methods.

marc
Download Presentation

Lexical Ambiguity Resolution / Sense Disambiguation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Lexical Ambiguity Resolution / Sense Disambiguation • Supervised methods • Non-supervised methods • Class-based models • Seed models • Vector models • EM Iteration • Unsupervised clustering • Sense induction • Anaphosa Resolution -- CS466 Lecture XVIII --

  2. Problem with supervised methods • Tagged training data is expensive (time, resources) • Solution: • Class discriminators can serve as • effective wordsense discriminators • And are much less costly to train if we can tolerate some noise in the models -- CS466 Lecture XVIII --

  3. Pseudo-Class Discriminators What if class lists (like Rogets) are not available? Create small classes optimized for the target ambiguity Class (Crane 1) = heron, stork, eagle, condor, … Class (Crane 2) = derrick, forklift, bulldozers, … Class (Tank 1) = Jeep, Vehicle, Humvee, Bradley, Abrams, … Class (Tank 2) = Vessel, container, flask, pool Include synonyms, hype-nyms, hyponyms, topically related Smaller and potentially more specific but less robust (parent in tree) (child in tree) -- CS466 Lecture XVIII --

More Related