About: GADDAG

An Entity of Type: building, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

A GADDAG is a data structure presented by Steven Gordon in 1994, for use in generating moves for Scrabble and other word-generation games where such moves require words that "hook into" existing words. It is often in contrast to move-generation algorithms using a directed acyclic word graph (DAWG) such as the one used by Maven. It is generally twice as fast as the traditional DAWG algorithms, but take about 5 times as much space for regulation Scrabble dictionaries. Quackle, an open-source Scrabble program, uses a GADDAG to generate moves.

Property	Value
dbo:abstract	A GADDAG is a data structure presented by Steven Gordon in 1994, for use in generating moves for Scrabble and other word-generation games where such moves require words that "hook into" existing words. It is often in contrast to move-generation algorithms using a directed acyclic word graph (DAWG) such as the one used by Maven. It is generally twice as fast as the traditional DAWG algorithms, but take about 5 times as much space for regulation Scrabble dictionaries. Quackle, an open-source Scrabble program, uses a GADDAG to generate moves. (en)
dbo:wikiPageID	28134188 (xsd:integer)
dbo:wikiPageLength	3866 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	998063132 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Scrabble dbr:Maven_(Scrabble) dbr:Suffix_automaton dbc:String_data_structures dbc:Scrabble_software dbr:Prefix_Hash_Tree dbr:Suffix_tree dbc:Game_artificial_intelligence dbr:Trie dbr:Data_structure dbc:Graph_data_structures dbr:Directed_acyclic_graph
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Slink
dcterms:subject	dbc:String_data_structures dbc:Scrabble_software dbc:Game_artificial_intelligence dbc:Graph_data_structures
gold:hypernym	dbr:Structure
rdf:type	yago:WikicatStringDataStructures yago:Abstraction100002137 yago:Arrangement105726596 yago:Cognition100023271 yago:DataStructure105728493 yago:PsychologicalFeature100023100 yago:WikicatGraphDataStructures dbo:Building yago:Structure105726345
rdfs:comment	A GADDAG is a data structure presented by Steven Gordon in 1994, for use in generating moves for Scrabble and other word-generation games where such moves require words that "hook into" existing words. It is often in contrast to move-generation algorithms using a directed acyclic word graph (DAWG) such as the one used by Maven. It is generally twice as fast as the traditional DAWG algorithms, but take about 5 times as much space for regulation Scrabble dictionaries. Quackle, an open-source Scrabble program, uses a GADDAG to generate moves. (en)
rdfs:label	GADDAG (en)
owl:sameAs	freebase:GADDAG yago-res:GADDAG wikidata:GADDAG dbpedia-sr:GADDAG https://global.dbpedia.org/id/4k5qw
prov:wasDerivedFrom	wikipedia-en:GADDAG?oldid=998063132&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:GADDAG
is dbo:wikiPageWikiLink of	dbr:Maven_(Scrabble)
is foaf:primaryTopic of	wikipedia-en:GADDAG