Sciweavers

94 search results - page 10 / 19
» grammars 1998
Sort
View
ACL
1998
13 years 11 months ago
Restrictions on Tree Adjoining Languages
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
Giorgio Satta, William Schuler
DEDUCTIVE
1993
140views Database» more  DEDUCTIVE 1993»
13 years 11 months ago
AMOS: A Natural Language Parser Implemented as a Deductive Database in LOLA
In this paper we present the set-oriented bottom-up parsing system AMOS which is a major application of the deductive database system LOLA. AMOS supports the morpho-syntactical an...
Günther Specht, Burkhard Freitag
ARTMED
1998
98views more  ARTMED 1998»
13 years 9 months ago
Dependency parsing for medical language and concept representation
Abstract: The theory of conceptual structures serves as a common basis for natural language processing and medical concept representation. We present a PROLOG-based formalization o...
Friedrich Steimann
ICRA
1998
IEEE
137views Robotics» more  ICRA 1998»
14 years 2 months ago
GRAMMPS: A Generalized Mission Planner for Multiple Mobile Robots in Unstructured Environments
For a system of cooperative mobile robots to be effective in real-world applications, it must be able to efficiently execute a wide class of complex tasks in potentially unknown a...
Barry Brumitt, Anthony Stentz
ACL
1998
13 years 11 months ago
Anaphor Resolution in Unrestricted Texts with Partial Parsing
In this paper we deal with several kinds of anaphora in unrestricted texts. These kinds of anaphora are pronominal references, surfacecount anaphora and one-anaphora. In order to ...
Antonio Ferrández, Manuel Palomar, Lidia Mo...