Simplified Lesk Algorithm with Sense Frequency
I am given a WSD (Word Sense Disambiguation) task. I believe the first thing you would try is the following:
1) The most frequent sense baseline (choosing first synset #1)
2) Simplified Lesk Algorithm
Not surprisingly, the performance of the most frequent sense baseline performed fairly well, whereas Simplified Lesk Algorithm was not as good. Using this observation, I am wondering if you can somehow incorporate frequencies of senses in the Simplified Lesk Algorithm. If the Lesk algorithm takes max over overlap sizes, would taking the max of product of overlap size and frequency of corresponding sense be a reasonable modification, if we are somehow given frequencies of senses (possibly learned from training corpus)?
python nlp wordnet
add a comment |
I am given a WSD (Word Sense Disambiguation) task. I believe the first thing you would try is the following:
1) The most frequent sense baseline (choosing first synset #1)
2) Simplified Lesk Algorithm
Not surprisingly, the performance of the most frequent sense baseline performed fairly well, whereas Simplified Lesk Algorithm was not as good. Using this observation, I am wondering if you can somehow incorporate frequencies of senses in the Simplified Lesk Algorithm. If the Lesk algorithm takes max over overlap sizes, would taking the max of product of overlap size and frequency of corresponding sense be a reasonable modification, if we are somehow given frequencies of senses (possibly learned from training corpus)?
python nlp wordnet
(Shameless plug): Did you look at github.com/alvations/pywsd/tree/master/pywsd ?
– alvas
Nov 12 '18 at 5:53
Sense frequency is a little hard to define though.
– alvas
Nov 12 '18 at 5:53
add a comment |
I am given a WSD (Word Sense Disambiguation) task. I believe the first thing you would try is the following:
1) The most frequent sense baseline (choosing first synset #1)
2) Simplified Lesk Algorithm
Not surprisingly, the performance of the most frequent sense baseline performed fairly well, whereas Simplified Lesk Algorithm was not as good. Using this observation, I am wondering if you can somehow incorporate frequencies of senses in the Simplified Lesk Algorithm. If the Lesk algorithm takes max over overlap sizes, would taking the max of product of overlap size and frequency of corresponding sense be a reasonable modification, if we are somehow given frequencies of senses (possibly learned from training corpus)?
python nlp wordnet
I am given a WSD (Word Sense Disambiguation) task. I believe the first thing you would try is the following:
1) The most frequent sense baseline (choosing first synset #1)
2) Simplified Lesk Algorithm
Not surprisingly, the performance of the most frequent sense baseline performed fairly well, whereas Simplified Lesk Algorithm was not as good. Using this observation, I am wondering if you can somehow incorporate frequencies of senses in the Simplified Lesk Algorithm. If the Lesk algorithm takes max over overlap sizes, would taking the max of product of overlap size and frequency of corresponding sense be a reasonable modification, if we are somehow given frequencies of senses (possibly learned from training corpus)?
python nlp wordnet
python nlp wordnet
asked Nov 12 '18 at 2:53
Ted
9518
9518
(Shameless plug): Did you look at github.com/alvations/pywsd/tree/master/pywsd ?
– alvas
Nov 12 '18 at 5:53
Sense frequency is a little hard to define though.
– alvas
Nov 12 '18 at 5:53
add a comment |
(Shameless plug): Did you look at github.com/alvations/pywsd/tree/master/pywsd ?
– alvas
Nov 12 '18 at 5:53
Sense frequency is a little hard to define though.
– alvas
Nov 12 '18 at 5:53
(Shameless plug): Did you look at github.com/alvations/pywsd/tree/master/pywsd ?
– alvas
Nov 12 '18 at 5:53
(Shameless plug): Did you look at github.com/alvations/pywsd/tree/master/pywsd ?
– alvas
Nov 12 '18 at 5:53
Sense frequency is a little hard to define though.
– alvas
Nov 12 '18 at 5:53
Sense frequency is a little hard to define though.
– alvas
Nov 12 '18 at 5:53
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53255407%2fsimplified-lesk-algorithm-with-sense-frequency%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53255407%2fsimplified-lesk-algorithm-with-sense-frequency%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
(Shameless plug): Did you look at github.com/alvations/pywsd/tree/master/pywsd ?
– alvas
Nov 12 '18 at 5:53
Sense frequency is a little hard to define though.
– alvas
Nov 12 '18 at 5:53