SYSTEM DEMONSTRATION NATURAL LANGUAGE GENERATION WITH ABSTRACT MACHINE

Evgeniy Gabrilovich; Nissirn Francez; Shuly Wintner

SYSTEM DEMONSTRATION NATURAL LANGUAGE GENERATION WITH ABSTRACT MACHINE

Evgeniy Gabrilovich
, Nissirn Francez
, Shuly Wintner

Research output: Contribution to conference › Paper › peer-review

Abstract

We present a system for Natural Language Generation based on an Abstract Machine approach. Our abstract machine operates on grammars encoded in a unification-based Typed Feature Structure formalism, and is capable of both generation and parsing. For efficient generation, grammars are first inverted to a suitable form, and then compiled into abstract machine instructions. A dual compiler translates the same input grammar into an abstract machine program for parsing. Both generation and parsing programs are executed under the same (chart-based) evaluation strategy: This results in an efficient, bidirectional (parsing/generation) System for Natural Language Processing. Moreover, the system possesses ample debugging features, and thus can serve as a user-friendly environment for bidirectional grammar design and development.

Original language	English
Pages	276-279
Number of pages	4
State	Published - 1998
Externally published	Yes
Event	Proceedings of the 9th International Workshop on Natural Language Generation, INLG 1998 - Niagara-on-the-Lake, Canada Duration: 5 Aug 1998 → 7 Aug 1998

Conference

Conference	Proceedings of the 9th International Workshop on Natural Language Generation, INLG 1998
Country/Territory	Canada
City	Niagara-on-the-Lake
Period	5/08/98 → 7/08/98

Bibliographical note

Publisher Copyright:
© 1998 NLG. All Rights Reserved.

ASJC Scopus subject areas

Software

Cite this

@conference{b6326d00a5aa45d9a353e6a02a98952d,

title = "SYSTEM DEMONSTRATION NATURAL LANGUAGE GENERATION WITH ABSTRACT MACHINE",

abstract = "We present a system for Natural Language Generation based on an Abstract Machine approach. Our abstract machine operates on grammars encoded in a unification-based Typed Feature Structure formalism, and is capable of both generation and parsing. For efficient generation, grammars are first inverted to a suitable form, and then compiled into abstract machine instructions. A dual compiler translates the same input grammar into an abstract machine program for parsing. Both generation and parsing programs are executed under the same (chart-based) evaluation strategy: This results in an efficient, bidirectional (parsing/generation) System for Natural Language Processing. Moreover, the system possesses ample debugging features, and thus can serve as a user-friendly environment for bidirectional grammar design and development.",

author = "Evgeniy Gabrilovich and Nissirn Francez and Shuly Wintner",

note = "Publisher Copyright: {\textcopyright} 1998 NLG. All Rights Reserved.; Proceedings of the 9th International Workshop on Natural Language Generation, INLG 1998 ; Conference date: 05-08-1998 Through 07-08-1998",

year = "1998",

language = "English",

pages = "276--279",

}

TY - CONF

T1 - SYSTEM DEMONSTRATION NATURAL LANGUAGE GENERATION WITH ABSTRACT MACHINE

AU - Gabrilovich, Evgeniy

AU - Francez, Nissirn

AU - Wintner, Shuly

PY - 1998

Y1 - 1998

N2 - We present a system for Natural Language Generation based on an Abstract Machine approach. Our abstract machine operates on grammars encoded in a unification-based Typed Feature Structure formalism, and is capable of both generation and parsing. For efficient generation, grammars are first inverted to a suitable form, and then compiled into abstract machine instructions. A dual compiler translates the same input grammar into an abstract machine program for parsing. Both generation and parsing programs are executed under the same (chart-based) evaluation strategy: This results in an efficient, bidirectional (parsing/generation) System for Natural Language Processing. Moreover, the system possesses ample debugging features, and thus can serve as a user-friendly environment for bidirectional grammar design and development.

AB - We present a system for Natural Language Generation based on an Abstract Machine approach. Our abstract machine operates on grammars encoded in a unification-based Typed Feature Structure formalism, and is capable of both generation and parsing. For efficient generation, grammars are first inverted to a suitable form, and then compiled into abstract machine instructions. A dual compiler translates the same input grammar into an abstract machine program for parsing. Both generation and parsing programs are executed under the same (chart-based) evaluation strategy: This results in an efficient, bidirectional (parsing/generation) System for Natural Language Processing. Moreover, the system possesses ample debugging features, and thus can serve as a user-friendly environment for bidirectional grammar design and development.

UR - https://www.scopus.com/pages/publications/105016875860

M3 - Paper

AN - SCOPUS:105016875860

SP - 276

EP - 279

T2 - Proceedings of the 9th International Workshop on Natural Language Generation, INLG 1998

Y2 - 5 August 1998 through 7 August 1998

ER -

SYSTEM DEMONSTRATION NATURAL LANGUAGE GENERATION WITH ABSTRACT MACHINE

Abstract

Conference

Bibliographical note

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this