Work

Creating a finite-state parser with application semantics

Year: 2002

Type: conference-paper

Abstract: Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon is defined in terms of a lexicalized Tree Adjoining Grammar, which is subsequently mapped to a FS representation. This approach gives the application designer better and easier control over the natural language understanding component than using an off-the-shelf parser. We present results using Parsli on an application that creates 3D-images from typed input.

Source: International Conference on Computational Linguistics

DOI: 10.3115/1071884.1071910

Authors: Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexis Nasr, Richard Sproat

Institutions: University of Pennsylvania, AT&T (United States), Johns Hopkins University

Language: English

Topic: Natural Language Processing Techniques

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W1973236505

FWCI: 0.271

Cites: 10

Cited by: 9

Related to: 10