Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Most Frequent Sense documentation #318

Open
jnehring opened this issue Nov 21, 2016 · 2 comments
Open

Most Frequent Sense documentation #318

jnehring opened this issue Nov 21, 2016 · 2 comments

Comments

@jnehring
Copy link
Member

FREME NER has the most frequent sense (MFS) disambiguation method. To my knowledge this requires certain values to be initialized in FREME NER that determine that one word sense is more frequent then another.

Does the documentation explain how to initialize this data? I dont think so.

If not, please add a section to the freme ner article how to initialise the MFS values.

What happens when we use MFS and the counts are not initialized when FREME NER has to choose between two senses with the same surface form? Does it choose the first in the list?

@m1ci
Copy link
Contributor

m1ci commented Nov 21, 2016

This is valid for DBpedia, since such data is not available for other datasets.
@sandroacoelho can you please extend the FREME NER article and explain

  1. what data is needed for most frequent sense
  2. how it can be loaded in Solr

@jnehring

 What happens when we use MFS and the counts are not initialized when FREME NER has to choose between two senses with the same surface form?

Its by Solr. If the mention is same with two surface forms which are same but for different entities, then I would say that Solr ranks them randomly - without any specific preference for one over another.

Does it choose the first in the list?

yes.

@sandroacoelho
Copy link

Hi @m1ci : sure. Let's do that

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

3 participants