Sönmez, Kemal, Heck, Larry, and Weintraub, Mitchel, Multiple Speaker Tracking and Detection: Handset Normalization and Duration Scoring, Digital Signal Processing 10 (2000), 133–142. We describe SRI’s speaker tracking and detection system in the NIST 1998 Speaker Detection and Tracking Development Evaluation. The system is designed for tracking switchboard conversations and uses a twospeaker an...

Refinement types are a well-studied manner of performing in-depth analysis on functional programs. The dependency pair method is a very powerful method used to prove termination of rewrite systems; however its extension to higher-order rewrite systems is still the subject of active research. We observe that a variant of refinement types allows us to express a form of higher-order dependency pai...

We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type for programs whose execution may raise an exception at top level, and a corruption type for programs that may raise an exception in any evaluation context (not necessarily at top level). We present the syntax and reduction rules of the system, as well as its ...

This paper presents the system developed by Elhuyar for the TweetNorm evaluation campaign which consists of normalizing Spanish tweets to standard language. The normalization covers only the correction of certain Out Of Vocabulary (OOV) words, previously identified by the organizers. The developed system follows a two step strategy. First, candidates for each OOV word are generated by means of ...

It is our aim to develop an elementary strong functional programming (ESFP) system. To be useful, ESFP should include structures such as streams which can be computationally unwound innnitely often. We describe a syntactic analysis to ensure that innnitely proceeding structures, which we shall term codata, are productive. This analysis is an extension of the check for guardedness that has been ...

The catch/throw mechanism in Common Lisp provides a simple control mechanism for non-local exit. We study typed calculi by Nakano and Sato which formalize the catch/throw mechanism. These calculi correspond to classical logic through the Curry-Howard isomorphism, and one of their characteristic points is that they have nondeterministic reduction rules. These calculi can represent various comput...

We introduce a simply typed -calculus " which has both contexts and environments as rst-class values. In ", holes in contexts are represented by ordinary variables of appropriate types and hole lling is represented by the functional application together with a new abstraction mechanism which takes care of packing and unpacking of the term which is used to ll in the holes of the context. " is a ...

We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type A ? ∪{ε} for programs of type A whose execution may raise the exception ε at top level, and a corruption type A{ε} for programs that may raise the exception ε in any evaluation context (not necessarily at top level). We present the syntax and reduction rules ...