675 search results - page 27 / 135 » On Compression of Parse Trees |
140
click to vote
DEXA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
124
click to vote
ACL
1990
15 years 5 months ago
1990
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
145
click to vote
ICDS
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper we present a rule-based formalism for the representation, acquisition, and application of translation knowledge. The formalism is being used successfully in a Jap...
126
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
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...
149
click to vote
KI
2004
Springer
15 years 9 months ago
2004
Springer
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...