This paper considers a finite-state parsing algorithm for implementing natural language interfaces. The algorithm has some practical improvements compared to other recognizing algorithms. Resolution of syntax ambiguity, programming facilities and post execution of semantic actions are discussed too. Our approach was implemented in order to design the GILENA software tool which automatically allows to generate natural language interfaces. In addition, our designed algorithm, its implementation and its results are discussed.
|Number of pages
|SIGPLAN Notices (ACM Special Interest Group on Programming Languages)
|Published - Sep 1998
- Natural-Language Interfaces