2954113
Tree Adjunct Grammars
In this paper, a tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd (Information and Control14 (1969), 217-231) and Rounds (Mathematical Systems Theory 4 (1970), 257-287) and to the recognizable sets and local sets discussed by Thatcher (Journal of Computer and System Sciences1 (1967), 317-322; 4 (1970), 339-367) and Rounds. Linguistic relevance of these systems has been briefly discussed also.
16208693
Some results in tree automata
In this paper, we will essentially present three results in tree automata. Two of these are concerned with certain open problems posed by Rounds [1] and Martin and Vere [3], and the third one is related to the result of Peters and Ritchie [4].
 First we will briefly state the results and then describe them in some detail in Sections 2, 3, and 4.
5138605
String Adjunct Grammars
In this paper, we have introduced a new style of formal grammars called String Adjunct Grammars (AG). The rules in an AG have a considerably different formal character as compared to the 'rewrite rule' in a Phrase Structure Grammar (PSG). Such a study of formal grammars of different styles (i.e., formal character of rules) is of great interest because each style is well suited for characterizing certain aspects of natural language structure and is awkward for characterizing certain other aspects. Several subclasses of AG's motivated by strong linguistic considerations have been studied, comparing them with PSG's. Linguistic relevance of these grammars (and other gram mars suggested by this study) has been discussed at the end.
38151734
Role of Constrained Computational Systems in Natural Language Processing
Abstract The use of constrained formal/computational systems just adequate for modeling various aspects of language—syntax, semantics, pragmatics and discourse, among others, has proved to be an effective research strategy leading to deep understanding of these aspects, with implications to both machine processing and human processing. This approach enables one to distinguish between the universal and stipulative constraints. This is in contrast to an approach where we start with the most powerful formal/computational system and then model the phenomena by making all constraints stipulative in a sense. The use of constrained systems for modeling leads to some novel ways of describing locality of structures and brings out the relationship between the complexity of description of primitives and local computations over them. These ideas serve to unify theoretical, computational and statistical aspects of natural languages processing in AI. It is expected that this approach will be productive in other domains of AI.
3203844
Some Novel Applications of Explanation-Based Learning for Parsing Lexicalized Tree-Adjoining Grammars
In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to parsing Lexicalized Tree-Adjoining grammars. The novel aspects are (a) immediate generalization of parses in the training set, (b) generalization over recursive structures and (c) representation of generalized parses as Finite State Transducers. A highly impoverished parser called a "stapler" has also been introduced. We present experimental results using EBL for different corpora and architectures to show the effectiveness of our approach.
9264341
Discourse Relations: A Structural and Presuppositional Account Using Lexicalised TAG
We show that discourse structure need not bear the full burden of conveying discourse relations by showing that many of them can be explained nonstructurally in terms of the grounding of anaphoric presuppositions (Van der Sandt, 1992). This simplifies discourse structure, while still allowing the realisation of a full range of discourse relations. This is achieved using the same semantic machinery used in deriving clause-level semantics.
42398377
A Policy Based Approach to Security for the Semantic Web
Along with developing specifications for the description of meta-data and the extraction of information for the Semantic Web, it is important to maximize security in this environment, which is fundamentally dynamic, open and devoid of many of the clues human societies have relied on for security assessment. Our research investigates the marking up of web entities with a semantic policy language and the use of distributed policy management as an alternative to traditional authentication and access control schemes. The policy language allows policies to be described in terms of deontic concepts and models speech acts, which allows the dynamic modification of existing policies, decentralized security control and less exhaustive policies. We present a security framework, based on this policy language, which addresses security issues for web resources, agents and services in the Semantic Web.
7243331
Using location information for scheduling in 802.15.3 MAC
In recent years, UWB has received much attention as a suitable physical layer (PHY) for wireless personal area networks (WPANS). UWB allows for low cost, low power, high bandwidth, short reach communication well suited for personal operating spaces. One of the key features offered by UWB is very accurate ranging between a transmitter/receiver pair. The IEEE 802.15.3 is a MAC protocol that has been proposed for WPANs. In this MAC, a combination of CSMA/CA and TDMA is used to achieve channel scheduling. The TDMA component ensures only one transmitter/receiver pair within a piconet is active at any given time thereby ensuring an exclusion region that covers the whole piconet. In this paper, we propose a less stringent scheduling mechanism that allows for concurrent communication between UWB transmitter/receiver pairs within a piconet. Exclusion is necessary only when the communicating entities are close enough such that interference between them would adversely affect successful reception of data at the receivers. The piconet coordinator (PNC) uses the ranging information provided by UWB to accurately position transmitters and receivers. The PNC schedules parallel transmissions between distinct transmit/receive pairs as long as they do not interfere. We present the results of our simulations of our proposed modifications and show that the network throughput can be significantly increased with very little change to the 802.15.3 MAC.
207155768
Swoogle: a search and metadata engine for the semantic web
Swoogle is a crawler-based indexing and retrieval system for the Semantic Web. It extracts metadata for each discovered document, and computes relations between documents. Discovered documents are also indexed by an information retrieval system which can use either character N-Gram or URIrefs as keywords to find relevant documents and to compute the similarity among a set of documents. One of the interesting properties we compute is <i>ontology rank</i>, a measure of the importance of a Semantic Web document.
40577335
Service Composition for Mobile Environments
Service Composition, that is, the development of customized services by discovering, integrating and executing existing services has received a lot of attention in the last couple of years with respect to wired-infrastructure or Internet web services. With the advancement in the wireless technology and rapid deployment of mobile devices, we envision that in the near future wirelessly connected mobile devices in a given vicinity will also provide services that can be leveraged in the composition process. This is particularly true of what have been described as “pervasive computing” environments. However, wired-infrastructure based service composition architectures are not designed to consider the various factors like mobility, device heterogeneity, resource variability and reliability in a mobile environment. In this paper, we describe the issues related to service composition in mobile environments and evaluate criteria for judging protocols that enable such composition. We present a distributed architecture and associated protocols for service composition in mobile environments that take into consideration mobility, dynamic changing service topology and device resources. The composition protocols are based on distributed brokerage mechanisms and utilize a distributed service discovery process over ad-hoc network connectivity. We present simulation results of our protocols, and compare them with a centralized service composition protocol traditionally used for wired-infrastructure environments. The results show that our approach clearly outperforms the existing centralized approaches, and that our protocols are able to adapt and better utilize the changing service topology and resources in a mobile environment.
5320074
Using Lexicalized Tags for Machine Translation
Lexicalized Tree Adjoining Grammar (LTAG) is an attractive formalism for linguistic description mainly because of its extended domain of locality and its factoring recursion out from the domain of local dependencies (Joshi, 1985, Kroch and Joshi, 1985, Abeille, 1988). LTAG's extended domain of locality enables one to localize syntactic dependencies (such as filler-gap), as well as semantic dependencies (such as predicate-arguments). The aim of this paper is to show that these properties combined with the lexicalized property of LTAG are especially attractive for machine translation.The transfer between two languages, such as French and English, can be done by putting directly into correspondence large elementary units without going through some interlingual representation and without major changes to the source and target grammars. The underlying formalism for the transfer is "synchronous Tree Adjoining Grammars" (Shieber and Schabes [1990]). Transfer rules are stated as correspondences between nodes of trees of large domain of locality which are associated with words. We can thus define lexical transfer rules that avoid the defects of a mere word-to-word approach but still benefit from the simplicity and elegance of a lexical approach.We rely on the French and English LTAG grammars (Abeille [1988], Abeille [1990 (b)], Abeille et al. [1990], Abeille and Schabes [1989, 1990]) that have been designed over the past two years jointly at University of Pennsylvania and University of Paris 7-Jussieu.