Nissim Francez


2017

pdf bib
A Proof-Theoretic Semantics for Transitive Verbs with an Implicit Object
Nissim Francez
Proceedings of the 15th Meeting on the Mathematics of Language

2002

pdf bib
Guaranteeing Parsing Termination of Unification Grammars
Efrat Jaeger | Nissim Francez | Shuly Wintner
COLING 2002: The 19th International Conference on Computational Linguistics

2000

pdf bib
Querying Temporal Databases Using Controlled Natural Language
Rani Nelken | Nissim Francez
COLING 2000 Volume 2: The 18th International Conference on Computational Linguistics

1995

pdf bib
Splitting the Reference Time: Temporal Anaphora and Quantification in DRT
Rani Nelken | Nissim Francez
Seventh Conference of the European Chapter of the Association for Computational Linguistics

pdf bib
Parsing with Typed Feature Structures
Shuly Wintner | Nissim Francez
Proceedings of the Fourth International Workshop on Parsing Technologies

In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE ([2]). Our motivation being the design of an abstract (WAM-like) machine for the formalism ([14]), we consider parsing as a computational process and use it as an operational semantics to guide the design of the control structures for the abstract machine. We emphasize the notion of abstract typed feature structures (AFSs) that encode the essential information of TFSs and define unification over AFSs rather than over TFSs. We then introduce an explicit construct of multi-rooted feature structures (MRSs) that naturally extend TFSs and use them to represent phrasal signs as well as grammar rules. We also employ abstractions of MRSs and give the mathematical foundations needed for manipulating them. We then present a simple bottom-up chart parser as a model for computation: grammars written in the TFS-based formalism are executed by the parser. Finally, we show that the parser is correct.