Sciweavers

129 search results - page 2 / 26
» Finding Subsumers for Natural Language Presentation
Sort
View
INLG
2010
Springer
13 years 2 months ago
Generating Natural Language Descriptions of Z Test Cases
Critical software most often requires an independent validation and verification (IVV). IVV is usually performed by domain experts, who are not familiar with specific, many times ...
Maximiliano Cristiá, Brian Plüss
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
13 years 9 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
OOPSLA
2010
Springer
13 years 3 months ago
Managing ambiguity in programming by finding unambiguous examples
We propose a new way to raise the level of discourse in the programming process: permit ambiguity, but manage it by linking it to unambiguous examples. This allows programming env...
Kenneth C. Arnold, Henry Lieberman
NLDB
2000
Springer
13 years 8 months ago
Natural Language Analysis for Semantic Document Modeling
To ease the retrieval of documents published on the Web, the documents should be classified in a way that users find helpful and meaningful. This paper presents an approach to sema...
Terje Brasethvik, Jon Atle Gulla
EDM
2009
116views Data Mining» more  EDM 2009»
13 years 2 months ago
Dimensions of Difficulty in Translating Natural Language into First-Order Logic
In this paper, we present a study of a large corpus of student logic exercises in which we explore the relationship between two distinct measures of difficulty: the proportion of s...
Dave Barker-Plummer, Richard Cox, Robert Dale