Überfällige Google-Kritik: Based on billions of daily queries and an estimated share of about 49% of the total Web queries allows predicting with astonishing accuracy what is going to happen in a number of areas of economic importance.
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, multisets, finite functions, permutations binary decision diagrams, graphs, hypergraphs, parenthesis languages, dyadic rationals, DNA sequences etc.) and their extension to hereditary finite universes through hylomorphisms derived from ranking/unranking and pairing/unpairing operations. An embedded higher order combinator language provides any-to-any encodings automatically. Besides applications to experimental mathematics, a few examples of "free algorithms" obtained by transferring operations between data types are shown. Other applications range from stream iterators on combinatorial objects to self-delimiting codes, succinct data representations and generation of random instancs. The paper covers 47 data types and, through the use of the embedded combinator language, provides 2162 distinct bijective transformations between them.
This is a list of 100 important natural language processing (NLP) papers that serious students and researchers working in the field should probably know about and read.
A. Mousavian, D. Anguelov, J. Flynn, und J. Kosecka. (2016)cite arxiv:1612.00496Comment: To appear in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) 2017.