TEAM: an experiment in the design of transportable natural-language interfaces
Artificial Intelligence
Problems in natural-language interface to DBMS with examples from EUFID
ANLC '83 Proceedings of the first conference on Applied natural language processing
Natural language and databases, again
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Building a large knowledge base for a natural language system
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Translating English into logical form
ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics
Natural-language access to databases: theoretical/technical issues
ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
This paper presents an implementation of formal semantics as described in Keenan and Faltz's Boolean Semantics for Natural Language (4). The main characteristic of this implementation is that it avoids the intermediate step of translating NL into a formal language, such as an extended version of predicate calculus. My choice of not using any intermediate language, which Montague already suggested in Universal Grammar (5), makes my implementation free of the problems related to the syntax of such a language like binding the variables and resolving scope ambiguities. On the other hand, not translating NL into an intermediate language requires every denotation (i.e. semantic value) to be explicitly and accurately represented in a database.