Definitional Question Answering task is usually proposed as the retrieval of a set of text fragments that contain information relevant to the target to define. Following this principle, a systematic approach to obtain which information is relevant is proposed, along with a new evaluation process. Finally, the paper describes the elaboration of a corpus of definitions in order to produce a gold ...

We propose a definitional question answering system that extracts phrases using syntactic patterns which are easily constructed manually and can reduce the coverage problem. Experimental results show that our phrase extraction system outperforms a sentence extraction system, especially for selecting concise answers, in terms of recall and precision, and indicate that the proper text unit of ans...

We present a variant of the linear logical framework LLF that avoids the restriction that well-typed forms be in pre-canonical form and adds λ-abstraction at the level of families. We abandon the use of β-conversion as definitional equality in favor of a set of typed definitional equality judgments that include rules for parallel conversion and extensionality. We show type-checking is decidable...

A definitional interpreter should be clear and easy to write, but it may run 4–10 times slower than a well-crafted bytecode interpreter. In a case study focused on implementation choices, we explore ways of making definitional interpreters faster without expending much programming effort. We implement, in OCaml, interpreters based on three semantics for a simple subset of Lua. We compile the OC...

The briefest and most usual way of defining the field of linguistics is to call it the "science of language," where "language" is intended to mean a natural language. This is not a sufficient definition, since there are other sciences of language such as the psychology of language, the sociology of language, and similar disciplines. How does linguistics differ from these other fields? Linguisti...

The detection of deterministic computations at run-time can be used to introduce dynamic cuts pruning the search space and thus increasing the efficiency of Functional-Logic systems. This idea was introduced in an early work of R. Loogen and S. Winkler. However the proposal of these authors cannot be used in current implementations because it did not consider non-deterministic functions and was...