How to replace failure by a list of successes
Proc. of a conference on Functional programming languages and computer architecture
Type-theoretical grammar
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Context-Relative Syntactic Categories and the Formalization of Mathematical Text
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Bootstrapping morphological analyzers by combining human elicitation and machine learning
Computational Linguistics
An extensible proof text editor
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
| Hi-index | 0.00 |
This report explains a natural-language interface to the formalism of XFST (Xerox Finite State Tool), which is a rich language used for specifying finite state automata and transducers. By using the interface, it is possible to give input to XFST in English and French, as well as to translate formal XFST code into these languages. It is also possible to edit XFST source files and their natural-language equivalents interactively, in parallel. The interface is based on an abstract syntax of the regular expression language and of a corresponding fragment of natural language. The relations between the different components are defined by compositional interpretation and generation functions, and by corresponding combinatory parsers. This design has been inspired by the logical grammar of Montague. The grammar-driven design makes it easy to extend and to modify the interface, and also to link it with other functionalities such as compiling and semantic reasoning. It is also easy to add new languages to the interface. Both the grammatical theory and the interface facilities based on it have been implemented in the functional programming language Haskell, which supports a declarative and modular style of programming. Some of the modules developed for the interface have other uses as well: there is a type system of regular expressions, preventing some compiler errors, a denotational semantics in terms of lazy lists, and an extension of the XFST script language by definitions of functions.