675 search results - page 121 / 135 » On Compression of Parse Trees |
APSEC
2003
IEEE
14 years 1 months ago
2003
IEEE
The size, complexity and duration of typical software engineering projects means that teams of developers will work on them. However, with the exception of version control systems...
ECML
2003
Springer
14 years 1 months ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
ICCS
2001
Springer
14 years 1 months ago
2001
Springer
Automatically generating Conceptual Graphs (CGs) [1] from natural language sentences is a difficult task in using CG as a semantic (knowledge) representation language for natural l...
CASES
2000
ACM
14 years 1 months ago
2000
ACM
In this paper, we describe a software architecture supporting code generation from within Ptolemy II. Ptolemy II is a componentbased design tool intended for embedded and real-tim...
AUSAI
1997
Springer
14 years 24 days ago
1997
Springer
This paper describes a system that performs hierarchical error recovery, and detects and corrects a single error in a sentence at the lexical, syntactic, and/or semantic levels. I...