Sciweavers

621 search results - page 26 / 125
» Parsing As Tree Traversal
Sort
View
ICDIM
2008
IEEE
14 years 4 months ago
Sentence compression by structural conversion of parse tree
Sentence compression is the task of generating a grammatical short sentence from an original sentence, retaining important information. The existing methods of only removing the c...
Seiji Egawa, Yoshihide Kato, Shigeki Matsubara
ENTCS
2000
123views more  ENTCS 2000»
13 years 9 months ago
Defining Standard Prolog in Rewriting Logic
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
Marija Kulas, Christoph Beierle
WWW
2004
ACM
14 years 10 months ago
Parsing owl dl: trees or triples?
The Web Ontology Language (OWL) defines three classes of documents: Lite, DL and Full. All RDF/XML documents are OWL Full documents, some OWL Full documents are also OWL DL docume...
Sean Bechhofer, Jeremy J. Carroll
KI
2004
Springer
14 years 3 months ago
Generation of Sentence Parse Trees Using Parts of Speech
This paper proposes a new corpus-based approach for deriving syntactic structures and generating parse trees of natural language sentences. The parts of speech (word categories) of...
Tunga Güngör
COLING
2008
13 years 11 months ago
Unsupervised Induction of Labeled Parse Trees by Clustering with Syntactic Features
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
Roi Reichart, Ari Rappoport