AIDA is the named entity disambiguation system created by the Databases and Information Systems Department at the Max Planck Institute for Informatics in Saarbücken, Germany. It identifies mentions of named entities (persons, organizations, locations, songs, products, ...) in text and links them to a unique identifier. Most names are ambiguous, especially family names, and AIDA resolves this ambiguity. See the EMNLP 2011 publication [EMNLP2011] for a detailed description of how it works and the VLDB 2011 publication [VLDB2011] for a description of our Web demo.
If you want to be notified about AIDA news or new releases, subscribe to our announcement mailing list by sending a mail to:
aida-news-subscribe@lists.mpi-inf.mpg.de
AIDA is a framework and online tool for entity detection and disambiguation. Given a natural-language text, it maps mentions of ambiguous names onto canonical entities (e.g., individual people or places) registered in the YAGO2 [YAGO2] knowledge base. This knowledge is useful for multiple tasks, for example:
- Build an entity index. This allows one kind of semantic search, retrieve all documents where a given entity was mentioned.
- Extract knowledge about the entities, for example relations between entities mention in the text.
YAGO2 entities have a one-to-one correspondence to Wikipedia pages, thus each disambiguated entity also denotes a Wikipedia URL.
Note that AIDA does not annotate common words (like song, musician, idea, ... ). Also, AIDA does not identify mentions that have no entity in the repository. Once a name is in the dictionary containing all candidates for surface strings, AIDA will map to the best possible candidate, even if the correct one is not in the entity repository
AIDA needs a Postgres database to run. We tested it starting from version 8.4, but version 9.2 will give a better performance for many queries AIDA runs, due to the ability to fetch data from the indexes.
The machine AIDA runs on should have a reasonable amount of main memory. If you are using graph coherence (see the Section Configuring AIDA), the amount of memory grows quadratically with the number of entities and thus the length of the document. Anything above 10,000 candidates will be too much for a regular desktop machine (at the time of writing) to handle and should run on a machine with more than 20GB of main memory. AIDA does the most intensive computations in parallel and thus benefits from multi-core machine.
AIDA was developed to disambiguate to the YAGO2 knowledge base, returning the YAGO2 identifier for disambiguated entities. However, you can use AIDA for any entity repository, given that you have keyphrases and weights for all entities. The more common case is to use AIDA with YAGO2. If you want to set it up with your own repository, see the Advanced Configuration section.
To use AIDA with YAGO2, download the repository we provide on our AIDA website as a Postgres dump and import it into your database server. This will take some time, maybe even a day depending on the speed of the machine Postgres is running on. Once the import is done, you can start using AIDA immediately by adjusting the settings/database_aida.properties to point to the database. AIDA will then use nearly 3 million named entities harvested from Wikipedia for disambiguation.
Get the Entity Repository:
curl -O http://www.mpi-inf.mpg.de/yago-naga/aida/download/entity-repository/AIDA_entity_repository_2010-08-17.sql.bz2
Import it into a postgres database:
bzcat AIDA_entity_repository_2010-08-17.sql.bz2 | psql <DATABASE>
where is a database on a PostgreSQL server.
To build aida, run ant (See Apache Ant) in the directory of the cloned repository. This will create an aida.jar including all dependencies.
The main configuration is done in the files in the settings/ directory. The following files can be adjusted:
aida.properties: take thesample_settings/aida.propertiesand adjust it accordingly. The default values are reasonable, so if you don't want to change anything, the file is not needed at all.database_aida.properties: take thesample_settings/database_aida.properties, put it here and adjust it accordingly. The settings should point to the Postgres database server that holds the entity repository - how to set this up is explained below.
The main classes in AIDA are mpi.aida.Preparator for preparing an input document and mpi.aida.Disambiguator for running the disambiguation on the prepared input. A minimal call looks like this:
// Define the input.
String inputText = "When [[Page]] played Kashmir at Knebworth, his Les Paul was uniquely tuned.";
// Prepare the input for disambiguation. The Stanford NER will be run
// to identify names. Strings marked with [[ ]] will also be treated as names.
PreparationSettings prepSettings = new StanfordHybridPreparationSettings();
Preparator p = new Preparator();
PreparedInput input = p.prepare("document_id", inputText, prepSettings);
// Disambiguate the input with the graph coherence algorithm.
DisambiguationSettings disSettings = new CocktailPartyDisambiguationSettings();
Disambiguator d = new Disambiguator(input, disSettings);
DisambiguationResults results = d.disambiguate();
// Print the disambiguation results.
for (ResultMention rm : results.getResultMentions()) {
ResultEntity re = results.getBestEntity(rm);
System.out.println(rm.getMention() + " -> " + re +
" (" + AidaManager.getWikipediaUrl(re) + ")");
}
The ResultEntity contains the AIDA ID via the getEntity() method. This can be transformed into a Wikipedia URL by calling AidaManager.getWikipediaUrl() for the result entity.
See the mpi.aida.config.settings.disambiguation package for all possible predefined configurations, passed to the Disambiguator:
PriorOnlyDisambiguationSettings: Annotate each mention with the most prominent entity.LocalDisambiguationSettings: Use the entity prominence and the keyphrase-context similarity to disambiguate.CocktailPartyDisambiguationSettings: Use a graph algorithm on the entity coherence graph ([MilneWitten] link coherence) to disambiguate.CocktailPartyKOREDisambiguationSettings: Use a graph algorithm on the entity coherence graph ([KORE] link coherence) to disambiguate.
-
Build AIDA:
ant -
Run the CommandLineDisambiguator:
java -Xmx4G -cp aida.jar mpi.aida.CommandLineDisambiguator GRAPH <INPUT-FILE>
<INPUT-FILE> is path to the text file to be annotated with entities. The format for <INPUT-FILE> should be plain text with UTF-8 encoding.
Instead of GRAPH, you can put one of the following, corresponding to the settings described above:
PRIOR: PriorOnlyDisambiguationSettingsLOCAL: LocalDisambiguationSettingsGRAPH: CocktailPartyDisambiguationSettingsGRAPH-KORE: CocktailPartyKOREDisambiguationSettings
The output will be an HTML file with annotated mentions, linking to the corresponding Wikipedia page.
The input of AIDA is a text (as Java String) or file in UTF-8 encoding. By default, named entities are recognized by the Stanford NER component of the CoreNLP tool suite. In addition, mentions can be marked up by square brackets, as in this example "Page":
When [[Page]] played Kashmir at Knebworth, his Les Paul was uniquely tuned.
The mention recognition can be configured by using different PreparationSettings in the mpi.aida.config.settings.preparation package:
StanfordHybridPreparationSettings: Use Stanford CoreNLP NER and allow manual markup using [[...]]StanfordManualPreparationSettings: Use Stanford CoreNLP only for tokenization and sentence splitting, mentions need to be marked up by [[...]].
The PreparationSettings are passed to the Preparator, see the Hands-On API Example.
The mpi.aida.config.settings.DisambiguationSettings contain all the configurations for the weight computation of the disambiguation graph. The best way to configure the DisambiguationSettings for constructing the disambiguation graph is to use one of the predefined settings objects in the mpi.aida.config.settings.disambiguation package, see below.
These pre-configured DisambiguatorSettings objects can be passed to the Disambiguator:
PriorOnlyDisambiguationSettings: Annotate each mention with the most prominent entity.LocalDisambiguationSettings: Use the entity prominence and the keyphrase-context similarity to disambiguate.CocktailPartyDisambiguationSettings: Use a graph algorithm on the entity coherence graph ([MilneWitten] link coherence) to disambiguate.CocktailPartyKOREDisambiguationSettings: Use a graph algorithm on the entity coherence graph ([KORE] link coherence) to disambiguate.
The principle parameters are (corresponding to all the instance variables of the DisambiguationSettings object):
alpha: Balances the mention-entity edge weights (alpha) and the entity-entity edge weights (1-alpha).disambiguationTechnique: Technique to solve the disambiguation graph with. Most commonly this is LOCAL for mention-entity similarity edges only and GRAPH to include the entity coherence.disambiguationAlgorithm: If TECHNIQUE.GRAPH is chosen above, this specifies the algorithm to solve the disambiguation graph. Can be COCKTAIL_PARTY for the full disambiguation graph and COCKTAIL_PARTY_SIZE_CONSTRAINED for a heuristically pruned graph.useExhaustiveSearch: Set to true to use exhaustive search in the final solving stage of ALGORITHM.COCKTAIL_PARTY. Set to false to do a hill-climbing search from a random starting point.useNormalizedObjective: Set to true to normalize the minimum weighted degree in the ALGORITHM.COCKTAIL_PARTY by the number of graph nodes. This prefers smaller solutions.entitiesPerMentionConstraint: Number of candidates to keep for for ALGORITHM.COCKTAIL_PARTY_SIZE_CONSTRAINED.useCoherenceRobustnessTest: Set to true to enable the coherence robustness test, fixing mentions with highly similar prior and similarity distribution to the most promising candidate before running the graph algorithm.cohRobustnessThreshold: Threshold of the robustness test, below which the the L1-norm between prior and sim results in the fixing of the entity candidate.similaritySettings: Settings to compute the edge-weights of the disambiguation graph. Details see below.coherenceSimilaritySetting: Settings to compute the initial mention-entity edge weights when using coherence robustness.
The edge weights of the disambiguation graph are configured in the similaritySettings object of DisambiguationSettings. They have a major impact on the outcome of the disambiguation.
mentionEntitySimilarities: a list of mention-entity similarity triples. The first one is the SimilarityMeasure, the second the EntitiesContext, the third the weight of this mentionEntitySimilarity. Note that they need to add up to 1.0, including the number for the priorWeight option. If loading from a file, the triples are separated by ":". The mentionEntitySimilarities option also allows to enable or disable the first or second half of the mention-entity similarities based on the priorThreshold option. If this is present, the first half of the list is used when the prior is disable, the second one when it is enabled. Note that still the whole list weights need to sum up to 1 with the prior, the EnsembleMentionEntitySimilarity class will take care of appropriate re-scaling.priorWeight: The weight of the prior probability. Needs to sum up to 1.0 with all weights in mentionEntitySimilarities.priorThreshold: If set, the first half of mentionEntitySimilarities will be used for the mention-entity similarity when the best prior for an entity candidate is below the given threshold, otherwise the second half of the list together with the prior is used.entityEntitySimilarity: The name and the weight of the entity-entity similarity to use, as pairs of name and weight. If loading from a file, the pairs are ":"-separated.
Take our default configuration as example (in File syntax):
mentionEntitySimilarities = UnnormalizedKeyphrasesBasedMISimilarity:KeyphrasesContext:1.4616111666431395E-5 UnnormalizedKeyphrasesBasedIDFSimilarity:KeyphrasesContext:4.291375037765039E-5 UnnormalizedKeyphrasesBasedMISimilarity:KeyphrasesContext:0.15586170799823845 UnnormalizedKeyphrasesBasedIDFSimilarity:KeyphrasesContext:0.645200419577534
priorWeight = 0.19888034256218348
priorThreshold = 0.9
entityEntitySimilarity = MilneWittenEntityEntitySimilarity:1.0
It is possible to create a SimilaritySettings object programmatically, however we recommend using the preconfigured settings in the mpi.aida.config.settings.disambiguation package.
If you want to add your own stopwords, you can add them to settings/tokens/stopwords6.txt.
You can deploy AIDA with any set of named entities, given that you have descriptive keyphrases and weights for them. The database layout has to conform to the one described here. For a good example instance of all the data please download the YAGO2-based AIDA entity repository from our website.
The mandatory database tables are:
- dictionary
- entity_ids
- entity_keyphrases
- keyword_counts
- word_ids
- word_expansion
Each one is described in detail below, starting with the table name plus column names and SQL types.
dictionary (
mention text, entity integer, prior double precision
)
The dictionary is used for looking up entity candidates for a given surface form of a mention. Each mention-entity pair can have an associated prior probability. Mentions with the length of 4 characters or more are case-conflated to all-upper case. Also, mentions are normalized using the YAGO2 basics.Normalize.string() method (included as a jar.). To get the original mentoin string, use basics.Normalize.unString().
entity_ids (
entity text, id integer
)
This table is used for mapping the integer ids to a human-readable entity representation. In the existing repository, entities are encoded using the basics.Normalize.entity() method. To get the original entity name (as taken from Wikipedia), use basics.Normalize.unEntity().
keyword_counts (
keyword integer, count integer
)
The counts should reflect the number of times the given keyword occurs in the collection and is used to compute the IDF weight for all keywords. This means high counts will result in low weights.
word_ids (
word text, id integer
)
All keyphrase and keyword ids must be present here. The input text will be transformed using the table and then matched against all entity keyphrases.
word_expansion (
word integer, expansion integer
)
AIDA tries to match ALL_CAPS variants of mixed-case keywords. Put the ids of the UPPER_CASED word it in this table.
entity_keyphrases (
entity integer, keyphrase integer, keyphrase_tokens integer[], source character varying(100), count integer, weight double precision DEFAULT 1.0, keyphrase_token_weights double precision[]
)
This is the meat of AIDA. All entities are associated with (optionally weighted) keyphrases, represented by an integer id. As the keyphrases are matched partially against input text, the (weighted) keyphrase_tokens are stored alongside each keyphrase. The mandatory fields are:
- entity: The id corresponds to the id in the dictionary and the entity_ids table.
- keyphrase: The id corresponds to the id in the word_ids table.
- keyphrase_tokens: Each id in the array corresponds to one word in the word_ids table.
- keyphrase_token_weights: Each entry in the double array is the entity-specific weight of the keyword at the same position as keyphrase_tokens.
The optional fields are:
- source: Keyphrases can be filtered by source
- count: This can be used to keep the co-occurrence counts of the entity-keyphrase pairs, but is superflous if all the weights are pre-computed
- weight: AIDA can use keyphrase weights but by default does not.
entity_inlinks (
entity integer, inlinks integer[]
)
If you want to use coherence based on a link graph (MilneWittenEntityEntitySimilarity) instead of keyphrases (KOREEntityEntitySimilarity), this table needs to be populated with all entities and their inlinks.
To get the best results for AIDA, please use the mpi.aida.config.settings.disambiguation.CocktailPartyDisambiguationSettings for the Disambiguator, as described in Pre-configured DisambiguationSettings . You can also compare your results on the datasets where we already ran AIDA, see below.
There are two main datasets we created to do research on AIDA. Both are available on the AIDA website.
- CONLL-YAGO: A collection of 1393 Newswire documents from the Reuters RCV-1 collection. All names are annotated with their respective YAGO2 entities. We make the annotations available for research purposes, however the Reuters RCV-1 collection must be purchased to use the dataset.
- KORE50: A collection of 50 handcrafted sentences from 5 different domains.
We provide readers for these two datasets in the mpi.experiment.reader package which will produce PreparedInput objects for each document in the collection. See the respective CoNLLReader and KORE50Reader classes for the location of the data.
If you are using AIDA, any parts of it or any datasets we made available, please give us credit by referencing AIDA in your work. If you are publishing scientific work based on AIDA, please cite our [EMNLP2011] paper referenced at the end of this document.
- Our AIDA project website: http://www.mpi-inf.mpg.de/yago-naga/aida/
- Our news mailing list: Mail to aida-news-subscribe@lists.mpi-inf.mpg.de to get news and updates about releases.
The AIDA developers are (in alphabetical order):
- Ilaria Bordino
- Johannes Hoffart ( http://www.mpi-inf.mpg.de/~jhoffart )
- Edwin Lewis-Kelham
- Dat Ba Nguyen ( http://www.mpi-inf.mpg.de/~datnb )
- Stephan Seufert ( http://www.mpi-inf.mpg.de/~sseufert )
- Mohamed Amir Yosef ( http://www.mpi-inf.mpg.de/~mamir )
AIDA by Max-Planck-Institute for Informatics, Databases and Information Systems is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License.
We thank the authors of the following pieces of software, without which the development of AIDA would not have been possible. The included software is available under different licenses than the AIDA source code, namely:
- Apache Commons, all licensed under Apache 2.0
- cli, collections, io, lang
- MPI D5 utilities, all licensed under CC-BY 3.0
- basics2, javatools, mpi-DBManager
- JavaEWAH, licensed under Apache 2.0
- JUnit, licensed under CPL 1.0
- log4j, licensed under Apache 2.0
- postgresql-jdbc, licensed under the BSD License
- slf4j, licensed under MIT License
- Stanford CoreNLP, licensed under the GPL v2
- Dependencies:
- jgrapht, licensed under LGPL v2.1
- xom, licensed under LGPL v2.1
- joda-time, licensed under Apache 2.0
- Dependencies:
- Trove, licensed under the LGPL, parts under a license by CERN
All licenses can be found in the licenses/ directory or at the following URLs:
- Apache License 2.0: http://www.apache.org/licenses/LICENSE-2.0
- Creative Commons CC-BY 3.0: http://creativecommons.org/licenses/by/3.0/
- GNU GPL v2: http://www.gnu.org/licenses/gpl-2.0.html
- GNU LGPL v2.1: http://www.gnu.org/licenses/lgpl-2.1.html
If you use AIDA in your research, please cite AIDA:
@inproceedings{AIDA2011,
author = {Hoffart, Johannes and Yosef, Mohamed Amir and Bordino, Ilaria and F{\"u}rstenau, Hagen and Pinkal, Manfred and Spaniol, Marc and Taneva, Bilyana and Thater, Stefan and Weikum, Gerhard},
title = {{Robust Disambiguation of Named Entities in Text}},
booktitle = {Conference on Empirical Methods in Natural Language Processing, EMNLP 2011, Edinburgh, Scotland},
year = {2011},
pages = {782--792}
}
- [EMNLP2011]: J. Hoffart, M. A. Yosef, I. Bordino, H. Fürstenau, M. Pinkal, M. Spaniol, B. Taneva, S. Thater, and G. Weikum, "Robust Disambiguation of Named Entities in Text," Conference on Empirical Methods in Natural Language Processing, EMNLP 2011, Edinburgh, Scotland, 2011, pp. 782–792.
- [VLDB2011]: M. A. Yosef, J. Hoffart, I. Bordino, M. Spaniol, and G. Weikum, “AIDA: An Online Tool for Accurate Disambiguation of Named Entities in Text and Tables,” Proceedings of the 37th International Conference on Very Large Databases, VLDB 2011, Seattle, WA, USA, 2011, pp. 1450–1453.
- [YAGO2]: J. Hoffart, F. M. Suchanek, K. Berberich, and G. Weikum, “YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia,” Artificial Intelligence, vol. 194, pp. 28–61, 2013.
- [MilneWiten]: D. Milne and I. H. Witten, “An Effective, Low-Cost Measure of Semantic Relatedness Obtained from Wikipedia Links,” Proceedings of the AAAI 2008 Workshop on Wikipedia and Artificial Intelligence (WIKIAI 2008), Chicago, IL, 2008.
- [KORE]: J. Hoffart, S. Seufert, D. B. Nguyen, M. Theobald, and G. Weikum, “KORE: Keyphrase Overlap Relatedness for Entity Disambiguation,” Proceedings of the 21st ACM International Conference on Information and Knowledge Management, CIKM 2012, Hawaii, USA, 2012, pp. 545–554.