Complexity and expressiveness for formal structures in Natural Language Processing

Complexity and expressiveness for formal structures in Natural Language Processing

The formalized and algorithmic study of human language within the field of Natural Language Processing (NLP) has motivated much theoretical work in the related field of formal languages, in particular the subfields of grammar and automata theory. Motivated and informed by NLP, the papers in this the...

Full description

Bibliographic Details
Main Author: Ericson, Petter
Format: Others
Language:English
Published: Umeå universitet, Institutionen för datavetenskap 2017
Subjects:
graph grammars
formal languages
natural language processing
parameterized complexity
abstract meaning representation
tree automata
deterministic tree-walking transducers
mildly context-sensitive languages
hyperedge replacement
tree adjoining languages
minimally adequate teacher
Computer Sciences
Datavetenskap (datalogi)
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-135014
http://nbn-resolving.de/urn:isbn:9789176017227

Internet

http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-135014
http://nbn-resolving.de/urn:isbn:9789176017227

Similar Items