Paraphrastic language models and combination with neural network language models

In natural languages multiple word sequences can represent the same underlying meaning. Only modelling the observed surface word sequence can result in poor context coverage, for example, when using n-gram language models (LM). To handle this issue, paraphrastic LMs were proposed in previous research and successfully applied to a US English conversational telephone speech transcription task. In order to exploit the complementary characteristics of paraphrastic LMs and neural network LMs (NNLM), the combination between the two is investigated in this paper. To investigate paraphrastic LMs' generalization ability to other languages, experiments are conducted on a Mandarin Chinese broadcast speech transcription task. Using a paraphrastic multi-level LM modelling both word and phrase sequences, significant error rate reductions of 0.9% absolute (9% relative) and 0.5% absolute (5% relative) were obtained over the baseline n-gram and NNLM systems respectively, after a combination with word and phrase level NNLMs. © 2013 IEEE.

Automatic construction and natural-language description of nonparametric regression models

Copyright © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. This paper presents the beginnings of an automatic statistician, focusing on regression problems. Our system explores an open-ended space of statistical models to discover a good explanation of a data set, and then produces a detailed report with figures and natural- language text. Our approach treats unknown regression functions non- parametrically using Gaussian processes, which has two important consequences. First, Gaussian processes can model functions in terms of high-level properties (e.g. smoothness, trends, periodicity, changepoints). Taken together with the compositional structure of our language of models this allows us to automatically describe functions in simple terms. Second, the use of flexible nonparametric models and a rich language for composing them in an open-ended manner also results in state- of-the-art extrapolation performance evaluated over 13 real time series data sets from various domains.

Unified form language: A domain-specific language for weak formulations of partial differential equations

We present the Unified Form Language (UFL), which is a domain-specific language for representing weak formulations of partial differential equations with a view to numerical approximation. Features of UFL include support for variational forms and functionals, automatic differentiation of forms and expressions, arbitrary function space hierarchies formultifield problems, general differential operators and flexible tensor algebra. With these features, UFL has been used to effortlessly express finite element methods for complex systems of partial differential equations in near-mathematical notation, resulting in compact, intuitive and readable programs. We present in this work the language and its construction. An implementation of UFL is freely available as an open-source software library. The library generates abstract syntax tree representations of variational problems, which are used by other software libraries to generate concrete low-level implementations. Some application examples are presented and libraries that support UFL are highlighted. © 2014 ACM.

function definition language fdl and its implementation

A Function Definition Language (FDL) is presented. Though designed for describing specifications, FDL is also a general-purpose functional programming language. It uses context-free language as data type, supports pattern matching definition of functions, offers several function definition forms, and is executable. It is shown that FDL has strong expressiveness, is easy to use and describes algorithms concisely and naturally. An interpreter of FDL is introduced. Experiments and discussion are included.

yet another meta-language for programming language processing

The formal specification language LFC was designed to support formal specification acquisition. However, it is yet suited to be used as a meta-language for specifying programming language processing. This paper introduces LFC as a meta-language, and compares it with ASF+SDF, an algebraic specification formalism that can also be used to programming languages.

combining cfg and recursive functions to get a new language

We propose a new functional programming language(FPL) which differs in some aspects from most well known FPLs[l].We descrihc the prohlmm domain,the language,explain why we need it.

smoothing document language model with local word graph

ACM SIGIR; ACM SIGWEB

面向任务的机器人语言的实现

本文提出的面向任务的机器人语言是为移动机器人提供的一种编程工具。利用环境描述语言和其他灵活的人机对话方式建立环境模型;根据各种不同的性能指标,规划出最佳路径;根据安全等因素自动规划出最佳路径上的行走参数;对来自传感器的信息进行处理,以确定机器人实际位置及障碍情况;引导机器人沿规划好的路径行走,纠正偏差或重新选择避障路径。

手写体数字识别装置

本文叙述一种采用飞点扫描管沿字周边扫描的技术,和如何把得到的模拟文字信息按文字的高和宽以及光点运动的方向分成4×5格子和八个方向。这样就能够从大量的信息中提取出十七种用于特征描述的基本信息量。当然选择这一“模拟——数字”信息压缩的依据和数量是由特征抽取确定的。本文还讨论了筹划特征法分类的实践,着眼点是找出能代表被分类诸对象的特征(圆弧、线段等),在此基础上用得到的60个特征来描述被分类的诸对象。理想的情况下用这些特征去描述某个数字应当是唯一的,由于手写体变化较大,扫描结果部分失真,因此在分类逻辑中,还要依据大量实践的结果加上一些所谓技巧性的逻辑,才能组成一个合理的分类逻辑。本文叙述的方法和实践已用于沈阳市信函自动分拣样机上。

ETC中具有车型识别功能的车辆检测器设计

介绍了专门用于ETC(不停车收费系统)中一种车辆检测器的软硬件设计方法。根据车辆检测器应用环境的特点给出了基准频率校正算法,可以对基准频率进行实时校正。并采用模糊模式识别算法进行车型识别。